Skip to main content

Preferences Lower Bound in the Queueing Model

  • Chapter
Econophysics of Markets and Business Networks

Part of the book series: New Economic Windows ((NEW))

Abstract

We show the existence of a first best incentive compatible mechanism for the queueing model that satisfies identical preferences lower bound. We call this mechanism the FB′ mechanism. We also show that for the queueing model, either with three agents or with four agents, the FB′ mechanism is the only first best incentive compatible mechanism that satisfies identical preferences lower bound.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bevia C (1994) Identical preferences lower bound solution and consistency in economies with indivisible goods. Social Choice and Welfare 13: 113–126.

    Article  Google Scholar 

  2. Bevia C (1998) Fair allocation in a general model with indivisible objects. Review of Economic Design 3: 195–213.

    Article  Google Scholar 

  3. Chun Y (2004) A note on Maniquet’s characterization of the Shapley value in queueing problems. Working paper, Rochester University.

    Google Scholar 

  4. Maniquet F (2003) A characterization of the Shapley value in queueing problems. Journal of Economic Theory 109: 90–103.

    Article  MATH  MathSciNet  Google Scholar 

  5. Mitra M (2001) Mechanism design in queueing problems. Economic Theory 17: 277–305.

    Article  MATH  MathSciNet  Google Scholar 

  6. Moulin H (1990) Fair division under joint ownership: recent results and open problems. Social Choice and Welfare 7: 149–170.

    Article  MATH  MathSciNet  Google Scholar 

  7. Shapley LS (1953) A value for n-person games. In: Contributions to the Theory of Games II (Eds. Kuhn H, Tucker AW). Princeton University Press, Princeton, 307–317.

    Google Scholar 

  8. Thomson W (2003) On monotonicity in economies with indivisible goods. Social Choice and Welfare 21: 195–205.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Italia

About this chapter

Cite this chapter

Mitra, M. (2007). Preferences Lower Bound in the Queueing Model. In: Chatterjee, A., Chakrabarti, B.K. (eds) Econophysics of Markets and Business Networks. New Economic Windows. Springer, Milano. https://doi.org/10.1007/978-88-470-0665-2_17

Download citation

Publish with us

Policies and ethics