Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms

DOI10.1007/s10472-022-09820-3arXiv2204.10213OpenAlexW4306849204MaRDI QIDQ6150959

Vladimir A. Gurvich, Mariya Naumova

Publication date: 9 February 2024

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.10213

zbMATH Keywords

Nash equilibriumtransversallexicographical orderNash-solvabilitydual hypergraphslexmax edgetight game form

Mathematics Subject Classification ID

Hypergraphs (05C65) Games involving graphs (91A43)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note of tight extensive game forms
• Two-sided matching with incomplete information about others' preferences
• Tight and effectively rectangular game forms: A Nash solvable class
• A three-person deterministic graphical game without Nash equilibria
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Payoff information and self-confirming equilibrium
• Discovery and equilibrium in games with unawareness
• Non-cooperative games
• Rectangularity and Tightness: A Normal Form Characterization of Perfect Information Extensive Game Forms
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• The solvability of positional games in pure strategies
• Bottleneck extrema
• Equilibrium points in n -person games

This page was built for publication: Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms