The following is the html for my project,

 

</html> Potential 1 : "Hat Guessing Games"

 

<p> This project describes the mathematics behind the hat problem, where 
each of n players tries to guess the color of the hat that he/she is 
wearing by observing the hats worn by other players

 

<p> Hat Guessing Games, Steve Butler, Mohammad Hajiaghayim Robert D. 
Kleinberg and Tom Leighton, SIAM J. Discrete Math, vol 22

 

<p> Potential 2: "Playing golf with 2 balls"

 

<p> This project analyzes a game where a player chooses which of several 
markov chains to advance with the object of minimizing expected time for 
one of the chains to reach a target state. For example, would it be 
quicker to use one ball or 2 balls to eventually score the ball in golf.

 

<p> On playing Golf with Two Balls, Ioana Dumitriu, Prasad Tetali and 
Peter Winkler, SIAM J. Discrete Math, vol 16

 

<p> Potential 3: "Exact Analysis of Exact Change"

 

<p> This project helps solve the problem that given a total budget of N 
units, the problem is to represent this budget as a set of coins, so that 
any k exact payments of total value at most N can be made using k disjoint 
subsets of the coins. The goal is to minimize the number of coins for any 
given N and k, while allowing the actual payments to be made on-line, 
namely without the need to know all payment requests in advance.

 

<p> EXACT ANALYSIS OF EXACT CHANGE:THE k-PAYMENT PROBLEM# BOAZ 
PATT-SHAMIR, YIANNIS TSIOUNIS#, AND YAIR FRANKEL, SIAM J. Discrete Math, 
Vol 13 

 

</html>