457,244 research outputs found

    Randomness for Free

    Get PDF
    We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (both players interact simultaneously); and (b) turn-based (both players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. In this work we present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games

    Timed Parity Games: Complexity and Robustness

    Get PDF
    We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to \emph{turn-based} (i.e., not concurrent) \emph{finite-state} (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, \emph{limit-robust} and \emph{bounded-robust} winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers

    Measuring influence in command games

    Get PDF
    In the paper, we study a relation between command games proposed by Hu and Shapley and an influence model. We show that our framework of influence is more general than the framework of the command games. We define several influence functions which capture the command structure. These functions are compatible with the command games, in the sense that each commandable player for a coalition in the command game is a follower of the coalition under the command influence function. For some influence functions we define the command games such that the influence functions are compatible with these games. We show that not for all influence functions such command games exist. Moreover, we propose a more general definition of the influence index and show that some power indices, which can be used in the command games, coincide with some expressions of the weighted influence indices. We show exact relations between an influence function and a follower function, between a command game and commandable players, and between influence functions and command games. An example of the Confucian model of society is broadly examined.Banzhaf index ; Coleman indices ; command game ; follower of a coalition ; influence function ; influence indices ; Shapley-Shubik index

    Manipulating the Quota in Weighted Voting Games

    No full text
    Weighted voting games provide a popular model of decision making in multiagent systems. Such games are described by a set of players, a list of players' weights, and a quota; a coalition of the players is said to be winning if the total weight of its members meets or exceeds the quota. The power of a player in such games is traditionally identified with her Shapley--Shubik index or her Banzhaf index, two classical power measures that reflect the player's marginal contributions under different coalition formation scenarios. In this paper, we investigate by how much the central authority can change a player's power, as measured by these indices, by modifying the quota. We provide tight upper and lower bounds on the changes in the individual player's power that can result from a change in quota. We also study how the choice of quota can affect the relative power of the players. From the algorithmic perspective, we provide an efficient algorithm for determining whether there is a value of the quota that makes a given player a {\em dummy}, i.e., reduces his power (as measured by both indices) to 0. On the other hand, we show that checking which of the two values of the quota makes this player more powerful is computationally hard, namely, complete for the complexity class PP, which is believed to be significantly more powerful than NP

    Social Comparisons as a device for cooperation in simultaneous-move games

    Get PDF
    This paper analyzes the effects of players' relative comparisons in complete information simultaneous-move games. In particular, every individual is assumed to evaluate the kindness she infers from other players'choices by comparing these choices with respect to a given refer- ence level. Specifically, this paper identifies under what conditions the introduction of relative comparisons leads players to be more cooperative than in standard game-theoretic models. I show that this result holds under certain conditions on the specific reference point that players use in their relative comparisons, and on whether players'relative comparisons leads them to regard each others' actions as more strategic complementary or substitutable. The model is then applied to different examples in public good games which enhance the intuition behind the results. Finally, I show that some existing models in the literature of intentions-based reciprocity and social status acquisition can be rationalized as special cases.Relative comparisons, Reference points, Simultaneous-move games, Kindness, Strategic complementarities.

    Toys for Boys? Women's Marginalization and Participation As Digital Gamers

    Get PDF
    This paper develops out of ongoing research into the location and use of digital gaming in practices of everyday life. Specifically this paper draws on a questionnaire based survey of just under four hundred undergraduate students and twenty-three follow up interviews. This paper suggests that the women in this research play digital games significantly less than their male counterparts, and suggests that this is largely due to digital games continuing to be viewed, both culturally and by the gaming industry, as belonging to men. However, this paper suggests that for some women video and computer gaming can be an important social activity, and for others mobile telephone based gaming can offer a less restricted and more accessible leisure activity.Gender, Digital Gaming

    Promoting dental care to children using traditional and interactive media following threat appeals

    Get PDF
    In recent years, computer games have become an important part of children’s lives. Gaming is not only one of their favorite pastime activities, but games are also increasingly used by marketers in an attempt to influence children’s purchase behavior. Today, almost every food and beverage brand targeting children has an advergame on its website. Advergames are “computer games specifically created to function as advertisements to promote brands”, containing brand identifiers such as logos and brand characters (Kretchmer, 2005: 7). Games can also be powerful learning tools. Several authors (e.g., Gee, 2003; Prensky, 2001) argue that computer games can be more enjoyable, more interesting and thus more effective than traditional learning modes to increase children’s knowledge. Empirical studies that evaluated the impact of the use of games within disciplines such as mathematics, science, language, geography and computer science show positive outcomes in terms of learning effectiveness in relation to curricular objectives (e.g., Papastergiou, 2009; Rosas et al., 2003). However, these authors mainly focus on the learning ability of games rather than their persuasive impact for social marketing purposes. In the area of health education, playing computer games has often been seen with skepticism (e.g., Bale, 1994; Funk and Buchman, 1995)
    • …
    corecore