Abstract
We study a variant of the tenure game introduced by J. Spencer (Theor. Comput. Sci. 131 (1994), 415–429). In this version, chips are not removed from the game, but moved down to the lowest level instead. Though the rules of both versions differ only slightly, it seems impossible to convert an upper bound strategy into a lower bound one using the antirandomization approach of Spencer (which was very effective for the original game and several others).
For the upper bound we give a potential function argument (both randomized and derandomized). We manage to prove a nearly matching lower bound using a strategy that can be interpreted as an antirandomization of Spencer’s original game.
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
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, V. Guruswam, T. Kaufman, and M. Sudan. Guessing secrets efficiently via list decoding. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 254–262, 2002.
I. Barany. On a class of balancing games. J. Combin. Theory Ser. A, 26:115–126, 1979.
I. Barany and V. S. Grunberg. On some combinatorial questions in finite dimensional spaces. Linear Algebra Appl., 41:1–9, 1981.
F. Chung, R. Graham, and T. Leighton. Guessing secrets. Electron. J. Comb., 8:Research Paper 13, approx. 25 pp. (electronic), 2001.
F. Chung, R. Graham, and L. Lu. Guessing secrets with inner product questions. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 247–253, 2002.
B. Doerr. Vector balancing games respecting aging. J. Combin. Theory Ser. A, 95:219–233, 2001.
J. Olson. A balancing strategy. J. Combin. Theory Ser. A, 40:175–178, 1985.
A. Pelc. Searching games with errors — fifty years of coping with liars. Theor. Comput. Sci., 270:71–109, 2002.
H. Peng and C. H. Yan. Balancing game with a buffer. Adv. Appl. Math., 21:193–204, 1998.
J. Spencer. Balancing games. J. Combin. Theory Ser. B, 23:68–74, 1977.
J. Spencer. Randomization, derandomization and antirandomization: Three games. Theor. Comput. Sci., 131:415–429, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerr, B. (2002). Antirandomizing the Wrong Game. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_75
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive