Computing equilibria in discounted dynamic games
From MaRDI portal
Publication:668745
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20) Dynamic games (91A25)
Recommendations
Cites work
- scientific article; zbMATH DE number 5081361 (Why is no real title available?)
- scientific article; zbMATH DE number 5485548 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- A belief-based evolutionarily stable strategy
- Algorithms for finding repeated game equilibria
- An approximate folk theorem with imperfect private information
- An efficient algorithm for determining the convex hull of a finite planar set
- Coase theorem, complexity and transaction costs
- Communication in Repeated Games with Imperfect Private Monitoring
- Computing Supergame Equilibria
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Equilibrium points in n -person games
- Finite Rationality and Interpersonal Complexity in Repeated Games
- Finite automata equilibria with discounting
- Finite automata play a repeated extensive game
- Finite automata play the repeated prisoner's dilemma
- Multiagent Systems
- Networks, crowds and markets. Reasoning about a highly connected world.
- Obtaining reliable feedback for sanctioning reputation mechanisms
- On the Theory of Infinitely Repeated Games with Discounting
- Perfect Equilibria in a Negotiation Model
- Stochastic games
- Strongly symmetric subgame perfect equilibria in infinitely repeated games with perfect monitoring and discounting
- The Folk Theorem for Games with Private Almost-Perfect Monitoring
- The Folk Theorem with Imperfect Public Information
- The Structure of Nash Equilibrium in Repeated Games with Finite Automata
- The Value of Markov Chain Games with Lack of Information on One Side
- The bargaining problem
- The complexity of computing a Nash equilibrium
- The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor
- Toward a Theory of Discounted Repeated Games with Imperfect Monitoring
Cited in
(11)- Computing Equilibria of Dynamic Games
- On the equilibria of alternating move games
- Computing Equilibria with Partial Commitment
- Computing Stable Outcomes in Hedonic Games
- Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players
- On the computation of value correspondences for dynamic games
- Ruling out multiplicity of smooth equilibria in dynamic games: a hyperbolic discounting example
- Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation
- Computing equilibria in dynamic models with occasionally binding constraints
- The complexity of infinitely repeated alternating move games
- A distributed algorithm to obtain repeated games equilibria with discounting
This page was built for publication: Computing equilibria in discounted dynamic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668745)