Domination Game Research Articles

How much control do Latinos and African Americans have of their mutual relations?

This article offers a structural interpretation of Black–Latino relations based on critical insights especially from political economy and the work of Pierre Bourdieu. It argues that, socialized to play the roles that correspond to their positions, Blacks and Latinos have limited control of their relations; rather, relations express racial structures giving Whites the upper hand. In this context, Black–Latino relations are relations between two differentially constituted races that, when playing by the script, are often pitted against each other. To gain control of their relations, Blacks and Latinos need to develop awareness of the script they are ruled by and challenge the game of racial domination.

Domination game: Effect of edge- and vertex-removal

The domination game is played on a graph G by two players, named Dominator and Staller. They alternatively select vertices of G such that each chosen vertex enlarges the set of vertices dominated before the move on it. Dominator’s goal is that the game is finished as soon as possible, while Staller wants the game to last as long as possible. It is assumed that both play optimally. Game 1 and Game 2 are variants of the game in which Dominator and Staller has the first move, respectively. The game domination number γg(G) and the Staller-start game domination number γ′(G) are the number of vertices chosen in Game 1 and Game 2, respectively. It is proved that if e∈E(G), then |γg(G)−γg(G−e)|≤2 and |γ′(G)−γ′(G−e)|≤2, and that each of the possibilities here is realizable by connected graphs G for all values of γg(G) and γ′(G) larger than 5. For the remaining small values it is either proved that realizations are not possible or realizing examples are provided. It is also proved that if v∈V(G), then γg(G)−γg(G−v)≤2 and γ′(G)−γ′(G−v)≤2. Possibilities here are again realizable by connected graphs G in almost all the cases, the exceptional values are treated similarly as in the edge-removal case.

Shakespeare's Dual Attitude about Old Man As in King Lear and Prospero

Striking similarities link the two old, irascible, and negligent rulers, Lear and Prospero. However, there exist distinctive demarcations between them in terms of aging and of their attitudes of accepting it. The most poignant difference between Prospero and Lear is the fact that the former is in complete control of what is going on around him, while the latter abjectly has lost control of the course of his later life. In addition, Prosperos ideal retirement planning and concern for his daughter differ sharply from Lears lack of retirement planning and even his incestuous emotions directed at his daughter, specially at Cordelia. Prospero plans the future of Miranda and establishes for himself a vital network of social support. And he anticipates and accepts his coming loss of influence and power gracefully. Prosperos recognition of bad quality deeply embedded in human mind and his discovery of his own mortality move him at last to declare his kinship with imperfect man and to forgive all. Prospero learns the lessons taught by age before it is too late and thus transforms a devouring quality of old age into a time of positive and regenerative force. Unlike Prospero, Lear wishes to retire and yet not retire. Unable to give up the dominance game, unwilling to accept aging and retirement as new stages in lifes cycles, Lear yearns to be coddled in the nursery of Cordelias care. Following the familiar pattern that a tragic old man usually takes, Lear first becomes disoriented, then angry, then depressed, and finally goes mad. Paradoxically, Lears progress into madness is accompanied by a journey into self-awareness. However, tragically, Lear learns too late the wisdom taught by age, and the eve of his maturation becomes the day of his death.

Diverging fluctuations in a spatial five-species cyclic dominance game

A five-species predator-prey model is studied on a square lattice where each species has two prey and two predators on the analogy to the rock-paper-scissors-lizard-Spock game. The evolution of the spatial distribution of species is governed by site exchange and invasion between the neighboring predator-prey pairs, where the cyclic symmetry can be characterized by two different invasion rates. The mean-field analysis has indicated periodic oscillations in the species densities with a frequency becoming zero for a specific ratio of invasion rates. When varying the ratio of invasion rates, the appearance of this zero-eigenvalue mode is accompanied by neutrality between the species associations. Monte Carlo simulations of the spatial system reveal diverging fluctuations at a specific invasion rate, which can be related to the vanishing dominance between all pairs of species associations.

Domination game: Extremal families of graphs for [formula omitted]-conjectures

Two players, Dominator and Staller, alternately choose vertices of a graph G, one at a time, such that each chosen vertex enlarges the set of vertices dominated so far. The aim of Dominator is to finish the game as soon as possible, while the aim of Staller is just the opposite. The game domination number γg(G) is the number of vertices chosen when Dominator starts the game and both players play optimally. It has been conjectured in Kinnersley et al. (2012) [7] that γg(G)≤3|V(G)|5 holds for an arbitrary graph G with no isolated vertices, which is in particular open when G is a forest. In this paper, we present constructions that lead to large families of trees that attain the conjectured 3/5-bound. Some of these families can be used to construct graphs with game domination number 3/5 of their order by gluing them to an arbitrary graph. All extremal trees on up to 20 vertices were found by a computer. In particular, there are exactly ten trees T on 20 vertices with γg(T)=12, all of which belong to the constructed families.

