On acyclicity of games with cycles
DOI10.1016/J.DAM.2010.02.006zbMATH Open1231.91029OpenAlexW2136023657MaRDI QIDQ708338FDOQ708338
Authors: Daniel Andersson, Thomas Dueholm Hansen, Vladimir Gurvich 
Publication date: 11 October 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.006
Recommendations
- On Acyclicity of Games with Cycles
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Acyclicity of improvements in finite game forms
- Backward induction in presence of cycles
Nash equilibriumimprovement cycleNash-solvabilitypositional gamegame formrestricted acyclicityrestricted improvement cycle
Paths and cycles (05C38) (n)-person games, (n>2) (91A06) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Non-cooperative games
- Equilibrium points in n -person games
- Potential games
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Evolution of Conventions
- Bottleneck extrema
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Title not available (Why is that?)
- The solvability of positional games in pure strategies
- Nash-solvable two-person symmetric cycle game forms
- Perfect information and potential games
- On effectivity functions of game forms
Cited In (20)
- Raid games across a set with cyclic order
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- Title not available (Why is that?)
- Acyclicity of improvements in finite game forms
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
- On Acyclicity of Games with Cycles
- Acyclic Gambling Games
- Iterative voting and acyclic games
- Title not available (Why is that?)
- A search game on a cyclic graph
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- A three-person deterministic graphical game without Nash equilibria
- Strong and Weak Acyclicity in Iterative Voting
- A semi-potential for finite and infinite games in extensive form
- Highway games on weakly cyclic graphs
- Cyclical games with prohibitions
- Games without repetitions on graphs with vertex disjoint cycles
- Odd and even cycles in maker-breaker games
- Tight cyclic game forms
This page was built for publication: On acyclicity of games with cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708338)
