A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2020.07.005 / rank | |||
| Property / cites work | |||
| Property / cites work: Efficient reallocation under additive and responsive preferences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fair Allocation of Indivisible Goods to Asymmetric Agents / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2020.07.005 / rank | |||
Normal rank | |||
Latest revision as of 14:29, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation |
scientific article |
Statements
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (English)
0 references
7 April 2021
0 references
fair division
0 references
Pareto optimality
0 references
proportionality
0 references
