The hat problem on a union of disjoint graphs

• Autorzy: Krzywkowski M.
• Języki publikacji: EN

Abstrakty

EN

The topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player can see everybody excluding himself. We consider such a problem on a graph, where vertices correspond to players, and a player can see each player to whom he is connected by an edge. The solution of the hat problem is known for cycles and bipartite graphs. We investigate the problem on a union of disjoint graphs.

Słowa kluczowe

EN

hat problem; graph; disjoint; union

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Commentationes Mathematicae
• Rocznik: 2011
• Tom: Vol. 51, [Z] 2
• Strony: 167--176
• Opis fizyczny: Bibliogr. 28 poz., tab.

Twórcy

autor

Krzywkowski M.

• Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology Narutowicza 11/12, 80-233 Gdańsk, Poland,

Bibliografia

• [1] G. Aggarwal, A. Fiat, A. Goldberg, J. Hartline, N. Immorlica, and M. Sudan, Derandomiza-tion of auctions, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 619-625, ACM, New York, 2005.
• [2] J. Aspnes, R. Beigel, M. Furst, and S. Rudich, The expressive power of voting polynomials, Combinatorica 14 (1994), 135-148.
• [3] R. Beigel, L. Fortnow, and F. Stephan, Infinitely-often autoreducible sets, SIAM Journal on Computing 36 (2006), 595-608.
• [4] Berkeley Riddles, www.ocf.berkeley.edu/~wwu/riddles/hard.shtml.
• [5] M. Bernstein, The hat problem and Hamming codes, MAA Focus, November, 2001, 4-6.
• [6] W. Blum, Denksport fur Huttrdger, Die Zeit, May 3, 2001.
• [7] M. Breit, D. Deshommes, and A. Falden, Hats required: perfect and imperfect strategies for, the hat problem, manuscript.
• [8] E. Brown, K. Mellinger, Kirkman's schoolgirls wearing hats and walking through fields of numbers, Mathematics Magazine 82 (2009), 3-15.
• [9] E. Burke, S. Gustafson, and G. Kendall, A Puzzle to challenge genetic programming, Genetic Programming, 136-147, Lecture Notes in Computer Science, Springer, 2002.
• [10] S. Butler, M. Hajianghayi, R. Kleinberg, and T. Leighton, Hat guessing games, SIAM Journal on Discrete Mathematics 22 (2008), 592-605.
• [11] G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes, North Holland, 1997
• [12] T. Ebert, Applications of recursive operators to randomness and complexity, Ph.D. Thesis, University of California at Santa Barbara, 1998.
• [13] T. Ebert and W. Merkle, Autoreducibility of random sets: a sharp bound on the density of guessed bits, Mathematical foundations of computer science 2002, 221-233, Lecture Notes in Computer Science, 2420, Springer, Berlin, 2002.
• [14] T. Ebert, W. Merkle, and H. Vollmer, On the autoreducibility of random sequences, SIAM Journal on Computing 32 (2003), 1542-1569.
• [15] T. Ebert and H. Vollmer, On the autoreducibility of random sequences, Mathematical foundations of computer science 2000 (Bratislava), 333-342, Lecture Notes in Computer Science, 1893, Springer, Berlin, 2000.
• [16] U. Feige, On optimal strategies for a hat game on graphs, SIAM Journal on Discrete Mathematics 24 (2010), 782-791.
• [17] U. Feige, You can leave your hat on (if you guess its color), Technical Report MCS04-03, Computer Science and Applied Mathematics, The Weizmann Institute of Science, 2004, 10 pp.
• [18] W. Guo, S. Kasala, M. Rao, and B. Tucker, The hat problem, and some variations, Advances in distribution theory, order statistics, and inference, 459-479, Statistics for Industry and Technology, Birkhauser Boston, 2007.
• [19] N. Immorlica, Computing with strategic agents, Ph.D. Thesis, Massachusetts Institute of Technology, 2005.
• [20] M. Krzywkowski, A modified hat problem, Commentationes Mathematicae 50 (2010), 121-126.
• [21] M. Krzywkowski, Hat problem on a graph, Mathematica Pannonica 21 (2010), 3-21.
• [22] M. Krzywkowski, Hat problem on odd cycles, Houston Journal of Mathematics 37 (2011), 1063-1069.
• [23] M. Krzywkowski, Hat problem on the cycle C4, International Mathematical Forum 5 (2010), 205-212.
• [24] M. Krzywkowski, On the hat problem, its variations, and their applications, Annales Uni-versitatis Paedagogicae Cracoviensis Studia Mathematica 9 (2010), 55-67.
• [25] M. Krzywkowski, The hat problem on cycles on at least nine vertices, Ars Combinatoria 101 (2011), 3-13.
• [26] H. Lenstra and G. Seroussi, On hats and other covers, IEEE International Symposium on Information Theory, Lausanne, 2002.
• [27] J. Poulos, Could you solve this $1 million hat trick?, abcNews, November 29, 2001.
• [28] S. Robinson, Why mathematicians now care about their hat color, The New York Times, Science Times Section, page D5, April 10, 2001.