scientific article; zbMATH DE number 6902543

DOI10.3233/978-1-61499-672-9-787MaRDI QIDQ4576211zbMATH OpenFDO

Authors Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia

Publication date 12 July 2018

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

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)

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

Cited in

(11)

• Possible and necessary allocations under serial dictatorship with incomplete preference lists
• Efficient sequential assignment with incomplete information
• Welfarism and rationalizability in allocation problems with indivisibilities
• Optimizing over serial dictatorships
• Equilibria in sequential allocation
• Bruhat orders and the sequential selection of indivisible items
• Parameterized complexity of manipulating sequential allocation
• Approximate and strategyproof maximin share allocation of chores with ordinal preferences
• Optimizing over serial dictatorships
• Duplication monotonicity in the allocation of indivisible goods
• Manipulating picking sequences

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)