Abstract
A characterization of the extreme core allocations of the assignment game is given in terms of the reduced marginal worth vectors. For each ordering in the player set, a payoff vector is defined where each player receives his or her marginal contribution to a certain reduced game played by his or her predecessors. This set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is proved to be the set of extreme points of the core of the assignment game. Therefore, although assignment games are hardly ever convex, the same characterization of extreme core allocations is valid for convex games.
Sign-in/Register to access full text options 
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.
