Nash Demand Game and the Kalai-Smorodinsky Solution

We introduce two new variations on the Nash demand game. One, like all known Nash-like demand games so far, has the Nash solution outcome as its equilibrium outcome. In the other, the range of solutions depends on an exogenous breakdown probability; surprisingly, the Kalai-Smorodinsky outcome proves to be the most robust equilibrium outcome. While the Kalai- Smorodinsky solution always finishes on top, there is no possible general ranking among the remaining solution concepts considered; in fact, the rest of the solution concepts take their turns at the bottom at various bargaining problems, depending on the specifics of the bargaining setup.

Divide-the-Dollar game revisited

In the Divide-the-Dollar (DD) game, two players simultaneously make demands to divide a dollar. Each player receives his demand if the sum of the demands does not exceed one, a payoff of zero otherwise. Note that, in the latter case, both parties are punished severely. A major setback of DD is that each division of the dollar is a Nash equilibrium outcome. Observe that, when the sum of the two demands x and y exceeds one, it is as if Player 1's demand x (or his offer (1−x) to Player 2) suggests that Player 2 agrees to λx < 1 times his demand y so that Player 1's demand and Player 2's modified demand add up to exactly one; similarly, Player 2's demand y (or his offer (1−y) to Player 1) suggests that Player 1 agrees to λyx so that λyx+y = 1. Considering this fact, we change DD's payoff assignment rule when the sum of the demands exceeds one; here in this case, each player's payoff becomes his demand times his λ; i.e., each player has to make the sacrifice that he asks his opponent to make. We show that this modified version of DD has an iterated strict dominant strategy equilibrium in which each player makes the egalitarian demand 1/2. We also provide a natural N-person generalization of this procedure.

Asymmetric Nash bargaining solutions: a simple Nash program

This article proposes a simple Nash program. Both our axiomatic characterization and our noncooperative procedure consider each distinct asymmetric and symmetric Nash solution. Our noncooperative procedure is a generalization of the simplest known sequential Nash demand game analyzed by Rubinstein etal. (1992). We then provide the simplest known axiomatic characterization of the class of asymmetric Nash solutions, in which we use only Nash's crucial Independence of Irrelevant Alternatives axiom and an asymmetric modification of the well-known Midpoint Domination axiom.

Reproduction game demo

An 8 screen stereoscopic 3D Multi-user environment set in a circular formation. Paticipants are tracked by 8 kinect sensors as they move around the 360 degree installation. Participants inherit a species upon entering. Artificial Life based entities cluster towards the human particpants of their species and their songs evolve according to the interactions.

A location game on disjoint circles

Two players are endowed with resources for setting up N locations on K identical circles, with N > K < 1. The players alternately choose these locations (possibly in batches of more than one in each round) in order to secure the area closer to their locations than that of their rival's. They face a resource mobility constraint such that not all N locations can be placed in the first round. The player with the highest secured area wins the game and otherwise the game ends in a tie. Earlier research has shown that for K = 1, the second mover always has a winning strategy in this game. In this paper we show that with K > 1, the second mover advantage disappears as in this case both players have a tying strategy. We also study a natural variant of this game where the resource mobility constraint is more stringent so that in each round each player chooses a single location where we show that the second mover advantage re-appears. We suggest some Nash equilibrium configurations of locations in both versions of the game.

A game-theoretic resource allocation approach for intercell device-to-device communications in cellular networks

Device-to-Device (D2D) communication is a recently emerged disruptive technology for enhancing the performance of current cellular systems. To successfully implement D2D communications underlaying cellular networks, resource allocation to D2D links is a critical issue, which is far from trivial due to the mutual interference between D2D users and cellular users. Most of the existing resource allocation research for D2D communications has primarily focused on the intracell scenario while leaving the intercell settings not considered. In this paper, we investigate the resource allocation issue for intercell scenarios where a D2D link is located in the overlapping area of two neighboring cells. Specifically, We present three intercell D2D scenarios regarding the resource allocation problem. To address the problem, we develop a repeated game model under these scenarios. Distinct from existing works, we characterize the communication infrastructure, namely Base Stations (BSs), as players competing resource allocation quota from D2D demand, and we define the utility of each player as the payoff from both cellular and D2D communications using radio resources. We also propose a resource allocation algorithm and protocol based on the Nash equilibrium derivations. Numerical results indicate that the developed model not only significantly enhances the system performance including sum rate and sum rate gain, but also sheds lights on resource configurations for intercell D2D scenarios.

Strategies to develop divided attention skills through video game training

Research .over the past two decades has confirmed the learning opportunities that video games can offer. The objectives of the current study were to investigate the ability of video games to enhance divided attention skills and compare these skills based on individuals' level of expertise in video game playing. Female participants aged between 17-25 years categorised as experts or novices, were divided into experimental and control groups. All participants completed the pre and post-test of divided attention between which only the experimental group received video game training. Results indicate that participants who received video game practice achieved an increase in their dual-attention skills compared to those who did not receive any training, with novices displaying a greater
enhancement in perfonnance. Implications include the provision of video game training to enhance divided attention skills in air pilot training, driving, and heavyequipment operation apart from other tasks necessitating dual-task efficiency.

Validity and reliability of a voice-recognition game analysis system for field sports

The purpose of this study was to assess the ability of observers to use voice-recognition analysis to accurately classify gait transitions and quantify gait durations typical of team games. Inter-rater and intra-rater reliability was also determined. Four males were filmed performing pre-determined gait protocols, each comprising different sequences of walking, jogging. running and sprinting. Two operators independently classified gait transitions and the time spent in each gait was determined by the voice recognition system. All gait modes as measured by trained observers demonstrated statistically significant correlations (p<O.O I) to predetermined measurement criteria. The mean absolute error for all gait transitions was less than half a second (0.32-0.36 5) with the maximum percentage error being approximately 4% for the walk, jog and run gaits and 10% for sprinting. Gait classification error was low at 1-9%. The intra-rater and inter-rater reliability was consistently high ranging from r =' 0.87 to 0.99. In conclusion, observers using voice-recognition software provided valid measures of time spent in each of the four gait categories with 90% or better accuracy achieved.

Game geek's goss: linguistic creativity in young males within an online university forum (94/\/\3 933k’5 9055oneone)

In this paper the authors explore the use and adaptation of a language specifically developed for, and by, a community of young people who play computer games. Leet speak or 1337 5p34k, the language used by the participants in this study, incorporates symbols and numbers as substitutes for the letters contained in words. Described by the group as an ‘elite’ language or ‘leet speak’, the authors’ interest was captured by the derisive and ironic use of the language in an online forum for a tertiary first year unit of study. Rather than merely defining its participants within an elite cultural boundary, ‘leet speak’ is utilised ironically to unearth ‘wannabees’ (those seeking entrance and acceptance into the game world, generally 12 –16 year olds). Of particular fascination to the authors was that despite the clear self- demarcation of the group from the users of ‘leet speak’, and their insistence on its use solely by ‘newbs and wannabees’, the group continued to use the language to communicate with each other online. In this research, language defines the cultural group of games technology students in terms of the group’s continual subversion of the language’s very foundations whilst still using it to communicate. Perhaps most interesting was the group’s nonchalant admission that they perceived this to be the function of all languages ‘all languages are created purely for communication so dont [sic] have a cry about ppl been [sic] lazy’.