21,716 research outputs found
Evaluating Singleplayer and Multiplayer in Human Computation Games
Human computation games (HCGs) can provide novel solutions to intractable
computational problems, help enable scientific breakthroughs, and provide
datasets for artificial intelligence. However, our knowledge about how to
design and deploy HCGs that appeal to players and solve problems effectively is
incomplete. We present an investigatory HCG based on Super Mario Bros. We used
this game in a human subjects study to investigate how different social
conditions---singleplayer and multiplayer---and scoring
mechanics---collaborative and competitive---affect players' subjective
experiences, accuracy at the task, and the completion rate. In doing so, we
demonstrate a novel design approach for HCGs, and discuss the benefits and
tradeoffs of these mechanics in HCG design.Comment: 10 pages, 4 figures, 2 table
Cooperation and Contagion in Web-Based, Networked Public Goods Experiments
A longstanding idea in the literature on human cooperation is that
cooperation should be reinforced when conditional cooperators are more likely
to interact. In the context of social networks, this idea implies that
cooperation should fare better in highly clustered networks such as cliques
than in networks with low clustering such as random networks. To test this
hypothesis, we conducted a series of web-based experiments, in which 24
individuals played a local public goods game arranged on one of five network
topologies that varied between disconnected cliques and a random regular graph.
In contrast with previous theoretical work, we found that network topology had
no significant effect on average contributions. This result implies either that
individuals are not conditional cooperators, or else that cooperation does not
benefit from positive reinforcement between connected neighbors. We then tested
both of these possibilities in two subsequent series of experiments in which
artificial seed players were introduced, making either full or zero
contributions. First, we found that although players did generally behave like
conditional cooperators, they were as likely to decrease their contributions in
response to low contributing neighbors as they were to increase their
contributions in response to high contributing neighbors. Second, we found that
positive effects of cooperation were contagious only to direct neighbors in the
network. In total we report on 113 human subjects experiments, highlighting the
speed, flexibility, and cost-effectiveness of web-based experiments over those
conducted in physical labs
Living and Learning With New Media: Summary of Findings From the Digital Youth Project
Summarizes findings from a three-year study of how new media have been integrated into youth behaviors and have changed the dynamics of media literacy, learning, and authoritative knowledge. Outlines implications for educators, parents, and policy makers
Optimal configuration of active and backup servers for augmented reality cooperative games
Interactive applications as online games and mobile devices have become more and more popular in recent years. From their combination, new and interesting cooperative services could be generated. For instance, gamers endowed with Augmented Reality (AR) visors connected as wireless nodes in an ad-hoc network, can interact with each other while immersed in the game. To enable this vision, we discuss here a hybrid architecture enabling game play in ad-hoc mode instead of the traditional client-server setting. In our architecture, one of the player nodes also acts as the server of the game, whereas other backup server nodes are ready to become active servers in case of disconnection of the network i.e. due to low energy level of the currently active server. This allows to have a longer gaming session before incurring in disconnections or energy exhaustion. In this context, the server election strategy with the aim of maximizing network lifetime is not so straightforward. To this end, we have hence analyzed this issue through a Mixed Integer Linear Programming (MILP) model and both numerical and simulation-based analysis shows that the backup servers solution fulfills its design objective
Fixation and escape times in stochastic game learning
Evolutionary dynamics in finite populations is known to fixate eventually in
the absence of mutation. We here show that a similar phenomenon can be found in
stochastic game dynamical batch learning, and investigate fixation in learning
processes in a simple 2x2 game, for two-player games with cyclic interaction,
and in the context of the best-shot network game. The analogues of finite
populations in evolution are here finite batches of observations between
strategy updates. We study when and how such fixation can occur, and present
results on the average time-to-fixation from numerical simulations. Simple
cases are also amenable to analytical approaches and we provide estimates of
the behaviour of so-called escape times as a function of the batch size. The
differences and similarities with escape and fixation in evolutionary dynamics
are discussed.Comment: 19 pages, 9 figure
- …