Pages that link to "Item:Q5133015"

The following pages link to Fair Allocation of Indivisible Goods (Q5133015):

Displaying 40 items.

• Distributed fair allocation of indivisible goods (Q343902) (← links)
• Two-player fair division of indivisible items: comparison of algorithms (Q724147) (← links)
• Computational aspects of assigning agents to a line (Q1680103) (← links)
• Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
• Local fairness in hedonic games via individual threshold coalitions (Q2034790) (← links)
• On the complexity of fair house allocation (Q2060606) (← links)
• Picking sequences and monotonicity in weighted fair division (Q2060703) (← links)
• Two's company, three's a crowd: consensus-halving for a constant number of agents (Q2093385) (← links)
• Two-person fair division of indivisible items when envy-freeness is impossible (Q2120143) (← links)
• Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach (Q2122769) (← links)
• Envy-free allocations respecting social networks (Q2124438) (← links)
• Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness (Q2152111) (← links)
• Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
• The price to pay for forgoing normalization in fair division of indivisible goods (Q2202518) (← links)
• The envy-free matching problem with pairwise preferences (Q2234784) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
• Minimal envy and popular matchings (Q2242327) (← links)
• Democratic fair allocation of indivisible goods (Q2289012) (← links)
• Optimizing social welfare in social networks (Q2290372) (← links)
• Agreeable sets with matroidal constraints (Q2424653) (← links)
• Maximum Nash welfare and other stories about EFX (Q2658044) (← links)
• Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
• Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
• A characterization of maximum Nash welfare for indivisible goods (Q2681826) (← links)
• On fairness via picking sequences in allocation of indivisible goods (Q2695445) (← links)
• Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
• Competitive Equilibrium with Indivisible Goods and Generic Budgets (Q4991681) (← links)
• (Q5018506) (← links)
• Fair Packing of Independent Sets (Q5041187) (← links)
• Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
• Fair Division (Q5150295) (← links)
• Obtaining a proportional allocation by deleting items (Q5925523) (← links)
• Computing welfare-maximizing fair allocations of indivisible goods (Q6109821) (← links)
• Fair division of goods in the shadow of market values (Q6109822) (← links)
• Approximate and strategyproof maximin share allocation of chores with ordinal preferences (Q6120928) (← links)
• Computational complexity of necessary envy-freeness (Q6125946) (← links)
• Fair division of indivisible goods: recent progress and open questions (Q6136107) (← links)
• Allocation of indivisible items with individual preference graphs (Q6157417) (← links)
• Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention (Q6496422) (← links)