Random scheduling with deadlines under dichotomous preferences (Q898667): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
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.2015.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1150962216 / 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: Random Matching Under Dichotomous Preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in the probabilistic assignment model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Opting Out: Improving upon Random Priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank

Latest revision as of 06:00, 11 July 2024

scientific article
Language Label Description Also known as
English
Random scheduling with deadlines under dichotomous preferences
scientific article

    Statements

    Random scheduling with deadlines under dichotomous preferences (English)
    0 references
    18 December 2015
    0 references
    0 references
    random assignment
    0 references
    scheduling with deadlines
    0 references
    probabilistic consistency
    0 references
    efficient uniform rule
    0 references
    0 references