Total tightness implies Nash-solvability for three-person game forms

DOI10.1016/j.disc.2011.12.028zbMath1236.91011OpenAlexW2108743410WikidataQ59560525 ScholiaQ59560525MaRDI QIDQ408181

Endre Boros, Ondřej Čepek, Vladimir A. Gurvich

Publication date: 29 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.028

zbMATH Keywords

Nash equilibriumacyclicdominance-solvable game formsNash-solvabilitytotally tight

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06)

Related Items (1)

Separable discrete functions: recognition and sufficient conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclicity of improvements in finite game forms
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Dominance Solvable Voting Schemes
• The solvability of positional games in pure strategies

This page was built for publication: Total tightness implies Nash-solvability for three-person game forms