When is the probabilistic serial assignment uniquely efficient and envy-free? (Q504391): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710362833254
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jmateco.2016.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2488255178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment: redefining the serial rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic assignment of objects: characterizing the serial rule / 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: A simple random assignment problem with a unique solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentive properties for ordinal mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of efficiency notions for ordinal assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-peaked orders on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two axiomatic approaches to the probabilistic serial mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended serial correspondence on a rich preference domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic assignment of indivisible goods with single-peaked preferences / 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: Why do popular mechanisms lack efficiency in random environments? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment of multiple indivisible objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentives in the probabilistic serial mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on object allocation under lexicographic preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5275395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random assignment under weak preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic serial mechanism with private endowments / rank
 
Normal rank

Latest revision as of 07:02, 13 July 2024

scientific article
Language Label Description Also known as
English
When is the probabilistic serial assignment uniquely efficient and envy-free?
scientific article

    Statements

    When is the probabilistic serial assignment uniquely efficient and envy-free? (English)
    0 references
    0 references
    16 January 2017
    0 references
    probabilistic serial assignment
    0 references
    sd-efficiency
    0 references
    sd-no-envy
    0 references
    top-objects divisibility
    0 references
    preference richness
    0 references
    recursive decomposability
    0 references
    0 references

    Identifiers