Maximizing Nash product social welfare in allocating indivisible goods
From MaRDI portal
Publication:320030
DOI10.1016/J.EJOR.2015.05.071zbMATH Open1346.91109OpenAlexW3124844168MaRDI QIDQ320030FDOQ320030
Authors: 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
Recommendations
- A characterization of maximum Nash welfare for indivisible goods
- Improving Nash social welfare approximations of indivisible goods
- Approximating the Nash social welfare with indivisible items
- Approximating the Nash Social Welfare with Indivisible Items
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- Optimal allocation of an indivisible good
- Computing welfare-maximizing fair allocations of indivisible goods
- Nash Implementation of Competitive Equilibria in a Model with Indivisible Goods
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Voting theory (91B12)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Handbook of social choice and welfare. Vol. 1.
- Hard tiling problems with simple tiles
- The Santa Claus problem
- Fair division of indivisible items
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- The complexity of contract negotiation
- Title not available (Why is that?)
Cited In (26)
- Approximating the Nash Social Welfare with Indivisible Items
- The magic of Nash social welfare in optimization: do not sum, just multiply!
- Fair assignment of indivisible objects under ordinal preferences
- A social choice approach to ordinal group activity selection
- Welfarism and rationalizability in allocation problems with indivisibilities
- Computing fair and efficient allocations with few utility values
- Stability and welfare in (dichotomous) hedonic diversity games
- Approximating Nash social welfare under binary XOS and binary subadditive valuations
- Fair division with two-sided preferences
- Computing welfare-maximizing fair allocations of indivisible goods
- APX-hardness of maximizing Nash social welfare with indivisible items
- EFX allocations for indivisible chores: matching-based approach
- Portioning using ordinal preferences: fairness and efficiency
- On maximum weighted Nash welfare for binary valuations
- Optimizing social welfare in social networks
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
- Allocating indivisible items with minimum dissatisfaction on preference graphs
- Hedonic diversity games revisited
- Extending the characterization of maximum Nash welfare
- A correspondence between voting procedures and stochastic orderings
- Computing fair and efficient allocations with few utility values
- Allocation of indivisible items with individual preference graphs
- Complexity and approximability of egalitarian Nash product social welfare optimization in multiagent resource allocation
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
- The price of equity with binary valuations and few agent types
- The price to pay for forgoing normalization in fair division of indivisible goods
This page was built for publication: Maximizing Nash product social welfare in allocating indivisible goods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320030)
