Nash equilibria and values through modular partitions in infinite games
From MaRDI portal
Publication:409463
DOI10.1016/j.disc.2011.12.005zbMath1235.91028OpenAlexW2078965013MaRDI QIDQ409463
Marianne Morillon, Patricia Spinelli
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.005
partitiongame theoryNash equilibriumoriented graphtournamentmodulevaluenon cooperative gameszero-sum symmetric two-player game
Noncooperative games (91A10) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- The morphology of infinite tournaments; application to the growth of their profile
- Theory of relations. Transl. from the French by P. Clote
- The bipartisan set of a tournament game
- A theorem on symmetric two-player zero-sum games
- Weak topology and infinite matrix games
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Non-cooperative games
- Generalization of a theorem by v. Neumann concerning zero sum two person games
- On the Value of Some Infinite Matrix Games
- Transitiv orientierbare Graphen
- Modules of Coherent Binary Systems
- Equilibrium points in n -person games
This page was built for publication: Nash equilibria and values through modular partitions in infinite games