Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness

DOI10.1007/978-3-030-94676-0_9MaRDI QIDQ2152111zbMATH OpenOpenAlexFDO

Authors Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Rebecca Reiffenhäuser, Stefano Leonardi

Publication date 6 July 2022

Full work available at URL https://arxiv.org/abs/2109.08644

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Recommendations

• Almost envy-freeness with general valuations
• Maximum Nash welfare and other stories about EFX
• Nash social welfare approximation for strategic agents
• Almost envy-freeness with general valuations

Cites work

• scientific article; zbMATH DE number 3136641 (Why is no real title available?)
• A Class of Sequential Games
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Almost envy-freeness with general valuations
• An improved approximation algorithm for maximin shares
• Approximation Algorithms for Computing Maximin Share Allocations
• Cake cutting algorithms
• Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems
• Equilibria in sequential allocation
• Fair Allocation of Indivisible Goods
• Fair allocation of indivisible goods: improvement
• Fair enough: guaranteeing approximate maximin shares
• Manipulating picking sequences
• Nash social welfare approximation for strategic agents
• Near fairness in matroids
• On Low-Envy Truthful Allocations
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• Sur la division pragmatique
• Truth, justice, and cake cutting

Cited in

(7)

• Approximating the Nash Social Welfare with Indivisible Items
• Strategy-proof and nonbossy allocation of indivisible goods and money
• Maximizing Nash product social welfare in allocating indivisible goods
• Distributive justice and the Nash bargaining solution
• Fair division of indivisible goods: recent progress and open questions
• FAIR ALLOCATION BASED ON TWO CRITERIA : A DEA GAME VIEW OF "ADD THEM UP AND DIVIDE BY TWO"(<Special Issue>Operations Research for Performance Evaluation)
• Fair Allocation of Indivisible Goods to Asymmetric Agents

This page was built for publication: Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness

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