Pages that link to "Item:Q5107066"

The following pages link to Almost Envy-Freeness with General Valuations (Q5107066):

Displaying 35 items.

• Co-monotonicity: toward a utility function capturing envy (Q429121) (← links)
• Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
• Computing envy-freeable allocations with limited subsidies (Q2152144) (← links)
• On the existence of EFX allocations (Q2169933) (← links)
• The price of fairness for indivisible goods (Q2230722) (← links)
• Fair division of mixed divisible and indivisible goods (Q2238609) (← links)
• Envy freedom and prior-free mechanism design (Q2253834) (← links)
• No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects (Q2362196) (← links)
• Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← 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)
• Contiguous Cake Cutting: Hardness Results and Approximation Algorithms (Q5130002) (← links)
• A Little Charity Guarantees Almost Envy-Freeness (Q5146956) (← links)
• The Price of Connectivity in Fair Division (Q5864211) (← links)
• Consensus Halving for Sets of Items (Q5870379) (← links)
• Existence of EFX for two additive valuations (Q6094718) (← links)
• Repeatedly matching items to agents fairly and efficiently (Q6118303) (← links)
• Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
• Fairly taking turns (Q6148409) (← links)
• Approximately EFX allocations for indivisible chores (Q6152663) (← links)
• Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem (Q6152666) (← links)
• Computing fair and efficient allocations with few utility values (Q6159026) (← links)
• The existence and efficiency of PMMS allocations (Q6201323) (← links)
• EFX allocations exist for binary valuations (Q6535821) (← links)
• EFX allocations for indivisible chores: matching-based approach (Q6546298) (← links)
• The frontier of intractability for EFX with two agents (Q6546301) (← links)
• Envy-free relaxations for goods, chores, and mixed items (Q6548959) (← links)
• Almost proportional allocations of indivisible chores: computation, approximation and efficiency (Q6566645) (← links)
• Weighted fair division of indivisible items: a review (Q6602330) (← links)
• EFX allocation to chores over small graph (Q6606239) (← links)
• Dividing good and great items among agents with bivalued submodular valuations (Q6609141) (← links)
• One quarter each (on average) ensures proportionality (Q6609175) (← links)
• EFX allocations for indivisible chores: matching-based approach (Q6658304) (← links)