Random scheduling with deadlines under dichotomous preferences

DOI10.1016/j.jmateco.2015.08.001zbMath1368.90081OpenAlexW1150962216MaRDI QIDQ898667

İbrahim Barış Esmerok

Publication date: 18 December 2015

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2015.08.001

zbMATH Keywords

probabilistic consistencyrandom assignmentscheduling with deadlinesefficient uniform rule

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Discrete location and assignment (90B80)

Cites Work

• A simple random assignment problem with a unique solution
• Consistency in the probabilistic assignment model
• Matching theory
• Scheduling with Opting Out: Improving upon Random Priority
• Random Matching Under Dichotomous Preferences
• A new solution to the random assignment problem.

This page was built for publication: Random scheduling with deadlines under dichotomous preferences