A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation (Q2661522): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q228592
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hervé Moulin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3041947696 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1909.00740 / rank
 
Normal 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

Latest revision as of 22:06, 24 July 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
    0 references
    0 references
    0 references
    7 April 2021
    0 references
    fair division
    0 references
    Pareto optimality
    0 references
    proportionality
    0 references

    Identifiers