Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles

DOI10.1016/j.dam.2023.06.030zbMath1522.91025OpenAlexW4384306288MaRDI QIDQ6094712

Mariya Naumova, Vladimir A. Gurvich

Publication date: 14 September 2023

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

Full work available at URL: https://doi.org/10.1016/j.dam.2023.06.030

zbMATH Keywords

Nash equilibriumtightnessNash-solvabilitygame formveto votinggame in normal and in positional formdeterministic graphical game structureJordan gamemonotone bargaining

Mathematics Subject Classification ID

2-person games (91A05) Voting theory (91B12) Equilibrium refinements (91A11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclicity of improvements in finite game forms
• Nash-solvable two-person symmetric cycle game forms
• A comment on pure-strategy Nash equilibria in competitive diffusion games
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• A note on competitive diffusion through social networks
• A strong-connectivity algorithm and its applications in data flow analysis
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Complexity of generation
• Monotone bargaining is Nash-solvable
• Potential games
• Nash equilibria for competitive information diffusion on trees
• On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
• Deterministic graphical games
• War and peace in veto voting
• A class of games possessing pure-strategy Nash equilibria
• Non-cooperative games
• Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Tight cyclic game forms
• The solvability of positional games in pure strategies
• Generating dual-bounded hypergraphs
• Backward induction in presence of cycles
• Pure Nash Equilibria in Resource Graph Games
• Bottleneck extrema
• Depth-First Search and Linear Graph Algorithms
• Equilibrium points in n -person games
• A Theory of N -Person Games with Perfect Information
• Deterministic Graphical Games Revisited
• College Admissions and the Stability of Marriage

This page was built for publication: Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles