We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric games and obtain a complete set of quantum Nash equilibria. Apart from those available with the maximal entanglement, these quantum Nash equilibria are exten...

Web search engines use link-based reputation systems (e.g. PageRank) to measure the importance of web pages, giving rise to the strategic manipulations of hyperlinks by spammers and others to boost their web pages’ reputation scores. Hopcroft and Sheldon [10] study this phenomenon by proposing a network formation game in which nodes strategically select their outgoing links in order to maximize...

0. IntrodiK îoii. We consider iV-person repeated games with complete information and standard signalling. We introduce the n-stage game, the X-discounted game and the infinitely repeated game; then we prove several properties conceming the sets of feasible payoffs and of Nash equilibrium payoffs. The properties studied are mainly the relation between convexity and stationarity and the simply-co...

We consider a two player bimatrix game where the entries of the payoff matrices are random variables. We formulate this problem as a chance-constrained game by considering that the payoff of each player is defined using a chance constraint. We consider the case where the entries of the payoff matrices are independent normal/Cauchy random variables. We show a one-to-one correspondence between a ...

A new Bluetooth authentication model using some game theory concepts is presented in this paper. Bluetooth is a wireless communication protocol designed for WPAN (Wireless Personal Area Nework) use. Game theory is a branch of mathematics and logic which deals with the analysis of games. An authentication between two Bluetooth devices is an unidirectional challenge-response procedure and consequ...

We consider a particular instance of a stochastic multi-leader multi-follower equilibrium problem in which players compete in the forward and spot markets in successive periods. Proving the existence of such equilibria has proved difficult as has the construction of globally convergent algorithms for obtaining such points. By conjecturing a relationship between forward and spot decisions, we co...

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player turnbased game which turns Nash equilibria into winning strategies (for some objective that depends on the preference relations of the players in t...