Fair Allocation of Indivisible Goods
From MaRDI portal
Publication:5133015
Recommendations
- Fair division of mixed divisible and indivisible goods
- Equitable allocation of divisible goods
- Distributed fair allocation of indivisible goods
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Fair allocation of indivisible goods: improvement
- Fair Allocation of Indivisible Goods and Criteria of Justice
- Democratic fair allocation of indivisible goods
- Fair division of indivisible items among people with similar preferences
- Fair division of indivisible items
- Fair Allocation of Indivisible Goods to Asymmetric Agents
Cited in
(60)- Reallocation of an infinitely divisible good
- Computational aspects of assigning agents to a line
- Strategy-proofness of scoring allocation correspondences for indivisible goods
- Local fairness in hedonic games via individual threshold coalitions
- On the complexity of fair house allocation
- Picking sequences and monotonicity in weighted fair division
- Two's company, three's a crowd: consensus-halving for a constant number of agents
- Two-person fair division of indivisible items when envy-freeness is impossible
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- Envy-free allocations respecting social networks
- Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness
- Almost envy-freeness for groups: improved bounds via discrepancy theory
- The price to pay for forgoing normalization in fair division of indivisible goods
- The envy-free matching problem with pairwise preferences
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Fair allocation of indivisible goods with minimum inequality or minimum envy
- Minimal envy and popular matchings
- How to obtain an equitable optimal fair division
- Democratic fair allocation of indivisible goods
- Optimizing social welfare in social networks
- Dividing splittable goods evenly and with limited fragmentation
- Agreeable sets with matroidal constraints
- A general equivalence theorem for allocation of indivisible objects
- How to allocate hard candies fairly
- Maximum Nash welfare and other stories about EFX
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Parameterized complexity of envy-free resource allocation in social networks
- A characterization of maximum Nash welfare for indivisible goods
- On fairness via picking sequences in allocation of indivisible goods
- Fair allocation of indivisible items with conflict graphs
- Distributed fair allocation of indivisible goods
- Fair division of indivisible goods under risk
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Fair division of indivisible items between two players: design parameters for contested pile methods
- Competitive equilibrium with indivisible goods and generic budgets
- Reasoning about social choice and games in monadic fixed-point logic
- Fair Packing of Independent Sets
- Ordinal Maximin Share Approximation for Goods
- Efficient Fair Division with Minimal Sharing
- Dividing splittable goods evenly and with limited fragmentation
- Fair Division
- Obtaining a proportional allocation by deleting items
- Fair ride allocation on a line
- Online max-min fair allocation
- Computing welfare-maximizing fair allocations of indivisible goods
- Fair division of goods in the shadow of market values
- Approximate and strategyproof maximin share allocation of chores with ordinal preferences
- Computational complexity of necessary envy-freeness
- Fair division of indivisible goods: recent progress and open questions
- Allocation of indivisible items with individual preference graphs
- Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention
- Weighted fair division of indivisible items: a review
- Differentially private fair division
- Worst-case fair guarantees when spending a common budget
- Reforming an envy-free matching
- One-sided markets with externalities
- Two-player fair division of indivisible items: comparison of algorithms
- Approximating proportional and maximin allocations on d-claw-free graphs
- Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
- Brams-Taylor model of fair division for divisible and indivisible items
This page was built for publication: Fair Allocation of Indivisible Goods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133015)
