Pages that link to "Item:Q844925"
From MaRDI portal
The following pages link to Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925):
Displayed 18 items.
- Subgroup additivity in the queueing problem (Q296745) (← 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)
- Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100) (← links)
- Reordering an existing queue (Q1704061) (← links)
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines (Q1939524) (← 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)
- No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects (Q2362196) (← 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 the Queueing Problem with Multiple Identical Machines (Q5022157) (← links)
- A characterization of the Vickrey rule in slot allocation problems (Q6074886) (← links)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)