The price of anarchy (PoA) is a standard measure to quantify the inefficiency equilibria in nonatomic congestion games. Most publications have focused on worst-case bounds for PoA. Only few analyzed sensitivity PoA against changes demands or cost functions, although that crucial empirical computations We analyze with respect (w.r.t.) simultaneous and functions. key this analysis metric distance...

Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium. Nash’s approach to the problem for strategic games is probabilistic, i.e. continuous, and static. CP and BR approaches for CP and BR games are discrete and dynami...

In many real-world systems, strategic agents’ decisions can be understood as complex—i.e., consisting of multiple subdecisions—and hence can give rise to an exponential number of pure strategies. Examples include network congestion games, simultaneous auctions, and security games. However, agents’ sets of strategies are often structured, allowing them to be represented compactly. There currentl...

Given a bimatrix game, the associated leadership or commitment games are defined as the games at which one player, the leader, commits to a (possibly mixed) strategy and the other player, the follower, chooses his strategy after having observed the irrevocable commitment of the leader. Based on a result by von Stengel and Zamir [2010], the notions of commitment value and commitment optimal stra...

We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour [10]. They presented an FPTAS for computing an approximate equilibrium, and conjectured that there is a polynomial algorithm for finding an exact equilibrium [9]. We extend their study in two directions: (1) We show that finding an exact equilibrium, even for two-player z...

background: nowadays computer games are one of the main entertainments for children and adolescents. there are different results about positive and negative impacts of these games. the aim of this study was the survey of relationship between playing computer games and aggression in guidance school students of kermanshah city in 2012. methods: in this cross sectional study, 573 student selected ...

1 Summary We discuss strategies in non-zero sum games of perfect information on graphs. The study of non-zero sum games on graphs is motivated by the advent of computational tasks on the worldwide web and related security requirements which have thrown up many interesting areas of interaction between game theory and computer science. For example, signing contracts on the web requires interactio...

Nowadays computers are increasingly being incorporated into school curriculums and serious games are occupying the educational games markets. This article addressed the integration of serious games as tools for learning and teaching English in Iranian schools to zero-beginner students. An experiment was concluded using Computer Assisted Language Learning (CALL) to investigate the effectiveness ...

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...