Scheduling with Opting Out: Improving upon Random Priority
From MaRDI portal
Recommendations
- An equilibrium analysis of the probabilistic serial mechanism
- Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms
- Random scheduling with deadlines under dichotomous preferences
- A new solution to the random assignment problem.
- The object allocation problem with random priorities
Cited in
(37)- Optimal randomized scheduling by replacement
- Egalitarian equivalence and strategyproofness in the queueing problem
- On slots' scheduling
- Probabilistic assignment of indivisible goods with single-peaked preferences
- Pairwise kidney exchange
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem
- Making random choices invisible to the scheduler
- Strategic candidacy for multivalued voting procedures
- Ordinal efficiency and the polyhedral separating hyperplane theorem
- Subgroup additivity in the queueing problem
- Incentives in the probabilistic serial mechanism
- A solution to the random assignment problem on the full preference domain
- A new solution to the random assignment problem.
- No-envy, solidarity, and strategy-proofness in the queueing problem
- On the decomposability of fractional allocations
- Estimating the expected social welfare and cost of random serial dictatorship
- An equilibrium analysis of the probabilistic serial mechanism
- A note on the assignment problem with uniform preferences
- Random assignment of multiple indivisible objects
- Random scheduling with deadlines under dichotomous preferences
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Parametrized algorithms for random serial dictatorship
- Why do popular mechanisms lack efficiency in random environments?
- Strategy-proofness and population-monotonicity for house allocation problems
- The probabilistic serial mechanism with private endowments
- Assigning agents to a line
- The complexity of computing the random priority allocation matrix
- Ordinal efficiency and dominated sets of assignments.
- Second-best mechanisms in queuing problems without transfers: the role of random priorities
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
- Random assignment under weak preferences
- Random assignments on preference domains with a tier structure
- Size versus fairness in the assignment problem
- Social welfare in one-sided matching markets without money
- Recent developments in the queueing problem
This page was built for publication: Scheduling with Opting Out: Improving upon Random Priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635022)
