Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking opportunity sets: An axiomatic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Low-Envy Truthful Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficiency of fair division / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3379036 / 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: The Nash Social Welfare Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bargaining Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Decrease the Degree of Envy in Allocations of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity theory and cryptology. An introduction to cryptocomplexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank

Revision as of 09:03, 9 July 2024

scientific article
Language Label Description Also known as
English
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
scientific article

    Statements

    Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (English)
    0 references
    0 references
    0 references
    3 December 2014
    0 references
    resource allocation
    0 references
    economically motivated agents
    0 references
    approximability
    0 references

    Identifiers