Fair assignment of indivisible objects under ordinal preferences (Q899158): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q28111603 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.6546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Popular Random Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Almost stable'' matchings in the roommates problem with bounded preference lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution to the random assignment problem. / 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: Fair division of indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair division of indivisible items between two people with identical preferences: Envy-freeness, Pareto-optimality, and equity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undercut procedure: an algorithm for the envy-free division of indivisible items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3379036 / 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: 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: Equitable distribution of indivisible objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problem Based on Ordinal Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assigning papers to referees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to the random assignment problem on the full preference domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmics of Matching Under Preferences / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Using Choice Lists / rank
 
Normal rank

Latest revision as of 06:16, 11 July 2024

scientific article
Language Label Description Also known as
English
Fair assignment of indivisible objects under ordinal preferences
scientific article

    Statements

    Fair assignment of indivisible objects under ordinal preferences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2015
    0 references
    fair division
    0 references
    resource allocation
    0 references
    envy-freeness
    0 references
    proportionality
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references