Pages that link to "Item:Q4611397"
From MaRDI portal
The following pages link to Fair Allocation of Indivisible Goods to Asymmetric Agents (Q4611397):
Displaying 24 items.
- Asymptotic existence of proportionally fair allocations (Q277310) (← links)
- Approximate maximin shares for groups of agents (Q1748541) (← links)
- Picking sequences and monotonicity in weighted fair division (Q2060703) (← links)
- Mind the gap: cake cutting with separation (Q2093384) (← links)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- The fair division of hereditary set systems (Q2190407) (← links)
- The price of fairness for indivisible goods (Q2230722) (← links)
- An improved approximation algorithm for maximin shares (Q2238718) (← links)
- Maximin share guarantee for goods with positive externalities (Q2244422) (← links)
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522) (← links)
- On maximum weighted Nash welfare for binary valuations (Q2673693) (← links)
- FAIR ALLOCATION BASED ON TWO CRITERIA : A DEA GAME VIEW OF "ADD THEM UP AND DIVIDE BY TWO"(<Special Issue>Operations Research for Performance Evaluation) (Q3397569) (← links)
- A Little Charity Guarantees Almost Envy-Freeness (Q4957912) (← links)
- Closing Gaps in Asymptotic Fair Division (Q4986806) (← links)
- Fairly Allocating Many Goods with Few Queries (Q4986810) (← links)
- Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
- Fair Allocation of Indivisible Goods (Q5133015) (← links)
- Fairness in temporal slot assignment (Q6109542) (← links)
- Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
- Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness (Q6204157) (← links)
- Almost proportional allocations of indivisible chores: computation, approximation and efficiency (Q6566645) (← links)
- Weighted fair division of indivisible items: a review (Q6602330) (← links)
- Fair division with two-sided preferences (Q6634122) (← links)
- Communication complexity of discrete fair division (Q6663092) (← links)
