In computer networks and social networks, the betweenness centrality of a node measures the amount of information passing through the node when all pairs are conducting shortest-path exchanges. In this paper, we introduce a strategic network-formation game based on the betweenness centrality. In this game, nodes are selfish players, each of which has some budget to build connections. The goal o...

Human players in our laboratory experiment converge closely to the symmetric mixed Nash equilibrium when matched in a single population version of the standard Hawk-Dove game. When matched across two populations, the same players show clear movement towards an asymmetric (and very inequitable) pure Nash equilibrium of the same game. These findings support a distinctive prediction of evolutionar...

Nash equilibrium is one of the most important concepts in game theory. A lot of research efforts are invested into finding Nash equilibria of games. Unfortunately, all existing methods for finding Nash equilibria of arbitrary games require exponential runtime. This makes the application of Nash equilibria impractical. Real world games often have topological independencies. An agent’s payoff doe...

This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension of congestion games by Milchtaich (1996). After characterizing Nash equilibrium of the game, we provide sufficient conditions for which the equivalence between Nash and strong equilibria holds. Somewhat surprisingly, unlike in congestion games, a Nash equilibrium in pure strategies may...

  Supply chain includes two or more parties linked by flow of goods, information, and funds. In a decentralized system, supply chain members make decision regardless of their decision's effects on the performance of the other members and the entire supply chain. This is the key issue in supply chain management, that the mechanism should be developed in which different objectives should be align...

Primary user emulation attack, which targets distabilizing the queuing dynamics of cognitive radio networks, is studied using game theoretic argument. The attack and defense are modeled as a stochastic game. The Nash equilibrium of the game is studied. In particular, the Lyapunov drift is considered as the reward in each round. Explicit expressions of the Nash equilibrium strategies are obtained.

We provide a method for designing a quadratic pricing scheme to induce a desired local Nash equilibrium in an open-loop differential game with nonlinear dynamics. In addition, we present conditions when the induced equilibrium is a global equilibrium. The results are applied to the problem of inducing network managers to invest in security in a multi-network with an epidemic model of the spread...

In this paper I quantize the stag hunt game in the framework proposed by Marinatto and Weber which, is introduced to quntize the Battle of the Sexes game and gives a general quntization scheme of various game theories. Then I discuss the Nash equibilium solution in the cases of which starting strategies are taken in both non entangled state and entangled state and uncover the structure of Nash ...

We study two-person extensive form games, or “matches,” in which the only possible outcomes (if the game terminates) are that one player or the other is declared the winner. The winner of the match is determined by the winning of points, in “point games.” We call these matches binary Markov games. We show that if a simple monotonicity condition is satisfied, then (a) it is a Nash equilibrium of...

This paper investigates the refinements of Nash equilibrium in two person signaling game experiments. The experimental games cover the watershed of the nested refinements: Bayes-Nash, Sequential, Intutitive, Divine, Universally Divine, NWBR, and Stabel. In each game an equilbrium selection problem is defined in which adjacent refinements are considered. The pattern of outcomes suggest that indi...