Fair division with allocator's preference
From MaRDI portal
Cites work
- A combinatorical proof of Kneser's conjecture
- A New Short Proof of Kneser's Conjecture
- A note on cake cutting
- A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation
- A short proof of Kneser's conjecture
- Almost envy-free repeated matching in two-sided markets
- Almost envy-freeness for groups: improved bounds via discrepancy theory
- Almost envy-freeness in group resource allocation
- An Envy-Free Cake Division Protocol
- Approximate maximin shares for groups of agents
- Asymptotic existence of fair divisions for groups
- Computing welfare-maximizing fair allocations of indivisible goods
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Degeneracy in interior point methods for linear programming: A survey
- Democratic fair allocation of indivisible goods
- Fair cake-cutting among families
- Fair division of indivisible goods: recent progress and open questions
- scientific article; zbMATH DE number 1234106 (Why is no real title available?)
- Improving Nash social welfare approximations of indivisible goods
- Integral boundary points of convex polyhedra
- Kneser's conjecture, chromatic number, and homotopy
- On the chromatic number of generalized Kneser graphs and Hadamard matrices
- Sur la division pragmatique
This page was built for publication: Fair division with allocator's preference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609128)
