Search results for "Game"

Educar jugando y dialogando. Derechos de la infancia, intencionalidad, familia y lenguaje

2019

[EN] The article reviews the rights that contribute to the achievement of a happy life from childhood and seizes on the key elements that seek dignity in order to develop happiness. First, the role of the family in setting up personal identity and security, and in establishing personal relationships. Second, the integral personal training and the education in the development of the critical sense and freedom for responsible exercise, as well as the ability to understand, express and communicate to improve or overcome problematic situations. Finally, gambling, as a basic tool of enjoyment in childhood, and, at the same time, learning in the two previous domains, sometimes unique complement o…

Group-level analysis on multiplayer game collaboration: how do the individuals shape the group interaction?

2010

In this study, the aim was to examine how small-group collaboration is shaped by individuals interacting in a virtual multiplayer game. The data were collected from a design experiment in which six randomly divided groups of four university students played a voice-enhanced game lasting about 1 h. The ‘eScape’ game was a social action adventure developed as a part of the study. In the analysis of the video data, students' discourse functions during the game were analysed with content analytic methods for studying the nature of their interaction. An effort was made to analyse the data on both group and individual levels, and therefore the participants' prior social ties and experience in gami…

Infinite games and chain conditions

2015

We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are special cases: 1) every linearly ordered topological space satisfying the game-theoretic version of the countable chain condition is separable and 2) in every compact space satisfying the game-theoretic version of the weak Lindel\"of property, every cover by $G_\delta$ sets has a continuum-sized subcollection whose union is $G_\delta$-dense.

Analytic solution for a class of discrete-time Riccati equations arising in Nash games

1990

Claws contained in all n-tournaments

1993

Abstract We prove that any claw of order n with degree d≤ 3 8 n is n-unavoidable, which means that any tournament of order n contains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.

On symmetric nonlocal games

2013

Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.

Graph connectivity and monadic NP

2002

Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadi…

About Aczél Inequality and Some Bounds for Several Statistical Indicators

2020

In this paper, we will study a refinement of the Cauchy&ndash

Balls into non-uniform bins

2014

Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…

On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian

2012

Abstract This paper concerns the best Lipschitz extension problem for a discrete distance that counts the number of steps. We relate this absolutely minimizing Lipschitz extension with a discrete ∞-Laplacian problem, which arises as the dynamic programming formula for the value function of some e -tug-of-war games. As in the classical case, we obtain the absolutely minimizing Lipschitz extension of a datum f by taking the limit as p → ∞ in a nonlocal p -Laplacian problem.