Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Springer Science and Business Media LLC - Trang 1-9 - 2022
Tóm tắt
We prove a new property of dual hypergraphs and derive from it Nash-solvability of the corresponding (tight) game forms. This result is known since 1975, but its new proof is much simpler.
Tài liệu tham khảo
Abdou, J.: Tight and effectively rectangular game forms: A Nash solvable class. Games Econ. Behav. 23(1), 1–11 (1998)
Abdou, J.: Rectangularity and tightness: A normal form characterization of perfect information extensive game forms. Math. Oper. Res. 23(3), 553–567 (1998)
Abdou, J., Keiding, H.: Effectivity Functions in Social Choice. Springer, New York (1991)
Berge, C.: Hypergraphs, Combinatorics of finite sets. North-Holland Mathematical Library, vol. 45, pp. 1–255 (1989)
Boros, E., Cepek, O., Gurvich, V., Makino, K.: Recognizing distributed approval voting forms and correspondences. arXiv:2010.15730 (2020)
Boros, E., Gurvich, V., Milanic, M., Oudalov, V., Vicic, J.: A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243, 21–38 (2018)
Crama, Y., Hammer, P.L.: Boolean Functions: Theory, Algorithms, and Applications. Cambridge University Press, Cambridge (2011)
Danilov, V.I.: Private communications (1988)
Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. J. Comb. Theory 8, 299–306 (1970)
Ekel, E., Fudenberg, D., Levine, D.: Payoff information and self-confirming equilibrium. J. Econ. Theory 89(2), 165–185 (1999)
Fredman, M., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618–628 (1996)
Gurvich, V.: On theory of multi-step games. USSR Comput. Math. Math. Phys. 13(6), 143–161 (1973)
Gurvich, V.: Solution of positional games in pure strategies. USSR Comput. Math. Math. Phys. 15(2), 74–87 (1975)
Gurvich, V.: Equilibrium in pure strategies. Soviet Math. Dokl. 38(3), 597–602 (1989)
Gurvich, V., Khachiyan, L.: On Generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discret. Appl. Math. 96–97, 363–373 (1999)
Gurvich, V., Naumova, M.: Polynomial algorithms computing two lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles. In: ArXiv e-prints arXiv:2108.05469 (2021)
Kolpin, V.W.: A note on tight extensive game forms. Int. J. Game Theory 17, 187–191 (1988)
Mojzisch, A., Schulz-Hardt, S.: Knowing others’ preferences degrades the quality of group decisions. J. Pers. Soc. Psychol. 98(5), 794–808 (2010)
Moulin, H.: The Strategy of Social Choice. North-Holland Publishing Company (1983)
Nash, J.: Equilibrium points in n-person games. Proc. Nat. Acad. Sci. 36(1), 48–49 (1950)
Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286–295 (1951)
Peleg, B.: Game Theoretic Analysis of Voting in Committees. Cambridge University Press, Cambridge (1984)
Roth, A.E.: Two-sided matching with incomplete information about others’ preferences. Games Econ. Behav. 1(2), 191–209 (1989)
Schipper, B.C.: Discovery and equilibrium in games with unawareness. J. Econ. Theory 198(1–44), 105365 (2021)