Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
This paper introduces a paradigm for the resolution of a particular class of games (K) within Game Theory and develops mathematical methods for the analysis of conflicting situations in which the contenders share a finite series of measurable information. Classical equilibria schemes do not contemplate the presence of a symmetric and incomplete perturbative element in the games, leaving out a study case of enormous interest. The main result is the demonstration of the existence of the temporised equilibrium for every K-game and, in particular, the solution properties in symmetric games, with references to the geometrical structure of the proposed argumentation.