Multisided matching games with complementarities

International Journal of Game Theory

Volumn 28, Issue 4, 1999, Pages 489-509

  Sherstyuk, Katerina ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Matching games; Supermodular functions

Indexed keywords

EID: 0039446518     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001820050121     Document Type: Article

References (22)

1. Alkan A (1986) Nonexistence of stable threesome matchings. Mathematical Social Sciences 16:207-209
2. Bondareva ON (1963) Some applications of linear programming methods to the theory of cooperative games. Problemy Kibernetiki 10:119-139 (in Russian)
3. Ichiishi T (1981) Super-modularity: applications to convex games and to the greedy algorithm for LP. Journal of Economic Theory 25:283-286
4. Kannai Y (1992) The core and balancedness. In: Aumann R, Hart S (eds) Handbook of game theory with economic applications V.1, North Holland
5. Kara T, Sonmez T (1996) Nash implementation of matching rules. Journal of Economic Theory 68:425-439
6. Lin JY (1992) The Becker-Brock efficient matching theorem with a super-modular technology defined on an n-lattice. Mathematical Social Sciences 24:105-109
7. Ma J (1995) Stable matchings and rematching-proof equilibria in a two-sided matching market. Journal of Economic Theory 66:352-369
8. Milgrom P, Roberts J (1990) Rationalizability, learning, and equilibrium in games with strategic complementarities. Econometrica 58:1255-1277
9. Owen G (1995) Game theory. Academic Press
10. Quint T (1991a) Characterization of cores of assignment games. International Journal of Game Theory 19:413-420
11. Quint T (1991b) The cores of an m-sided assignment game. Games and Economic Behavior 3:487-503
12. Roth A, Sotomayor M (1990) Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press
13. Shapley L (1967) On balanced sets and cores. Naval Research Logistics Quarterly 14:453-460
14. Shapley L (1971) Cores of convex games. International Journal of Game Theory 1:11-26
15. Shapley L, Shubik M (1972) The assignment game I: the core. International Journal of Game Theory 1:111-130
16. Sherstyuk K (1996) Multisided matching games. The University of Melbourne Department of Economics research paper 544
17. Sherstyuk K (1998) Efficiency in partnership structures. Journal of Economic Behavior and Organization 36:329-344
18. Sonmez T (1996) Implementation in generalized matching problems. Journal of Mathematical Economics 26:429-439
19. Topkis D (1978) Minimizing a submodular function on a lattice. Operations Research 26:305-321
20. Topkis D (1979) Equilibrium points in nonzero-sum n-person submodular games. Siam Journal of Control and Optimization 17:773-787
21. Wooders MH (1983) The epsilon core of a large replica game. Journal of Mathematical Economics 11:277-300
22. Zou L (1990) On a conjecture by Gale about one-sided matching problems. Journal of Economic Theory 52:123-135