Skip to main content

Games of Connectivity

  • Conference paper
Internet and Network Economics (WINE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4286))

Included in the following conference series:

  • 990 Accesses

Abstract

We consider a communications network in which users transmit beneficial information to each other at a cost. We pinpoint conditions under which the induced cooperative game is supermodular (convex). Our analysis is in a lattice-theoretic framework, which is at once simple and able to encompass a wide variety of seemingly disparate models.

JEL Classification: C71, D82, L96.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.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

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. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Symposium on Foundations of Computer Science (FOCS 2004) (October 2004)

    Google Scholar 

  2. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: ACM Symposium on Theory of Computing (STOC 2003), pp. 511–520 (June 2003)

    Google Scholar 

  3. Birkhoff, G.: Lattice theory. In: Encyclopaedia Brittanica, Macropaedia, vol. 1, pp. 519–524. Encyclopaedia Brittanica Inc., Helen Hemingway Benton, London (1977)

    Google Scholar 

  4. Dubey, P., Garg, R.: Games of connectivity. Technical Report RI04006, IBM Research Report (July 2004)

    Google Scholar 

  5. Feigenbaum, J., Papadimitriou, C., Shenker, S.: Sharing the cost of multicast transmissions. In: ACM Symposium on Theory of Computing (STOC 2000), Portland, Oregon, USA (May 2004)

    Google Scholar 

  6. Shapley, L.: A value for n-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol. 2(28) (1953)

    Google Scholar 

  7. Shapley, L.: Cores of convex games. International Journal of Game Theory 1, 11–26 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  8. Wang, Y., Zhu, Q.: Error control and concealment for video communications: A review. Proceedings of IEEE, special issue on Multimedia Signal Processing, 974–997 (May 1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubey, P., Garg, R. (2006). Games of Connectivity. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_18

Download citation

  • DOI: https://doi.org/10.1007/11944874_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68138-0

  • Online ISBN: 978-3-540-68141-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics