Advanced Search
MyIDEAS: Login

Assigning agents to a line

Contents:

Author Info

  • Hougaard, Jens Leth

    (University of Copenhagen)

  • Moreno-Ternero, Juan D.

    (Universidad Pablo de Olavide, and CORE, Univeristé catholique de Louvain)

  • Østerdal, Lars Peter

    ()
    (Department of Business and Economics)

Abstract

We consider the problem of assigning agents to a facility, represented by slots on a line, where only one agent can be served at a time. There is a finite number of agents, and each one wants to be served as close as possible to his preferred slot. We first consider deterministic assignment of agents to slots. We characterize (Pareto) efficiency in such setting and provide an algorithm for testing if a given deterministic assignment is efficient. We also characterize utilitarianism (minimization of the total gap between preferred and assigned slots) and provide a quick algorithm for testing if a given deterministic assignment is utilitarian. We then consider probabilistic assignment of agents to slots. In such framework, we characterize, making use of the previous algorithms, a method which is ordinally efficient and utilitarian.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://static.sdu.dk/mediafiles//1/6/A/%7B16AF4B16-2CA1-419B-A1F9-4EFA3D96820C%7Ddpbe11_2012.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Department of Business and Economics, University of Southern Denmark in its series Discussion Papers of Business and Economics with number 11/2012.

as in new window
Length: 35 pages
Date of creation: 01 Jul 2012
Date of revision:
Handle: RePEc:hhs:sdueko:2012_011

Contact details of provider:
Postal: Department of Business and Economics, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark
Phone: 65 50 32 33
Fax: 65 50 32 37
Email:
Web page: http://www.sdu.dk/ivoe
More information through EDIRC

Related research

Keywords: Random assignment; ordinal efficiency; ex post efficiency; congested facility; utilitarianism;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Robert J. Dolan, 1978. "Incentive Mechanisms for Priority Queuing Problems," Bell Journal of Economics, The RAND Corporation, vol. 9(2), pages 421-436, Autumn.
  2. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, 01.
  3. Kesten, Onur, 2009. "Why do popular mechanisms lack efficiency in random environments?," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2209-2226, September.
  4. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2009. "Individual versus group strategy proofedness: when do they coincide?," Working Papers 372, Barcelona Graduate School of Economics.
  5. Alkan, Ahmet & Demange, Gabrielle & Gale, David, 1991. "Fair Allocation of Indivisible Goods and Criteria of Justice," Econometrica, Econometric Society, vol. 59(4), pages 1023-39, July.
  6. Zhou, Lin, 1990. "On a conjecture by gale about one-sided matching problems," Journal of Economic Theory, Elsevier, vol. 52(1), pages 123-135, October.
  7. Ju, Biung-Ghi & Miyagawa, Eiichi & Sakai, Toyotaka, 2007. "Non-manipulable division rules in claim problems and generalizations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 1-26, January.
  8. Yoichi Kasajima, 2013. "Probabilistic assignment of indivisible goods with single-peaked preferences," Social Choice and Welfare, Springer, vol. 41(1), pages 203-215, June.
  9. Moulin, Herve & Cres, Moulin, 2000. "Scheduling with Opting Out: Improving upon Random Priority," Working Papers 2000-03, Rice University, Department of Economics.
  10. Gibbard, Allan, 1978. "Straightforwardness of Game Forms with Lotteries as Outcomes," Econometrica, Econometric Society, vol. 46(3), pages 595-614, May.
  11. Atila Abdulkadiroglu & Tayfun Sonmez, 1998. "Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems," Econometrica, Econometric Society, vol. 66(3), pages 689-702, May.
  12. Bogomolnaia, Anna & Heo, Eun Jeong, 2012. "Probabilistic assignment of objects: Characterizing the serial rule," Journal of Economic Theory, Elsevier, vol. 147(5), pages 2072-2082.
  13. Kojima, Fuhito, 2009. "Random assignment of multiple indivisible objects," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 134-142, January.
  14. Manea, Mihai, 2008. "A constructive proof of the ordinal efficiency welfare theorem," Journal of Economic Theory, Elsevier, vol. 141(1), pages 276-281, July.
  15. HOUGAARD, Jens L. & moreno-ternero, JUAN D. & OSTERDAL, Lars P., 2013. "Assigning agents to a line," CORE Discussion Papers 2013015, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  16. Manea, Mihai, 2009. "Asymptotic ordinal inefficiency of random serial dictatorship," Theoretical Economics, Econometric Society, vol. 4(2), June.
  17. Budish, Eric & Cantillon, Estelle, 2010. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," CEPR Discussion Papers 7641, C.E.P.R. Discussion Papers.
  18. Kojima, Fuhito & Manea, Mihai, 2010. "Incentives in the probabilistic serial mechanism," Journal of Economic Theory, Elsevier, vol. 145(1), pages 106-123, January.
  19. Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-19, March.
  20. YIlmaz, Özgür, 2009. "Random assignment under weak preferences," Games and Economic Behavior, Elsevier, vol. 66(1), pages 546-558, May.
  21. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
  22. Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
  23. Athanassoglou, Stergios & Sethuraman, Jay, 2010. "House allocation with fractional endowments," MPRA Paper 24351, University Library of Munich, Germany.
  24. Chambers, Christopher P., 2004. "Consistency in the probabilistic assignment model," Journal of Mathematical Economics, Elsevier, vol. 40(8), pages 953-962, December.
  25. Hylland, Aanund & Zeckhauser, Richard, 1979. "The Efficient Allocation of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 87(2), pages 293-314, April.
  26. McLennan, Andrew, 2002. "Ordinal Efficiency and the Polyhedral Separating Hyperplane Theorem," Journal of Economic Theory, Elsevier, vol. 105(2), pages 435-449, August.
  27. Ünver, M. Utku & Kesten, Onur & Kurino, Morimitsu & Hashimoto, Tadashi & Hirata, Daisuke, 2014. "Two axiomatic approaches to the probabilistic serial mechanism," Theoretical Economics, Econometric Society, vol. 9(1), January.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Østerdal, Lars Peter, 2012. "Assigning agents to a line," Discussion Papers of Business and Economics 11/2012, Department of Business and Economics, University of Southern Denmark.
  2. CORNUEJOLS, Gérard & WOLSEY, Laurence & YILDIZ, Sercan, 2013. "Sufficiency of cut-generating functions," CORE Discussion Papers 2013027, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:hhs:sdueko:2012_011. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lene Holbæk).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.