Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs

DOI10.1016/j.artint.2011.07.001zbMath1238.91011OpenAlexW2011937745MaRDI QIDQ420790

Pingzhong Tang, Fangzhen Lin

Publication date: 23 May 2012

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2011.07.001

zbMATH Keywords

game theorystrictly competitive gamescomputer-aided theorem discoverypure Nash equilibriumstrict gamesuniqueness of pure Nash equilibrium payoff

Mathematics Subject Classification ID

2-person games (91A05)

Related Items

Algorithmic Decision Theory Meets Logic ⋮ Voting theory in the Lean theorem prover ⋮ Characterizing causal action theories and their implementations in answer set programming ⋮ An introduction to mechanized reasoning

Uses Software

• GRAFFITI

Cites Work

• Two equivalence results for two-person strict games
• Computer-aided proofs of Arrow's and other impossibility theorems
• On conjectures of Graffiti
• Unilaterally competitive games
• Correlated equilibria in some classes of two-person games
• Potential games
• Automated Design of Revenue-Maximizing Combinatorial Auctions
• Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
• Almost Strictly Competitive Games
• Unnamed Item
• Unnamed Item
• Unnamed Item