Probabilistic assignment: an extension approach (Q1649093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00355-018-1110-z / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2539856977 / 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: Q5834711 / 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: Risk aversion and risk vulnerability in the continuous and discrete case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797834 / 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: Q5561637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incentive properties for ordinal mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the probabilistic serial assignment uniquely efficient and envy-free? / 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: Manipulation of Schemes that Mix Voting with Chance / 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: Risk Aversion in the Small and in the Large / 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: A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / 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
Property / cites work
 
Property / cites work: On a conjecture by Gale about one-sided matching problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00355-018-1110-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:54, 11 December 2024

scientific article
Language Label Description Also known as
English
Probabilistic assignment: an extension approach
scientific article

    Statements

    Probabilistic assignment: an extension approach (English)
    0 references
    0 references
    5 July 2018
    0 references
    probabilistic assignment
    0 references
    bject allocation
    0 references
    lotteries
    0 references
    lexicographic preferences
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers