Near fairness in matroids

MaRDI QIDQ5282999zbMATH OpenFDO

Authors Laurent Gourvès, Jérôme Monnot, Lydia Tlilane

Publication date 18 July 2017

Full work available at URL http://ebooks.iospress.nl/volumearticle/36972

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• On maximin share allocations in matroids
• Approximate maximin share allocations in matroids
• Finding fair and efficient allocations when valuations don't add up
• A protocol for cutting matroids like cakes
• Worst case compromises in matroids with applications to the allocation of indivisible goods

Cited in

(17)

• Fairly taking turns
• Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
• On maximin share allocations in matroids
• Fair in the Eyes of Others
• A protocol for cutting matroids like cakes
• Computing fair and efficient allocations with few utility values
• Local fairness in hedonic games via individual threshold coalitions
• On Fair Division under Heterogeneous Matroid Constraints
• EFX allocations for indivisible chores: matching-based approach
• Fair division of indivisible goods: recent progress and open questions
• Maximum Nash welfare and other stories about EFX
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
• Computing fair and efficient allocations with few utility values
• EFX allocations for indivisible chores: matching-based approach
• The frontier of intractability for EFX with two agents
• The price of equity with binary valuations and few agent types
• Envy-free relaxations for goods, chores, and mixed items

This page was built for publication: Near fairness in matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282999)