Domination game played on trees and spanning subgraphs

The domination game, played on a graph G, was introduced in Brešar et al. (2010) [2]. Vertices are chosen, one at a time, by two players Dominator and Staller. Each chosen vertex must enlarge the set of vertices of G dominated to that point in the game. Both players use an optimal strategy—Dominator plays so as to end the game as quickly as possible, and Staller plays in such a way that the game lasts as many steps as possible. The game domination number γg(G) is the number of vertices chosen when Dominator starts the game and the Staller-start game domination number γg′(G) is the result when Staller starts the game.In this paper these two games are studied when played on trees and spanning subgraphs. A lower bound for the game domination number of a tree in terms of the order and maximum degree is proved and shown to be asymptotically tight. It is shown that for every k, there is a tree T with (γg(T),γg′(T))=(k,k+1) and conjectured that there is none with (γg(T),γg′(T))=(k,k−1). A relation between the game domination number of a graph and its spanning subgraphs is considered. It is proved that there exist 3-connected graphs G having a 2-connected spanning subgraph H such that the game domination number of H is arbitrarily smaller than that of G. Similarly, for any integer ℓ≥1, there exists a graph G and a spanning tree T such that γg(G)−γg(T)≥ℓ. On the other hand, there exist graphs G such that the game domination number of any spanning tree of G is arbitrarily larger than that of G.

Is the high-involvement worker precarious or opportunistic? Hierarchical ambiguities in late capitalism

This article addresses the recent trend in critical organization theory and sociological literature to regard employees in creative and high-involvement work as precarious. It does so by tapping into the perennial debate about control and ambiguity in organization studies. Its main contribution is to expand the focus on workers as objects of control to exercisers of control. Drawing on ethnographic material from the creative knowledge work sector, the article argues that structural and discursive developments in late capitalism generate a specific form of ambiguity which is mobilized by both managers and employees in attempts to exploit and control the counterpart. Through careful analysis of hierarchical interactions, it shows how it is highly contextual whether managers or employees come out as ‘winners’ in the game of influence and domination. This means that the study of worker precariousness needs to be combined with the study of its flip side, namely worker opportunism.

Extremal Problems for Game Domination Number

In the domination game on a graph $G$, two players called Dominator and Staller alternately select vertices of $G$. Each vertex chosen must strictly increase the number of vertices dominated; the game ends when the chosen set becomes a dominating set of $G$. Dominator aims to minimize the size of the resulting dominating set, while Staller aims to maximize it. When both players play optimally, the size of the dominating set produced is the game domination number of $G$, denoted by $\gamma_g(G)$ when Dominator plays first and by $\gamma_g^\prime(G)$ when Staller plays first. We prove that $\gamma_g(G) \le 7n/11$ when $G$ is an isolate-free $n$-vertex forest and that $\gamma_g(G) \le \left\lceil7n/10\right\rceil$ for any isolate-free $n$-vertex graph. In both cases we conjecture that $\gamma_g(G) \le 3n/5$ and prove it when $G$ is a forest of nontrivial caterpillars. We also resolve conjectures of Bresar, Klavžar, and Rall by showing that always $\gamma_g^\prime(G)\le\gamma_g(G)+1$, that for $k\ge2$ there a...

A campanha presidencial televisiva de Lula em 2006 revista desde a didática da história

Discute-se o papel da propaganda política televisiva no processo de ensino e aprendizagem de História, através dos processos de resgate e reforço de símbolos e ideias referentes às representações identitárias e história político-social do Brasil, mobilizadas para a construção de projetos de poder. Trata-se, portanto, de um estudo que pretende contribuir para o conhecimento das relações entre os aspectos formais/escolares e os aspectos não-formais/ extra-escolares do ensino e aprendizagem da História. Parte-se do referencial teórico da Didática da História, que tem na consciência histórica o seu conceito principal (cf. J. Rüsen, K. Jeissman, P. Seixas e outros). A metodologia consiste, além dos instrumentais de análise das mensagens televisivas (sobretudo R. Barthes), na identificação e análise das narrativas e /ou "histórias ultracurtas" presentes no discurso político, capazes de ativar elementos do imaginário e da memória coletiva a serviço de fins imediatos. A conclusão preliminar é a circularidade entre o ensino - aprendizado escolar e as mensagens midiáticas, contribuindo para a compreensão da interdependência e jogos de dominação entre essas esferas.

