scientific article; zbMATH DE number 6850473
From MaRDI portal
Publication:4608059
Recommendations
- scientific article; zbMATH DE number 2088164
- On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
- On finding an envy-free Pareto-optimal division
- Envy-free division via configuration spaces
- An algorithm for envy-free allocations in an economy with indivisible objects and money
- On the number of almost envy-free allocations
- Fair division under ordinal preferences: computing envy-free allocations of indivisible goods
- An improved envy-free cake cutting protocol for four agents
- Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
- Almost envy-freeness in group resource allocation
Cited in
(12)- A three-player envy-free discrete division protocol for mixed manna
- Dividing connected chores fairly
- Dividing connected chores fairly
- Three persons, two cuts: a new cake-cutting algorithm
- Fair division of indivisible goods: recent progress and open questions
- EFX allocations for indivisible chores: matching-based approach
- Elementary solution to the fair division problem
- EFX allocations for indivisible chores: matching-based approach
- On the price of fairness of allocating contiguous blocks
- Restricted existence and approximation algorithms for PMMS
- Fair division of chores with budget constraints
- Truthful fair division without free disposal
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608059)
