The Structure of Nash Equilibrium in Repeated Games with Finite Automata
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Codification schemes and finite automata
- Finite automata equilibria with discounting
- The strength of a little perfection
- Repeated games, finite automata, and complexity
- Computation as a correlation device
- Coalition formation under limited communication
- Equilibrium of repeated games with cost of implementation
- Predicting the effects of intervention and sabotage in a bounded complex game
- Informational requirements and strategic complexity in repeated games
- Nash equilibrium strategies in repeated games with and without cost of implementation
- Evolutionary stability in repeated games played by finite automata
- Evolutionary stability in alternating-offers bargaining games
- Communication, computability, and common interest games
- Forecasting errors and bounded rationality: An example
- Little perfection and complexity
- Bayesian boundedly rational agents play the finitely repeated prisoner's dilemma
- Computability, complexity and economics
- Representing the knowledge of Turing machines
- Finite automata play repeated prisoner's dilemma with information processing costs
- On calculating the Krohn-Rhodes decomposition of automata
- Satisficing leads to cooperation in mutual interests games
- Rationality and bounded rationality
- The evolution of rationality and the Red Queen.
- Nash equilibrium when players account for the complexity of their forecasts.
- Evolutionary stability and lexicographic preferences.
- Implementation of bargaining sets via simple mechanisms
- Asynchronous choice and Markov equilibria
- Uniqueness and efficiency of Nash equilibrium in a family of randomly generated repeated games.
- An axiomatization of plays in repeated games
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
- Errors can increase cooperation in finite populations
- On equilibria in games with imperfect recall
- Rationality and bounded information in repeated games, with application to the iterated prisoner's dilemma
- Applying a one-shot and infinite repeated inspection game to materials management
- Repeated games with finite automata
- Small talk and cooperation: A note on bounded rationality
- In defense of DEFECT.
- Bargaining and markets: Complexity and the competitive outcome
- Simplicity of beliefs and delay tactics in a concession game
- Subgame perfect equilibrium of repeated games with implementation costs
- Leave and let leave: a sufficient condition to explain the evolutionary emergence of cooperation
- Equilibrium payoffs in repeated two-player zero-sum games of finite automata
- Should I remember more than you? Best responses to factored strategies
- Reactive strategies: an inch of memory, a mile of equilibria
- Conditions that enable a player to surely win in sequential quantum games
- Stable sampling in repeated games
- Imperfect recall and time inconsistencies: an experimental test of the absentminded driver ``paradox
- Effective deadlock resolution with self-interested partially-rational agents
- Plausible cooperation
- Bounded rationality and repeated network formation
- Analogy-based expectation equilibrium
- In and out of equilibrium. II: Evolution in repeated games with discounting and complexity costs
- Limits of correlation in repeated games with bounded memory
- Strategic complexity in repeated extensive games
- The price of flexibility: towards a theory of thinking aversion
- A strong anti-folk theorem
- Coordination through de Bruijn sequences
- Evolutionary stability in repeated extensive games played by finite automata
- The complexity of interacting automata
- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game
- Asymmetry of customer loss and recovery under endogenous partnerships: theory and evidence
- Bounded computational capacity equilibrium
- scientific article; zbMATH DE number 4202070 (Why is no real title available?)
- Systems of Bounded Rational Agents with Information-Theoretic Constraints
- Bounded rationality, strategy simplification, and equilibrium
- Bounded memory and permanent reputations
- Model-based learning of interaction strategies in multi-agent systems
- Games with Symmetric Incomplete Information and Asymmetric Computational Resources
- Community enforcement with observation costs
- Learning with bounded memory in games
- Agility in repeated games: an example
- Trait-augmented games with limited-skill agents
- Game theory and strategic complexity
- Uncoupled automata and pure Nash equilibria
- On the Complexity of Coordination
- Analogies, adaptation, and anomalies
- Cooperation and computability in \(n\)-player games
- Bargaining with limited computation: Deliberation equilibrium
- Bottom-up design of strategic options as finite automata
- Modelling equilibrium play as governed by analogy and limited foresight
- Quantum Tapsilou -- a quantum game inspired by the traditional Greek coin tossing game Tapsilou
- On the complexity of forming mental models
- Behavioral spillovers and cognitive load in multiple games: an experimental study
- The effect of noise and average relatedness between players in iterated games
- Computing equilibria in discounted dynamic games
- Induction and the Ramsey policy
- Machine games: theory and experimental evidence
- An introduction to the special issue on behavioral game theory
- Algorithmic collusion and a Folk theorem from learning with bounded rationality
- An experiment on learning in a multiple games environment
- Learning across games
- Cognitive rationality and alternative belief measures
- A simple model of secure public communication
- The evolution of cooperative strategies for asymmetric social interactions
- Rational bargaining in games with coalitional externalities
- Complexity and repeated implementation
- In and out of equilibrium. I: Evolution of strategies in repeated games with discounting.
- Skill, complexity, and strategic interaction
- Repeated implementation and complexity considerations
- Adaptation and complexity in repeated games
This page was built for publication: The Structure of Nash Equilibrium in Repeated Games with Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815895)
