Computing fair and efficient allocations with few utility values (Q2670939): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum Nash welfare and other stories about EFX / 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: Random Matching Under Dichotomous Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (1,<i>∊</i>)-Restricted Assignment Makespan Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fair division for indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Nash Social Welfare with Indivisible Items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nash product social welfare in allocating indivisible goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282999 / 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 / cites work
 
Property / cites work: APX-hardness of maximizing Nash social welfare with indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Nash Social Welfare Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la division pragmatique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank

Latest revision as of 04:33, 29 July 2024

scientific article
Language Label Description Also known as
English
Computing fair and efficient allocations with few utility values
scientific article

    Statements

    Computing fair and efficient allocations with few utility values (English)
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    fair and efficient allocation
    0 references
    EFX
    0 references
    Nash welfare
    0 references
    EQX
    0 references

    Identifiers