Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems

A set of agents with possibly different waiting costs have to receive the same service one after the other. Efficiency requires to maximize total welfare. Fairness requires to treat equal agents equally. One must form a queue, set up monetary transfers to compensate agents having to wait, and not a...

Full description

Autores:

Tipo de recurso:

Fecha de publicación:

2010

Institución:

Universidad del Rosario

Repositorio:

Repositorio EdocUR - U. Rosario

Idioma:

eng

OAI Identifier:

oai:repository.urosario.edu.co:10336/27356

Acceso en línea:

https://doi.org/10.1016/j.geb.2009.07.003
https://repository.urosario.edu.co/handle/10336/27356

Palabra clave:

Queueing problems
Efficiency
Fairness
Strategy-proofness

Rights

License

Restringido (Acceso a grupos específicos)