scientific article; zbMATH DE number 6902543

DOI10.3233/978-1-61499-672-9-787zbMATH Open1396.91319arXiv1511.08280MaRDI QIDQ4576211FDOQ4576211

Haris Aziz, Toby Walsh, Lirong Xia, Thomas Kalinowski

Publication date: 12 July 2018

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

Title of this publication is not available (Why is that?)

Recommendations

• On fairness via picking sequences in allocation of indivisible goods
• Equilibria in sequential allocation
• Characterizations of strategy-proof and fair mechanisms for allocating indivisible goods
• Strategy-proof allocation of indivisible goods
• Distributed fair allocation of indivisible goods
• Strategy-proof allocation mechanisms for economies with an indivisible good
• Computing welfare-maximizing fair allocations of indivisible goods
• Strategy-proof and efficient allocation of an indivisible good on finitely restricted preference domains
• Characterization and computation of equilibria for indivisible goods

zbMATH Keywords

welfarepolynomial time algorithmsindivisible goodssequential allocation mechanisms

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Welfare economics (91B15)

Cited In (5)

• Possible and necessary allocations under serial dictatorship with incomplete preference lists
• Welfarism and rationalizability in allocation problems with indivisibilities
• Bruhat orders and the sequential selection of indivisible items
• Approximate and strategyproof maximin share allocation of chores with ordinal preferences
• Duplication monotonicity in the allocation of indivisible goods

This page was built for publication:

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