## Game Theory for Wireless EngineersThe application of mathematical analysis to wireless networks has met with limited success, due to the complexity of mobility and traffic models, coupled with the dynamic topology and the unpredictability of link quality that characterize such networks. The ability to model individual, independent decision makers whose actions potentially affect all other decision makers makes game theory particularly attractive to analyze the performance of ad hoc networks. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

12 WHERE DID GAME THEORY COME FROM? | 3 |

13 WHY IS GAME THEORY RELEVANT TO WIRELESS COMMUNICATIONS AND NETWORKING? | 4 |

14 HOW CAN I USE GAME THEORY PROPERLY? | 5 |

15 INTRODUCTION TO EXAMPLES | 7 |

152 Routing | 8 |

153 Trust Management | 9 |

16 NOTATION | 10 |

342 Discussion of Nash Equilibrium | 35 |

36 APPLICATIONS | 39 |

362 Flow Control | 41 |

Repeated and Markov Games | 43 |

411 Extensive Form Representation | 44 |

412 Equilibria in Repeated Games | 45 |

413 Repeated Games in Strategic Form | 46 |

A Repeated Game Example | 47 |

Decision Making and Utility Theory | 13 |

22 EXISTENCE OF ORDINAL UTILITY REPRESENTATIONS | 14 |

221 Finite X | 15 |

222 Countable X | 16 |

224 Uniqueness of Utility Functions | 18 |

23 PREFERENCES OVER LOTTERIES | 19 |

231 The von NeumannMorgenstern Axioms | 20 |

232 Von NeumannMorgenstern and the Existence of Cardinal Utility Representations | 22 |

24 OTHER VISIONS OF EXPECTED UTILITY REPRESENTATIONS | 25 |

25 CONCLUSION | 27 |

Strategic Form Games | 29 |

32 DOMINATED STRATEGIES AND ITERATIVE DELETION OF DOMINATED STRATEGIES | 31 |

33 MIXED STRATEGIES | 32 |

34 NASH EQUILIBRIUM | 33 |

341 Dealing with Mixed Strategies | 34 |

415 The Folk Theorems | 50 |

GENERALIZING THE REPEATED GAME IDEA | 52 |

43 APPLICATIONS | 53 |

432 Medium Access Control | 54 |

Convergence to Equilibrium Potential Games | 57 |

52 POTENTIAL GAMES | 60 |

522 Convergence | 61 |

523 Identification | 62 |

524 Interpretation | 63 |

Future Directions | 65 |

612 Cognitive Radios and Learning | 67 |

614 Mechanism Design | 68 |

62 CONCLUSIONS | 69 |

### Other editions - View all

### Common terms and phrases

action profile application of game Archimedean axiom best response binary relation change strategies chapter choose cognitive radio communications and networking concept consider convergence convex cooperation countable cr_i define Definition deletion of dominated denote discuss dominated strategies exact potential game example existence expected utility representation extensive form games finite set fixed point folk theorems game F game in strategic game theory hoc networks improvement path iterative deletion lottery Markov games maximize mixed strategies Nash equilibrium nodes optimization ordinal potential game ordinal utility outcomes play player potential function power control power level preference relation preference relationship probability distributions problem proof pure strategies repeated game represents resource sharing round single stage game SINR strategic form game strategy profiles strategy space subgame perfect equilibrium theorem throughput uncountable unilaterally deviating upper hemicontinuous user's users utility function video with probability weak topology wireless communications wireless networks wireless systems

### Popular passages

Page 71 - CU Saraydar. NB Mandayam. and DJ Goodman. "Efficient power control via pricing in wireless data networks," IEEE Transactions at Communications, vol.

Page ix - This work was supported by the Office of Naval Research and the National Science Foundation.

Page 72 - Optimal routing control: Game theoretic approach," in Proceedings of the 36th IEEE Conference on Decision and Control, vol. 3, 1997, pp. 2910-2915.doi:full_text [18] T. Roughgarden and E. Tardos, "How bad is selfish routing?

Page 72 - Y Korilis. A. Lazar, and A. Orda. "Achieving network optima using Stackelberg routing strategies.

Page 72 - On using reputations in ad hoc networks to counter malicious nodes," in Proceedings of the 10th International Conference on Parallel and Distributed Systems, July 2004, pp. 665—672. [25] J. Liu and V. Issarny, "Enhanced reputation mechanism for mobile ad hoc networks," in Proceedings of the 2nd International Conference on Trust Management, April 2004.

Page ix - Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors) and do not necessarily reflect the views of the Office of Naval Research or the DARPA.