Abstract
Is there a joint distribution of n random variables over the natural numbers, such that they always form an increasing sequence and whenever you take two subsets of the set of random variables of the same cardinality, their distribution is almost the same?
We show that the answer is yes, but that the random variables will have to take values as large as 
, where \(\epsilon \le \epsilon _n\) measures how different the two distributions can be, the tower contains \(n-2\) 2’s and the constants in the \(\varTheta \) notation are allowed to depend on n. This result has an important consequence in game theory: It shows that even though you can define extensive form games that cannot be implemented on players who can tell the time, you can have implementations that approximate the game arbitrarily well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal, G., Fiat, A., Goldberg, A.V., Hartline, J.D., Immorlica, N., Sudan, M.: Derandomization of auctions. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 619–625. ACM (2005)
Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proceedings of the 15th ACM Symposium on Theory of Computing, pp. 94–99. ACM (1983)
Conway, J.H., Paterson, M.S., Moscow, U.S.S.R.: A headache-causing problem. In Een pak met een korte broek (1977). http://www.tanyakhovanova.com/BlogStuff/Conway/Headache.pdf
Jakobsen, S.K.: A numbers-on-foreheads game. arXiv, abs/1502.02849 (2015)
Jakobsen, S.K., Sørensen, T.B., Conitzer, V.: Timeability of extensive-form games. arxiv:1502.03430 (2015)
Krzywkowski, M.: On the hat problem, its variations, and their applications. Ann. Univ. Paedagog. Crac. Stud. Math. 9(1), 55–67 (2010)
Krzywkowski, M.: Hat problem on a graph. Ph.D. thesis, University of Exeter, April 2012
Lenstra Jr., H.W., Seroussi, G.: On hats and other covers. In: Proceedings IEEE International Symposium on Information Theory, p. 342. IEEE (2002)
Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York, NY, USA (2007)
Piccione, M., Rubinstein, A.: On the interpretation of decision problems with imperfect recall. Games Econ. Beha 20, 3–24 (1997)
Riis, S.: Information flows, graphs and their guessing numbers. Electr. J. Comb., 14(1), 17 p. (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jakobsen, S.K. (2015). A Numbers-on-Foreheads Game. In: Italiano, G., Pighizzini, G., Sannella, D. (eds) Mathematical Foundations of Computer Science 2015. MFCS 2015. Lecture Notes in Computer Science(), vol 9235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48054-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-662-48054-0_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48053-3
Online ISBN: 978-3-662-48054-0
eBook Packages: Computer ScienceComputer Science (R0)