A Note on Strictly Competitive Games

DOI10.1007/978-3-642-10841-9_44MaRDI QIDQ3651214zbMATH OpenOpenAlexFDO

Authors Ilan Adler, Constantinos Daskalakis, Christos Papadimitriou

Publication date 9 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10841-9_44

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05)

Recommendations

• Almost strict competitiveness in extensive games
• scientific article; zbMATH DE number 706394
• scientific article; zbMATH DE number 509218
• scientific article; zbMATH DE number 687938
• A note on biased and non-biased games
• A note of tight extensive game forms
• Remarks on strategies in combinatorial games
• scientific article; zbMATH DE number 754256
• A note on repeated extensive games
• A note on the permutationally convex games

Cited in

(11)

• Strong Nash equilibria and mixed strategies
• Berge equilibrium, altruism and social welfare
• Semidefinite Programming and Nash Equilibria in Bimatrix Games
• On characterizing equilibrium points in two person strictly competitive games
• Some remarks on games of certain star selection principles
• A note on bus games
• Patent Nash equilibria in symmetric strictly competitive games
• Almost strict competitiveness in extensive games
• Two-person adversarial games are zero-sum: an elaboration of a folk theorem
• Zero-sum polymatrix games: a generalization of minmax
• Strictly competitive games with infinitely many strategies

This page was built for publication: A Note on Strictly Competitive Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651214)