Skip to main content

Interference Games in Wireless Networks

  • Conference paper
Internet and Network Economics (WINE 2008)

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

Included in the following conference series:

Abstract

We present a game-theoretic approach to the study of scheduling communications in wireless networks and introduce and study a class of games that we call Interference Games. In our setting, a player can successfully transmit if it “shouts strongly enough”; that is, if her transmission power is sufficiently higher than all other (simultaneous) transmissions plus the environmental noise. This physical phenomenon is commonly known as the Signal-to-Interference-plus-Noise-Ratio (SINR).

Research funded by the European Union through IST FET Integrated Project AEOLUS (IST-015964), and Information Communication Technologies Project FRONTS (project number 215270, Seventh Framework).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Adlakha, S., Johari, R., Goldsmith, A.J.: Competition in wireless systems via bayesian interference games. CoRR, abs/0709.0516 (2007)

    Google Scholar 

  2. Aumann, R.J.: Subjectivity and correlation in randomized games. Journal of Mathematical Economics 1, 67–96 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  3. Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Fiat, A., Mansour, Y., Nadav, U.: Efficient contention resolution protocols for selfish agents. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, pp. 179–188 (2007)

    Google Scholar 

  5. Fudenberg, D., Maskin, E.: The folk theorem in repeated games with discounting or with incomplete information. Econometrica 54(3), 533–554 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  6. Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS, pp. 142–154. IEEE Computer Society, Los Alamitos (2005)

    Google Scholar 

  7. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Montreal, Canada (September 2007)

    Google Scholar 

  8. Hendricks, K., Weiss, A., Wilson, C.: The war of attrition in continuous time with complete information. International Economic Review 29(4), 663–680 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hendricks, K., Wilson, C.: Discrete versus continuous time in games of timing. Working Papers 85-41, C.V. Starr Center for Applied Economics, New York University (1985)

    Google Scholar 

  10. Lotker, Z., Patt-Shamir, B., Tuttle, M.R.: Timing games and shared memory. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 507–508. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), Florence, Italy (May 2006)

    Google Scholar 

  12. Nash, J.F.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences 36, 48–49 (1950)

    Google Scholar 

  13. Osborne, M.J., Rubinstein, A.: A course in Game Thoery. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  14. Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Auletta, V., Moscardelli, L., Penna, P., Persiano, G. (2008). Interference Games in Wireless Networks . In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92185-1_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92184-4

  • Online ISBN: 978-3-540-92185-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics