Pages that link to "Item:Q5940592"
From MaRDI portal
The following pages link to Mechanism design in queueing problems (Q5940592):
Displayed 35 items.
- Subgroup additivity in the queueing problem (Q296745) (← links)
- Auctioning and selling positions: a non-cooperative approach to queueing conflicts (Q406371) (← links)
- Balanced consistency and balanced cost reduction for sequencing problems (Q427519) (← links)
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency (Q427528) (← links)
- Characterizations of pivotal mechanisms in the queueing problem (Q477794) (← links)
- Welfare lower bounds and strategy-proofness in the queueing problem (Q523512) (← links)
- Consistency and monotonicity in sequencing problems (Q532511) (← links)
- When queueing is better than push and shove (Q532746) (← links)
- Group strategyproofness in queueing models (Q536097) (← links)
- Secure implementation in Shapley-Scarf housing markets (Q639889) (← links)
- On efficient partnership dissolution under ex post individual rationality (Q639892) (← links)
- Simple sequencing problems with interdependent costs (Q705856) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Efficient allocation of heterogeneous commodities with balanced transfers (Q976966) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100) (← links)
- Reordering an existing queue (Q1704061) (← links)
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs (Q1744245) (← links)
- Incomplete information and multiple machine queueing problems (Q1776969) (← links)
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines (Q1939524) (← links)
- On optimal mechanism design for a sequencing problem (Q2018936) (← links)
- Strategy-proof and Pareto efficient allocation of indivisible goods: general impossibility domains (Q2041075) (← links)
- Prior-free online mechanisms for queueing with arrivals (Q2059079) (← links)
- No-envy, solidarity, and strategy-proofness in the queueing problem (Q2178588) (← links)
- Egalitarian equivalence and strategyproofness in the queueing problem (Q2249580) (← links)
- A characterization of the symmetrically balanced VCG rule in the queueing problem (Q2278940) (← links)
- Incentives and justice for sequencing problems (Q2403448) (← links)
- Egalitarianism in the queueing problem (Q2419503) (← links)
- Recent developments in the queueing problem (Q2421321) (← links)
- No-envy in queueing problems (Q2505518) (← links)
- A pessimistic approach to the queueing problem (Q2507236) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)