The classic paper of Shapley and Shubik Shapley1971assignment characterized the core of the assignment game using ideas from matching theory and LP-duality theory and their highly non-trivial interplay. Whereas the core of the assignment game is always non-empty, that of the general graph matching game can be empty. This paper salvages the situation by giving an imputation in the 2/3-approximate core for the latter. This bound is best possible, since it is the integrality gap of the natural underlying LP. Our profit allocation method goes further: the multiplier on the profit of an agent  \over   lies in the interval [{2 \over 3}, 1], depending on how severely constrained the agent is. {\em   The core is a key solution concept in cooperative game theory. It contains all ways of distributing the total worth of a game among agents in such a way that no sub-coalition has incentive to secede from the grand coalition. Our imputation, in the 2/3-approximate core, implies that a sub-coalition will gain at most a 3/2 factor by seceding, and less in typical cases . We also study the phenomenon of degeneracy in assignment games, i.e., when the maximum weight matching is not unique. We provide insights of an elementary nature gained by studying this phenomenon through the lens of complementary slackness .
The classic paper of Shapley and Shubik Shapley1971assignment characterized the core of the assignment game using ideas from matching theory and LP-duality theory and their highly non-trivial interplay. Whereas the core of this game is always non-empty, that of the general graph matching game can be empty. This paper salvages the situation by giving an imputation in the 2/3-approximate core for the latter. This bound is best possible, since it is the integrality gap of the natural underlying LP. Our profit allocation method goes further: the multiplier on the profit of an agent is often better than 2\over 3 and lies in the interval [{2 \over 3}, 1], depending on how severely constrained the agent is. Next, we provide new insights showing how discerning core imputations of an assignment games are by studying them via the lens of complementary slackness. We present a relationship between the competitiveness of individuals and teams of agents and the amount of profit they accrue in imputations that lie in the core, where by{\em competitiveness we mean whether an individual or a team is matched in every/some/no maximum matching. This also sheds light on the phenomenon of degeneracy in assignment games, i.e., when the maximum weight matching is not unique. The core is a quintessential solution concept in cooperative game theory. It contains all ways of distributing the total worth of a game among agents in such a way that no sub-coalition has incentive to secede from the grand coalition. Our imputation, in the 2/3-approximate core, implies that a sub-coalition will gain at most a 3/2 factor by seceding, and less in typical cases .
R
the assignment
this
A
is often better than
A
2
A
3
A
and
A
Next, we provide new insights showing how discerning core imputations of an assignment games are by studying them via the lens of complementary slackness. We present a relationship between the competitiveness of individuals and teams of agents and the amount of profit they accrue in imputations that lie in the core, where by
A
competitiveness
A
we mean whether an individual or a team is matched in every/some/no maximum matching. This also sheds light on the phenomenon of degeneracy in assignment games, i.e., when the maximum weight matching is not unique.
R
key
quintessential
D
. We also study the phenomenon of degeneracy in assignment games, i.e., when the maximum weight matching is not unique. We provide insights of an elementary nature gained by studying this phenomenon through the lens of complementary slackness