Strictly competitive games are a class of 2-player games often quoted in the literature to be a proper generalization of zero-sum games. Other times it is claimed, e.g. by Aumann, that strictly competitive games are only payoff transformations of zero-sum games. But to the best of our knowledge there is no proof of such claim. We shed light to this point of confusion in the literature, showing that any strictly competitive game is indeed a payoff transformation of a zero sum-game; in fact, an affine transformation. We offer two proofs of this fact, one combinatorial and one algebraic. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Adler, I., Daskalakis, C., & Papadimitriou, C. H. (2009). A note on strictly competitive games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5929 LNCS, pp. 471–474). https://doi.org/10.1007/978-3-642-10841-9_44
Mendeley helps you to discover research relevant for your work.