Abstract
We consider the assignment game of Shapley and Shubik (1972). We prove that the class of possible cores of such games (expressed in terms of payoffs for players on one side of the market) is exactly the same as a special class of polytopes, called “45‡-lattices”. These results parallel similar work done by Conway (in Knuth, 1976) and Blair (1984) for marriage markets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