Realizations of the game domination number

Domination game is a game on a finite graph which includes two players. First player, Dominator, tries to dominate a graph in as few moves as possible; meanwhile the second player, Staller, tries to hold him back and delay the end of the game as long as she can. In each move at least one additional vertex has to be dominated. The number of all moves in the game in which Dominator makes the first move and both players play optimally is called the game domination number and is denoted by $$\gamma _g$$ . The total number of moves in a Staller-start game is denoted by $$\gamma _g^{\prime }$$ . It is known that $$|\gamma _g(G)-\gamma _g^{\prime }(G)|\le 1$$ for any graph $$G$$ . Graph $$G$$ realizes a pair $$(k,l)$$ if $$\gamma _g(G)=k$$ and $$\gamma _g^{\prime }(G)=l$$ . It is shown that pairs $$(2k,2k-1)$$ for all $$k\ge 2$$ can be realized by a family of 2-connected graphs. We also present 2-connected classes which realize pairs $$(k,k)$$ and $$(k,k+1)$$ . Exact game domination number for combs and 1-connected realization of the pair $$(2k+1,2k)$$ are also given.

Mobile gaming: Industry challenges and policy implications

Mobile games are a prime example of a successful mobile application and demonstrate the increasing range of platforms for the media and entertainment industries. Against this convergent background, this paper introduces the basic features of the mobile gaming market and its industrial ecosystem together with its main actors and activities. The focus of the paper lies in the challenges ahead for the evolution of mobile applications into a potentially dominant game platform and the possible disruptions along this road. The deep personal relationships between users and their mobile devices are considered to further explore the link between mobile games, players’ strategies and pending techno-economic developments. The paper concludes with a brief discussion of some policy options to assist with the development of this domain.

Proof of a conjecture on game domination

AbstractThe game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{D}}$\end{document}, orient the edges of the graph alternately until all edges are oriented. Player \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{D}}$\end{document} starts the game, and his goal is to decrease the domination number of the resulting digraph, while \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} is trying to increase it. The game domination number of the graph G, denoted by γg(G), is the domination number of the directed graph resulting from this game. This is well defined if we suppose that both players follow their optimal strategies. Alon et al. (Discrete Math 256 (2002), 23–33) conjectured that, if both G and \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}$\overline{G}$\end{document} are connected graphs with n vertices, then \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}$\gamma_{g}(G)+\gamma_{g}(\overline{G})\le\frac{2}{3}{n}+{3}$\end{document}. In this paper we prove that this conjecture is true for n⩾41. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 323–329, 2010

RL-DOT: A Reinforcement Learning NPC Team for Playing Domination Games

In this paper, we describe the design of reinforcement-learning-based domination team (RL-DOT), a nonplayer character (NPC) team for playing Unreal Tournament (UT) Domination games. In RL-DOT, there is a commander NPC and several soldier NPCs. The running process of RL-DOT consists of several decision cycles. In each decision cycle, the commander NPC makes a decision of troop distribution and, according to that decision, sends action orders to other soldier NPCs. Each soldier NPC tries to accomplish its task in a goal-directed way, i.e., decomposing the final ultimate task (attacking or defending a domination point) into basic actions (such as running and shooting) that are directly supported by UT application programming interfaces (APIs). We use a Q-learning-style algorithm to learn the optimal decision-making policy. We carefully choose some opponent policies for our illustrative experiments. In these experiments, RL-DOT shows a distinct learning characteristic, which illustrates its efficiency in playing UT Domination games.

Domination Game and an Imagination Strategy

