Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
scientific article; zbMATH DE number 5666114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems |
scientific article; zbMATH DE number 5666114 |
Statements
Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (English)
0 references
5 February 2010
0 references
queueing problems
0 references
efficiency
0 references
fairness
0 references
strategy-proofness
0 references
0 references
0 references
0 references
0.853266716003418
0 references
0.8457565307617188
0 references
0.8440700769424438
0 references
0.8424991965293884
0 references
0.839838445186615
0 references
