On Fair Division under Heterogeneous Matroid Constraints
From MaRDI portal
Publication:6135949
DOI10.1613/jair.1.13779arXiv2010.07280MaRDI QIDQ6135949
Erel Segal-Halevi, Michal Feldman, Unnamed Author
Publication date: 28 August 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.07280
Related Items (2)
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Diverse fair allocations: complexity and algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Earning limits in Fisher markets with spending-constraint utilities
- Pairwise kidney exchange
- On maximin share allocations in matroids
- Assigning papers to referees
- Finding fair and efficient allocations when valuations don't add up
- The fair division of hereditary set systems
- Fair division with multiple pieces
- Almost envy-freeness in group resource allocation
- Priority matchings revisited
- Combinatorial auctions with decreasing marginal utilities
- A Protocol for Cutting Matroids Like Cakes
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- The computational complexity of matroid properties
- A weighted matroid intersection algorithm
- Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
- Splitting Necklaces, with Constraints
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Comments on bases in dependence structures
- Exchange systems, matchings, and transversals
- Minimum partition of a matroid into independent subsets
- Induced Matroids
- A THEOREM ON INDEPENDENCE RELATIONS
- The Price of Connectivity in Fair Division
- Fairly allocating contiguous blocks of indivisible items
This page was built for publication: On Fair Division under Heterogeneous Matroid Constraints