The domination game played on a graph G consists of two players, Dominator and Staller, who alternate taking turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay the process as much as possible. The game domination number $\gamma_g(G)$ (resp., $\gamma_g'(G)$) is the number of vertices chosen when Dominator (resp., Staller) starts the game. An imagination strategy is developed as a general tool for proving results on the domination game. We show that for any graph G, $\gamma(G)\leq\gamma_g(G)\leq2\gamma(G)-1$, and that all possible values can be realized. It is proved that for any graph G, $\gamma_g(G)-1\leq\gamma'_g(G)\leq\gamma_g(G)+2$, and that most of the possibilities for mutual values of $\gamma_g(G)$ and $\gamma_g'(G)$ can be realized. A connection with Vizing's conjecture is established, and a lower bound on the game domination number of an arbitrary Cartesian product is proved. Several problems and conjectures are also stated.

On domination game analysis for microeconomic data mining

Game theory is a powerful tool for analyzing the competitions among manufacturers in a market. In this article, we present a study on combining game theory and data mining by introducing the concept of domination game analysis. We present a multidimensional market model, where every dimension represents one attribute of a commodity. Every product or customer is represented by a point in the multidimensional space, and a product is said to “dominate” a customer if all of its attributes can satisfy the requirements of the customer. The expected market share of a product is measured by the expected number of the buyers in the customers, all of which are equally likely to buy any product dominating him. A Nash equilibrium is a configuration of the products achieving stable expected market shares for all products. We prove that Nash equilibrium in such a model can be computed in polynomial time if every manufacturer tries to modify its product in a round robin manner. To further improve the efficiency of the computation, we also design two algorithms for the manufacturers to efficiently find their best response to other products in the market.

Violence and the Arts of Resistance: An Expedition in Critical Communicology

In this article, the author reviews conceptions of symbolic violence, especially that developed by Pierre Bourdieu, and argues that there are dimensions of the symbolic that are left unaccounted for by the idea that such violence is “gentle,” “quiet,” and “mitigated.” Group forms of communication under authoritarian and semiauthoritarian conditions of existence are drawn upon to show how traces of physical violence are lived and how forms of symbolic violence are conscious experiences for perpetrators and victims. Correlatively, opacity rather than absolute transparency of meaning marks effective resistance under such constraints—that is, emancipatory potential is not necessarily contingent on raising the normative bar but on foiling the dominant other's game in singular instances. Violence is understood here as both multivocal and redirectable, with those who resist using whatever means are available to counter actual and potential violation. The task for the critical communicologist is to take up gradations between and among forms of violence, as embedded in everyday practices and inscribed on human bodies and psyches, and to identify efficacious modes of resistance that illustrate the courage and subtle tactics of persons and groups who refuse subjugation. The author provides for such an analysis based on his fieldwork in Morocco.

Culture and Business of PC Bangs in Korea

In this article, the culture and business of PC bangs in Korea are explored. Once just a convenient spot for high-speed connection, the PC bang has become a space for nurturing online gaming cultures. This article addresses two central characteristics of PC bang that have ensured its success. First, the paper explores the social and cultural dimensions of the PC bang as a space that nurtures the negotiation of offline and online relationships around online gaming cultures in Korea. Second, the paper discusses the role PC bangs play in the emergence of online games as a dominant game genre for Korean players. On the business side, a specialized pricing policy for PC bangs has made a vibrant business environment both for game publishers and PC bangs. Recent introduction of a micropayment business model, however, could be read as the demise of game publishers and PC bangs' synergies.

PC bang Inc.: The Culture and Business of PC bangs in Korea

In the world of online gaming world, South Korea (henceforth Korea) is undoubtedly the Mecca. With a vibrant burgeoning industry fuelled by the mainstream position of gaming in urban everyday life, Korea has gained much interest from the global gaming world. One of the dominant phenomena associated with the rise of Korean online gaming is unquestioning the PC bang (PC room). In this paper, I will explore the culture and business of PC bang in Korea. Once just a convenient spot for high-speed connection, the PC bang has become a space for facilitating and nurturing online gaming cultures. This paper will address the two central characteristics of PC bang that have ensured its success. Firstly, the paper will explore the social, cultural and economic dimensions of the PC bang as a space that nurtures the negotiation of offline and online relationships around online gaming cultures in Korea. Secondly, the paper will then discuss the role PC bangs play in the emergence of massively multi-players online role-playing games (MMORPG) as a dominant game genre for Korean players. The rise and success of Korean online gaming through PC bangs is not just socio-cultural but, rather, linked into highly organized business collaborations and coordination between PC bangs and game publishers. A specialized pricing policy for PC bangs - differing from an ordinary flat subscription - has made a robust and vibrant business environment both for game publishers and PC bangs. However this could all be part of the past. Recently, transformations in the industry--most notably the introduction of a micro-payment business model of free-to-play online games--could be read as the demise of game publishers and PC bangs synergies. Will this modification undermine the pivotal role of the PC bang in Korean gaming cultures and industry?

BALANCEDNESS AND CONCAVITY OF FRACTIONAL DOMINATION GAMES

In this paper, we introduce a fractional domination game arising from fractional domination problems on graphs and focus on its balancedness and concavity. We first characterize the core of the fractional domination game and show that its core is always non-empty taking use of dual theory of linear programming. Furthermore we study concavity of this game.

Around Wythoff's game

Abstract Derived from the game of Nim, we present well-known Wythoff's game as a special case of two “larger” types of combinatorial games: • The domination game. We explain that lots of combinatorial games can be con sidered as domination games on a specific graph (called the move-graph). • The three-vectors game. It has been constructed as a geometrical extension of Wythoff's game. We give the sets of losing positions of this game in several cases.