The following pages link to No-envy in queueing problems (Q2505518):
Displaying 33 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)
- Comparable characterizations of four solutions for permission tree games (Q523060) (← links)
- Welfare lower bounds and strategy-proofness in the queueing problem (Q523512) (← links)
- Consistency and monotonicity in sequencing problems (Q532511) (← links)
- Axiomatizations of two types of Shapley values for games on union closed systems (Q535178) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- Children crying at birthday parties. Why? (Q878403) (← links)
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems (Q926221) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- Second-best mechanisms in queuing problems without transfers: the role of random priorities (Q1680100) (← links)
- Reordering an existing queue (Q1704061) (← 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)
- Knapsack cost sharing (Q2254240) (← links)
- The average tree permission value for games with a permission tree (Q2256861) (← 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)
- Component efficient solutions in line-graph games with applications (Q2385112) (← links)
- Incentives and justice for sequencing problems (Q2403448) (← links)
- Egalitarianism in the queueing problem (Q2419503) (← links)
- Recent developments in the queueing problem (Q2421321) (← links)
- A fair staff allocation rule for the capacity pooling of multiple call centers (Q2450697) (← links)
- Fairness and implementability in allocation of indivisible objects with monetary compensations (Q2457247) (← links)
- No-envy in the Queueing Problem with Multiple Identical Machines (Q5022157) (← links)
- Consistent queueing rules (Q6120931) (← links)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)
- The on-line transfer rule for queueing with arrivals (Q6615359) (← links)
- Generalized welfare lower bounds and strategyproofness in sequencing problems (Q6624513) (← links)
