The following pages link to The efficiency of fair division (Q692886):
Displaying 30 items.
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Dividing connected chores fairly (Q500994) (← links)
- Fair and efficient cake division with connected pieces (Q776236) (← links)
- Truthful fair division without free disposal (Q826615) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- A fair division approach to humanitarian logistics inspired by conditional value-at-risk (Q1640048) (← links)
- Price of fairness in two-agent single-machine scheduling problems (Q1728475) (← links)
- Price of fairness for allocating a bounded resource (Q1752883) (← links)
- Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
- Allocating contiguous blocks of indivisible chores fairly (Q2051776) (← links)
- The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220) (← links)
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach (Q2122769) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- On social envy-freeness in multi-unit markets (Q2321269) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting (Q2629532) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- On fairness via picking sequences in allocation of indivisible goods (Q2695445) (← links)
- A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
- Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
- The Price of Fairness for a Small Number of Indivisible Items (Q2806954) (← links)
- Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship (Q2959833) (← links)
- A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism (Q4632212) (← links)
- Fairly allocating contiguous blocks of indivisible items (Q5894699) (← links)
- Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach (Q6150225) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)
- The existence and efficiency of PMMS allocations (Q6201323) (← links)
