Bounded rationality, strategy simplification, and equilibrium

DOI10.1007/S00182-011-0293-7MaRDI QIDQ361802zbMATHOpenAlexFDO

Authors Hubie Chen

Publication date 19 August 2013

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.4577

zbMATH Keywords

automatabounded rationalityrepeated gamesimplification

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20) Rationality and learning in game theory (91A26)

Abstract: It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that players in a game may desire to balance maximization of payoff with minimization of strategy complexity, Rubinstein and co-authors studied forms of Nash equilibrium where strategies are maximally simplified in that no strategy can be further simplified without sacrificing payoff. Inspired by this line of work, we introduce a notion of equilibrium whereby strategies are also maximally simplified, but with respect to a simplification procedure that is more careful in that a player will not simplify if the simplification incents other players to deviate. We study such equilibria in two-player machine games in which players choose finite automata that succinctly represent strategies for repeated games; in this context, we present techniques for establishing that an outcome is at equilibrium and present results on the structure of equilibria.

Recommendations

• scientific article; zbMATH DE number 4202070
• Bounded rationality and correlated equilibria
• Bounded rationality in multiobjective games
• Models of Bounded Rationality and Mechanism Design
• Toward a Strategic Foundation for Rational Expectations Equilibrium
• Bounded rationality and stability of solutions to some equilibrium problems
• The complexity of resource allocation and price mechanisms under bounded rationality
• Bounded rationality. A Simon-like explication
• Obvious strategyproofness, bounded rationality and approximation

Cites work

• scientific article; zbMATH DE number 4202070 (Why is no real title available?)
• scientific article; zbMATH DE number 1054720 (Why is no real title available?)
• A course in game theory.
• Algorithmic rationality: game theory with costly computation
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Cooperation in the prisoner's dilemma
• Finite Rationality and Interpersonal Complexity in Repeated Games
• Finite automata play a repeated extensive game
• Finite automata play the repeated prisoner's dilemma
• On complexity as bounded rationality (extended abstract)
• On players with a bounded number of states
• Program equilibrium
• Rationality, Computability, and Nash Equilibrium
• Repeated games with finite automata
• Repeated games, finite automata, and complexity
• Simplicity of beliefs and delay tactics in a concession game
• Some notes on Church's thesis and the theory of games
• Testing threats in repeated games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• The complexity of computing a best response automaton in repeated games with mixed strategies
• The complexity of computing best-response automata in repeated games

Cited in

(7)

• scientific article; zbMATH DE number 592681 (Why is no real title available?)
• Simplicity of beliefs and delay tactics in a concession game
• Directed graphical structure, Nash equilibrium, and potential games
• Bounded rationality. A Simon-like explication
• Implementation in adaptive better-response dynamics: towards a general theory of bounded rationality in mechanisms
• Algorithmic rationality: game theory with costly computation
• Complexity of games and bounded rationality

This page was built for publication: Bounded rationality, strategy simplification, and equilibrium

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361802)