GMMS doesn't imply APS
Dependencies:
- Fair division
- Additive set function
- AnyPrice share
- Maximin share allocations
- Restricted agents, pairwise fairness, and groupwise fairness
- Leximin implies GMMS for idval
- APS can be > MMS
$\newcommand{\defeq}{:=}$ Consider a fair division instance with 15 goods and 3 agents having equal entitlements and identical additive valuations. The values of the goods are 65, 31, 31, 31, 23, 23, 23, 17, 11, 7, 7, 7, 5, 5, 5. Then a GMMS allocation exists but an APS alloction doesn't exist.
Even for the instance of chores obtained by multiplying every good's value by $-1$, a GMMS allocation exists but an APS alloction doesn't exist.
Proof
For these instances, the leximin allocation is GMMS. However, APS $>$ MMS for both these instances, and the minimum value across all bundles is at most the MMS, so no APS allocation exists.
Dependency for: None
Info:
- Depth: 6
- Number of transitive dependencies: 17
Transitive dependencies:
- /sets-and-relations/countable-set
- /analysis/sup-inf
- σ-algebra
- Set function
- Fair division
- Proportional allocation
- Restricted agents, pairwise fairness, and groupwise fairness
- Maximin share of a set function
- Maximin share allocations
- Additive set function
- Leximin partition of a set function
- Leximin implies GMMS for idval
- Optimization: Dual and Lagrangian
- Dual of a linear program
- Linear programming: strong duality (incomplete)
- AnyPrice share
- APS can be > MMS