Pages that link to "Item:Q477331"
From MaRDI portal
The following pages link to Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331):
Displaying 18 items.
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
- Distributed fair allocation of indivisible goods (Q343902) (← links)
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
- The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
- Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
- A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation (Q2436693) (← links)
- Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities (Q2453404) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- A characterization of maximum Nash welfare for indivisible goods (Q2681826) (← links)
- Generalized binary utility functions and fair allocations (Q2682030) (← links)
- Extending the characterization of maximum Nash welfare (Q2695786) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Nash Social Welfare, Matrix Permanent, and Stable Polynomials (Q4638089) (← links)
- Improving Nash Social Welfare Approximations (Q5114782) (← links)
- Fair in the Eyes of Others (Q5870502) (← links)
- (Q5874477) (← links)
- Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings (Q6075859) (← links)
