Random scheduling with deadlines under dichotomous preferences》.pdf

Journal of Mathematical Economics 61 (2015) 96–103 Contents lists available at ScienceDirect Journal of Mathematical Economics journal homepage: /locate/jmateco Random scheduling with deadlines under dichotomous preferences İbrahim Barış Esmerok Rice University, Department of Economics, MS#22, 6100 S. Main Street, Houston, TX 77005-1892, United States a r t i c l e i n f o a b s t r a c t Article history: A group of individuals share a deterministic server which is capable of serving one job per unit of time. Received 9 November 2014 Every individual has a job and a cut off time slot (deadline) where service beyond this slot is as worthless Received in revised form as not getting any service at all. Individuals are indifferent between slots which are not beyond their 28 April 2015 deadlines (compatible slots). A schedule (possibly random) assigns the set of slots to individuals by Accepted 6 August 2015 respecting their deadlines. We only consider the class of problems where for every set of relevant slots Available online 20 August 2015 (compatible with at least one individual) there are at least as many individuals who have a compatible slot in that set: we ignore the case of underdemand. For this class, we characterize the random scheduling Keywords: Random assignment rule which attaches uniform probability to every efficient deterministic schedule (efficient unifor