Random scheduling with deadlines under dichotomous preferences

DOI10.1016/J.JMATECO.2015.08.001zbMATH Open1368.90081OpenAlexW1150962216MaRDI QIDQ898667FDOQ898667

Authors: İ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

Recommendations

• A note on the assignment problem with uniform preferences
• A simple random assignment problem with a unique solution
• Fair Queuing and Other Probabilistic Allocation Methods
• Scheduling with Opting Out: Improving upon Random Priority
• Proportional scheduling, split-proofness, and merge-proofness

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

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

Cited In (5)

• On slots' scheduling
• Scheduling with Opting Out: Improving upon Random Priority
• Making random choices invisible to the scheduler
• Scheduling In the random-order model
• Collective schedules: axioms and algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898667)