A note on strictly competitive games
5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Book chapter |
| Language: | en_US |
| Published: |
Spring Berlin/Heidelberg
2012
|
| Online Access: | http://hdl.handle.net/1721.1/71831 https://orcid.org/0000-0002-5451-0490 |
| _version_ | 1826206779302739968 |
|---|---|
| author | Adler, Ilan Daskalakis, Constantinos Papadimitriou, Christos H. |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Adler, Ilan Daskalakis, Constantinos Papadimitriou, Christos H. |
| author_sort | Adler, Ilan |
| collection | MIT |
| description | 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings |
| first_indexed | 2024-09-23T13:38:16Z |
| format | Book chapter |
| id | mit-1721.1/71831 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:38:16Z |
| publishDate | 2012 |
| publisher | Spring Berlin/Heidelberg |
| record_format | dspace |
| spelling | mit-1721.1/718312022-09-28T15:12:54Z A note on strictly competitive games Adler, Ilan Daskalakis, Constantinos Papadimitriou, Christos H. Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Daskalakis, Constantinos Daskalakis, Constantinos 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings 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. 2012-07-26T13:47:07Z 2012-07-26T13:47:07Z 2009-12 Book chapter http://purl.org/eprint/type/BookItem 978-3-642-10840-2 0302-9743 1611-3349 http://hdl.handle.net/1721.1/71831 Adler, Ilan, Constantinos Daskalakis, and Christos H. Papadimitriou. “A Note on Strictly Competitive Games.” Internet and Network Economics. Ed. Stefano Leonardi. Vol. 5929. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. 471-474. https://orcid.org/0000-0002-5451-0490 en_US http://dx.doi.org/10.1007/978-3-642-10841-9_44 Internet and Network Economics Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Spring Berlin/Heidelberg MIT web domain |
| spellingShingle | Adler, Ilan Daskalakis, Constantinos Papadimitriou, Christos H. A note on strictly competitive games |
| title | A note on strictly competitive games |
| title_full | A note on strictly competitive games |
| title_fullStr | A note on strictly competitive games |
| title_full_unstemmed | A note on strictly competitive games |
| title_short | A note on strictly competitive games |
| title_sort | note on strictly competitive games |
| url | http://hdl.handle.net/1721.1/71831 https://orcid.org/0000-0002-5451-0490 |
| work_keys_str_mv | AT adlerilan anoteonstrictlycompetitivegames AT daskalakisconstantinos anoteonstrictlycompetitivegames AT papadimitriouchristosh anoteonstrictlycompetitivegames AT adlerilan noteonstrictlycompetitivegames AT daskalakisconstantinos noteonstrictlycompetitivegames AT papadimitriouchristosh noteonstrictlycompetitivegames |