Maximizing Nash product social welfare in allocating indivisible goods
From MaRDI portal
Publication:320030
DOI10.1016/j.ejor.2015.05.071zbMath1346.91109OpenAlexW3124844168MaRDI QIDQ320030
Andreas Darmann, Joachim Schauer
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.071
Voting theory (91B12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (15)
Approximating the Nash Social Welfare with Indivisible Items ⋮ A social choice approach to ordinal group activity selection ⋮ Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Computing fair and efficient allocations with few utility values ⋮ A correspondence between voting procedures and stochastic orderings ⋮ On maximum weighted Nash welfare for binary valuations ⋮ Portioning using ordinal preferences: fairness and efficiency ⋮ Computing welfare-maximizing fair allocations of indivisible goods ⋮ Fair assignment of indivisible objects under ordinal preferences ⋮ Allocation of indivisible items with individual preference graphs ⋮ Stability and welfare in (dichotomous) hedonic diversity games ⋮ Allocating indivisible items with minimum dissatisfaction on preference graphs ⋮ Hedonic diversity games revisited ⋮ Computing fair and efficient allocations with few utility values
Cites Work
- Unnamed Item
- Unnamed Item
- Fair division of indivisible items
- Handbook of social choice and welfare. Vol. 1.
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- The complexity of contract negotiation
- The Santa Claus problem
- Hard tiling problems with simple tiles
This page was built for publication: Maximizing Nash product social welfare in allocating indivisible goods
