Pages that link to "Item:Q523512"
From MaRDI portal
The following pages link to Welfare lower bounds and strategy-proofness in the queueing problem (Q523512):
Displaying 13 items.
- Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency (Q427528) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines (Q1939524) (← links)
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
- No-envy, solidarity, and strategy-proofness in the queueing problem (Q2178588) (← links)
- No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects (Q2362196) (← 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)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)
- Queueing games with an endogenous number of machines (Q6494256) (← links)
- The on-line transfer rule for queueing with arrivals (Q6615359) (← links)
- Generalized welfare lower bounds and strategyproofness in sequencing problems (Q6624513) (← links)