Ranking games

Abbott, 2005, On the complexity of two-player win-lose games, 113 Ashlagi, 2005, On the value of correlation, 34 Aumann, 1959, Acceptable points in general n-person games, vol. 40, 287 Aumann, 1961, Almost strictly competitive games, Journal of the Society of Industrial and Applied Mathematics, 9, 544, 10.1137/0109046 Aumann, 1974, Subjectivity and correlation in randomized strategies, Journal of Mathematical Economics, 1, 67, 10.1016/0304-4068(74)90037-8 Aumann, 1985, On the non-transferable utility value: A comment on the Roth–Shafer examples, Econometrica, 53, 667, 10.2307/1911661 Aumann, 1987, Game theory, vol. 2, 460 F. Brandt, T. Sandholm, Y. Shoham, Spiteful bidding in sealed-bid auctions, in: M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), 2007, pp. 1207–1214 Chen, 2006, Settling the complexity of 2-player Nash-equilibrium, 261 Conitzer, 2005, Complexity of (iterated) dominance, 88 Cubitt, 1994, Rationally justifiable play and the theory of non-cooperative games, Economic Journal, 104, 798, 10.2307/2234975 Daskalakis, 2006, The complexity of computing a Nash equilibrium, 71 Gottlob, 2005, Pure Nash equilibria: Hard and easy games, Journal of Artificial Intelligence Research, 24, 195, 10.1613/jair.1683 Harsanyi, 1973, Oddness of the number of equilibrium points: A new proof, International Journal of Game Theory, 2, 235, 10.1007/BF01737572 Kats, 1992, Unilaterally competitive games, International Journal of Game Theory, 21, 291, 10.1007/BF01258280 Khachiyan, 1979, A polynomial algorithm in linear programming, Soviet Mathematics Doklady, 20, 191 Koutsoupias, 1999, Worst-case equilibria, vol. 1563, 404 Luce, 1957 Luckhardt, 1986, An algorithmic solution of n-person games, 158 1990 Marx, 1997, Order independence for iterated weak dominance, Games and Economic Behavior, 18, 219, 10.1006/game.1997.0525 Morgan, 2003, The spite motive and equilibrium behavior in auctions, Contributions to Economic Analysis & Policy, 2, 1102 Moulin, 1978, Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon, International Journal of Game Theory, 7, 201, 10.1007/BF01769190 Myerson, 1991 Nash, 1951, Non-cooperative games, Annals of Mathematics, 54, 286, 10.2307/1969529 Norde, 1999, Bimatrix games have quasi-strict equilibria, Mathematical Programming, 85, 35, 10.1007/s101070050045 Papadimitriou, 1994 Papadimitriou, 2005, Computing correlated equilibria in multi-player games, 49 Papadimitriou, 2007, The complexity of finding Nash equilibria, 29 Raghavan, 2002, Non-zero-sum two-person games, vol. III, 1687 Roughgarden, 2005 Russell, 2003 Sandholm, 1999, Coalition structure generation with worst case guarantees, Artificial Intelligence, 111, 209, 10.1016/S0004-3702(99)00036-3 Schoenebeck, 2006, The computational complexity of Nash equilibria in concisely represented games, 270 Sturtevant, 2004, Current challenges in multi-player game search, vol. 3846, 285 Tennenholtz, 2002, Competitive safety analysis: Robust decision-making in multi-agent systems, Journal of Artificial Intelligence Research, 17, 363, 10.1613/jair.1065 Vajda, 1956 van Damme, 1983 van Damme, 1998, On the state of the art in game theory: An interview with Robert Aumann, Games and Economic Behavior, 24, 181, 10.1006/game.1997.0612 von Neumann, 1928, Zur Theorie der Gesellschaftspiele, Mathematische Annalen, 100, 295, 10.1007/BF01448847 von Neumann, 1947 O.D. Wolf, Optimal strategies in n-person unilaterally competitive games, Discussion Paper 9949, Center for Operations Research and Econometrics, Université catholique de Louvain, 1999