Optimality and domination in repeated games with bounded players

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimality and domination in repeated games with bounded players

Full text

Pdf (845 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing table of contents

Montreal, Quebec, Canada

Pages: 741 - 749

Year of Publication: 1994

ISBN:0-89791-663-8

Authors

Lance Fortnow	Department of Computer Science, The University of Chicago, 1100 East 58th Street, Chicago, Illinois
Duke Whang	Department of Computer Science, The University of Chicago, 1100 East 58th Street, Chicago, Illinois

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/195058.195448 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ang87	Dana Angluin, Learning regular sets from queries and counterexamples, Information and Computation, v.75 n.2, p.87-106, November 1, 1987 [doi>10.1016/0890-5401(87)90052-6]
	GJ79	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	GS89	I. Gilboa and D. Samet. Bounded versus unbounded rationality: The tyranny of the weak. Games and Economic Behavior, 1(3):213-221, 1989.
	HU79	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	Kal90	E. KaIai. Bounded rationality and strategic complexity in repeated games. In T. ichiishi, A. Neyman, and Y. Tauman, editors, Game Theory and Applications, pages 131- 157. Academic Press, San Diego, 1990.
	Kno94	V. Knoblauch. Computable strategies for repeated prisoner's dilemma. Games and Economic Behavior, 1994. To appear.
	RS93	Ronald L. Rivest , Robert E. Schapire, Inference of finite automata using homing sequences, Information and Computation, v.103 n.2, p.299-347, April 1993 [doi>10.1006/inco.1993.1021]

CITED BY 7

	Martin Kummer , Matthias Ott, Learning branches and learning to win closed games, Proceedings of the ninth annual conference on Computational learning theory, p.280-291, June 28-July 01, 1996, Desenzano del Garda, Italy
	Dana Ron , Ronitt Rubinfeld, Exactly learning automata with small cover time, Proceedings of the eighth annual conference on Computational learning theory, p.427-436, July 05-08, 1995, Santa Cruz, California, United States
	Dana Ron , Ronitt Rubinfeld, Exactly Learning Automata of Small Cover Time, Machine Learning, v.27 n.1, p.69-96, April 1997
	Lance Fortnow , Peter Kimmel, Beating a finite automaton in the big match, Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge, July 22-24, 1998, Evanston, Illinois
	Bikramjit Banerjee , Jing Peng, Efficient learning of multi-step best response, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, July 25-29, 2005, The Netherlands
	David Carmel , Shaul Markovitch, Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies, Autonomous Agents and Multi-Agent Systems, v.2 n.2, p.141-172, June 1999
	Matt Lepinski , David Liben-Nowell , Seth Gilbert , April Rasala Lehman, Playing games in many possible worlds, Proceedings of the 7th ACM conference on Electronic commerce, p.150-159, June 11-15, 2006, Ann Arbor, Michigan, USA