Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Game Theoretic Approaches for Spectrum RedistributionGame-Theoretic Channel Allocation in Clique

Game Theoretic Approaches for Spectrum Redistribution: Game-Theoretic Channel Allocation in Clique [In this chapter, we study the problem of game-theoretic channel allocation in clique, where all the nodes are in the same collision domain and have to compete with each other to get limited wireless media for communication. Two complementary approaches are presented for pre-partitioned (Sect. 4.1) and adjustable (Sect. 4.2) channel allocation, respectively. Both of the two approaches can achieve globally optimal network throughput, and guarantee the system converge to a (strongly) dominant strategy equilibrium in a single step.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Game Theoretic Approaches for Spectrum RedistributionGame-Theoretic Channel Allocation in Clique

Download PDF
27 pages

Loading next page...
 
/lp/springer-journals/game-theoretic-approaches-for-spectrum-redistribution-game-theoretic-8x2vs5m3el
Publisher
Springer New York
Copyright
© The Author(s) 2014
ISBN
978-1-4939-0499-0
Pages
11 –37
DOI
10.1007/978-1-4939-0500-3_4
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we study the problem of game-theoretic channel allocation in clique, where all the nodes are in the same collision domain and have to compete with each other to get limited wireless media for communication. Two complementary approaches are presented for pre-partitioned (Sect. 4.1) and adjustable (Sect. 4.2) channel allocation, respectively. Both of the two approaches can achieve globally optimal network throughput, and guarantee the system converge to a (strongly) dominant strategy equilibrium in a single step.]

Published: Jan 27, 2014

Keywords: Nash Equilibrium; System Throughput; Channel Allocation; Strategy Profile; Charge Scheme

There are no references for this article.