Pages that link to "Item:Q320030"
From MaRDI portal
The following pages link to Maximizing Nash product social welfare in allocating indivisible goods (Q320030):
Displayed 15 items.
- Fair assignment of indivisible objects under ordinal preferences (Q899158) (← links)
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- Approximating Nash social welfare under binary XOS and binary subadditive valuations (Q2152132) (← links)
- A correspondence between voting procedures and stochastic orderings (Q2184056) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- On maximum weighted Nash welfare for binary valuations (Q2673693) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- Allocating indivisible items with minimum dissatisfaction on preference graphs (Q2695444) (← links)
- Hedonic diversity games revisited (Q2695455) (← links)
- Approximating the Nash Social Welfare with Indivisible Items (Q4571931) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)
- Stability and welfare in (dichotomous) hedonic diversity games (Q6185603) (← links)
