Dynamic Allocation of Objects to Queuing Agents: The Discrete Model - HAL-SHS - Sciences de l'Homme et de la Société Access content directly
Other Publications Year : 2014

Dynamic Allocation of Objects to Queuing Agents: The Discrete Model

David Cantala
  • Function : Author

Abstract

This paper analyzes the optimal allocation of objects which arrive sequentially to agents organized in a waiting list. Applications include the assignment of social housing, deceased donor organs and daycare slots. A mechanism is a probability distribution over all priority orders which are consistent with the waiting list. We consider three efficiency criteria: first order stochastic dominance in the vector of agents' values, the probability of misallocation and the expected waste. We show that the strict seniority order dominates uniform random order according to the two first criteria, and the uniform random order dominates strict priority according to the third criterion. If agents values are perfectly correlated, strict priority dominates all other probabilistic mechanisms for all agents values.
Fichier principal
Vignette du fichier
14066.pdf (846.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

halshs-01109667 , version 1 (26-01-2015)

Identifiers

  • HAL Id : halshs-01109667 , version 1

Cite

Francis Bloch, David Cantala. Dynamic Allocation of Objects to Queuing Agents: The Discrete Model. 2014. ⟨halshs-01109667⟩
253 View
284 Download

Share

Gmail Facebook X LinkedIn More