The solvability of positional games in pure strategies
From MaRDI portal
Publication:4103355
DOI10.1016/0041-5553(75)90042-7zbMath0336.90070OpenAlexW2062541377MaRDI QIDQ4103355
Publication date: 1976
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(75)90042-7
Related Items (22)
Total tightness implies Nash-solvability for three-person game forms ⋮ Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Unnamed Item ⋮ Chess-like games may have no uniform Nash equilibria even in mixed strategies ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ War and peace in veto voting ⋮ Separable discrete functions: recognition and sufficient conditions ⋮ A three-person deterministic graphical game without Nash equilibria ⋮ Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames ⋮ Acyclic, or totally tight, two-person game forms: characterization and main properties ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ On acyclicity of games with cycles ⋮ Generating dual-bounded hypergraphs ⋮ On effectivity functions of game forms ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Monotone bargaining is Nash-solvable ⋮ On Acyclicity of Games with Cycles ⋮ Minimal and locally minimal games and game forms ⋮ Nash consistent representation of constitutions: A reaction to the Gibbard paradox.
This page was built for publication: The solvability of positional games in pure strategies
