… With the use of a simple network model we first study the … Reputation mechanism for Wireless
ad hoc Networks), where we try … to the equilibrium strategies, and is off the equilibrium path …

… Our main objective in this section is to derive the rate balance equations from which some
properties of the forwarding queues can be deduced. For that we need to write the departure …

… Nash Equilibrium Refinements Based on the above analysis, … Next, we show how to perform
equilibrium refinement, that is, … , known as subgame perfect equilibrium. According to the …

… analyze two fundamental connectivity games, namely broadcast and convergecast. We study
pure Nash equilibria and quantify the degradation in the network … study centralized network …

… In the recent literature, different ad hoc networking games have been proposed to analyze
the problem of selfish node behavior in forwarding packets [10-16]. In these games, nodes …

… We evaluate the relationship among credit balance, the total energy spent in forwarding each
… a node from generating new packets when its credit balance is below a threshold. We also …

… In wireless ad hoc networks, although … to analyze the interactions between pairs of
attacking/defending nodes using a Bayesian formulation. We study the achievable Nash equilibrium …

… to analyze intrusion detection in mobile ad hoc networks. We use game theory to model the
interactions between the nodes of an ad hoc network… Nash equilibrium is the pure form of the …

… cannot be achieved in ad hoc networks. We prove … Equilibrium can be achieved in ad hoc
networks. In fact, we design a scheme in which all Nash equilibria are strong Nash equilibria…

… We note that the system converges to an equilibrium rate allocation and an equilibrium price
vector within 800 iterations. This result is comparable to other relay-based pricing scheme …