Pages that link to "Item:Q3635022"
From MaRDI portal
The following pages link to Scheduling with Opting Out: Improving upon Random Priority (Q3635022):
Displayed 33 items.
- Subgroup additivity in the queueing problem (Q296745) (← links)
- An equilibrium analysis of the probabilistic serial mechanism (Q328558) (← links)
- Parametrized algorithms for random serial dictatorship (Q477775) (← links)
- Assigning agents to a line (Q485809) (← links)
- Ordinal efficiency and the polyhedral separating hyperplane theorem (Q697847) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Why do popular mechanisms lack efficiency in random environments? (Q840694) (← links)
- Incentives in the probabilistic serial mechanism (Q848608) (← links)
- A solution to the random assignment problem on the full preference domain (Q860356) (← links)
- Random scheduling with deadlines under dichotomous preferences (Q898667) (← links)
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
- The probabilistic serial mechanism with private endowments (Q980972) (← links)
- Random assignment of multiple indivisible objects (Q1005770) (← links)
- Random assignment under weak preferences (Q1021614) (← links)
- Ordinal efficiency and dominated sets of assignments. (Q1411037) (← links)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
- On characterizations of the probabilistic serial mechanism involving incentive and invariance properties (Q1680097) (← links)
- Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100) (← links)
- A note on the assignment problem with uniform preferences (Q1785360) (← links)
- Strategy-proofness and population-monotonicity for house allocation problems (Q1867775) (← links)
- Strategic candidacy for multivalued voting procedures (Q1877156) (← links)
- No-envy, solidarity, and strategy-proofness in the queueing problem (Q2178588) (← links)
- Egalitarian equivalence and strategyproofness in the queueing problem (Q2249580) (← links)
- Random assignments on preference domains with a tier structure (Q2338670) (← links)
- Size versus fairness in the assignment problem (Q2343388) (← links)
- Guaranteed size ratio of ordinally efficient and envy-free mechanisms in the assignment problem (Q2411514) (← links)
- Recent developments in the queueing problem (Q2421321) (← links)
- The computational complexity of random serial dictatorship (Q2453028) (← links)
- Probabilistic assignment of indivisible goods with single-peaked preferences (Q2453443) (← links)
- The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223) (← links)
- Social Welfare in One-Sided Matching Markets without Money (Q3088085) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- A new solution to the random assignment problem. (Q5958895) (← links)