On the Structure of Cooperative and Competitive Solutions for a Generalized Assignment Game
We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)'s assignment game. We consider the Core, three other notions of group stability and two al- ternative definitions of competitive equilibrium. We show that (i) each group stable set is closely related with the Core of certain games defined using a proper notion of blocking and (ii) each group stable set contains the set of payoff vectors associated to the two definitions of competitive equilibrium. We also show that all six solutions maintain a strictly nested structure. Moreover, each solution can be identified with a set of ma- trices of (discriminated) prices which indicate how gains from trade are distributed among buyers and sellers. In all cases such matrices arise as solutions of a system of linear inequalities. Hence, all six solutions have the same properties from a structural and computational point of view.
|Date of creation:||09 Dec 2013|
|Contact details of provider:|| Postal: 08193, Bellaterra, Barcelona|
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Web page: http://pareto.uab.cat
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Marilda Sotomayor, 1999. "The lattice structure of the set of stable outcomes of the multiple partners assignment game," International Journal of Game Theory, Springer;Game Theory Society, vol. 28(4), pages 567-583.
When requesting a correction, please mention this item's handle: RePEc:aub:autbar:940.13. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Xavier Vila)
If references are entirely missing, you can add them using this form.