835 resultados para Games with music.
Resumo:
The present study used a temporal bisection task to investigate whether music affects time estimation differently from a matched auditory neutral stimulus, and whether the emotional valence of the musical stimuli (i.e., sad vs. happy music) modulates this effect. The results showed that, compared to sine wave control music, music presented in a major (happy) or a minor (sad) key shifted the bisection function toward the right, thus increasing the bisection point value (point of subjective equality). This indicates that the duration of a melody is judged shorter than that of a non-melodic control stimulus, thus confirming that ""time flies"" when we listen to music. Nevertheless, sensitivity to time was similar for all the auditory stimuli. Furthermore, the temporal bisection functions did not differ as a function of musical mode. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
We examine a problem with n players each facing the same binary choice. One choice is superior to the other. The simple assumption of competition - that an individual's payoff falls with a rise in the number of players making the same choice, guarantees the existence of a unique symmetric equilibrium (involving mixed strategies). As n increases, there are two opposing effects. First, events in the middle of the distribution - where a player finds itself having made the same choice as many others - become more likely, but the payoffs in these events fall. In opposition, events in the tails of the distribution - where a player finds itself having made the same choice as few others - become less likely, but the payoffs in these events remain high. We provide a sufficient condition (strong competition) under which an increase in the number of players leads to a reduction in the equilibrium probability that the superior choice is made.
Resumo:
This article is a short introduction on how to use Modellus (a computer package that is freely available on the Internet and used in the IOP Advancing Physics course) to build physics games using Newton’s laws, expressed as differential equations. Solving systems of differential equations is beyond most secondary-school or first-year college students. However, with Modellus, the solution is simply the output of the usual physical reasoning: define the force law, compute its magnitude and components, use it to obtain the acceleration components, then the velocity components and, finally, use the velocity components to find the coordinates.
Resumo:
We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.
Resumo:
We consider cooperative environments with externalities (games in partition function form) and provide a recursive definition of dividends for each coalition and any partition of the players it belongs to. We show that with this definition and equal sharing of these dividends the averaged sum of dividends for each player, over all the coalitions that contain the player, coincides with the corresponding average value of the player. We then construct weighted Shapley values by departing from equal division of dividends and finally, for each such value, provide a bidding mechanism implementing it.
Resumo:
We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We use two 4 x 4 games each with a unique mixed Nash equilibrium; one is stable and one is unstable under learning. Both games are versions of Rock-Paper-Scissors with the addition of a fourth strategy, Dumb. Nash equilibrium places a weight of 1/2 on Dumb in both games, but the TASP places no weight on Dumb when the equilibrium is unstable. We also vary the level of monetary payoffs with higher payoffs predicted to increase instability. We find that the high payoff unstable treatment differs from the others. Frequency of Dumb is lower and play is further from Nash than in the other treatments. That is, we find support for the comparative statics prediction of learning theory, although the frequency of Dumb is substantially greater than zero in the unstable treatments.
Resumo:
Two logically distinct and permissive extensions of iterative weak dominance are introduced for games with possibly vector-valued payoffs. The first, iterative partial dominance, builds on an easy-to check condition but may lead to solutions that do not include any (generalized) Nash equilibria. However, the second and intuitively more demanding extension, iterative essential dominance, is shown to be an equilibrium refinement. The latter result includes Moulin’s (1979) classic theorem as a special case when all players’ payoffs are real-valued. Therefore, essential dominance solvability can be a useful solution concept for making sharper predictions in multicriteria games that feature a plethora of equilibria.
Resumo:
The objective of this paper is to re-examine the risk-and effort attitude in the context of strategic dynamic interactions stated as a discrete-time finite-horizon Nash game. The analysis is based on the assumption that players are endogenously risk-and effort-averse. Each player is characterized by distinct risk-and effort-aversion types that are unknown to his opponent. The goal of the game is the optimal risk-and effort-sharing between the players. It generally depends on the individual strategies adopted and, implicitly, on the the players' types or characteristics.
Resumo:
We consider environments in which agents can cooperate on multiple issues and externalities are present both within and across issues. We propose a way to extend (Shapley) values that have been put forward to deal with externalities within issues to games where there are externalities within and across issues. We characterize our proposal through axioms that extend the Shapley axioms to our more general environment.
Resumo:
Gifted children develop asynchronously, often advanced for their age cognitively, but at or between their chronological and mental ages socially and emotionally (Robinson, 2008). In order to help gifted children and adolescents develop and practice social and emotional self-regulation skills, we investigated the use of an Adlerian play therapy approach during pen-and-paper role-playing games. Additionally, we used Goffman's (1961, 1974) social role identification and distance to encourage participants to experiment with new identities. Herein, we propose a psychosocial model of interactions during role-playing games based on Goffman's theory and Adlerian play therapy techniques, and suggest that role-playing games are an effective way of intervening with gifted children and adolescents to improve their intra- and interpersonal skills. We specifically targeted intrapersonal skills of exercising creativity, becoming self-aware, and setting individual goals by raising participants' awareness of their privately logical reasons for making decisions and their levels of social interest. We also targeted their needs and means of seeking significance in the group to promote collaboration and interaction skills with other gifted peers through role analysis, embracement, and distancing. We report results from a case study and conclude that role-playing games deserve more attention, both from researchers and clinical practitioners, because they encourage change while improving young clients' social and emotional development.
Resumo:
Payoff heterogeneity weakens positive feedback in binary choice models intwo ways. First, heterogeneity drives individuals to corners where theyare unaffected by strategic complementarities. Second, aggregate behaviouris smoother than individual behaviour when individuals are heterogeneous.However, this smoothing does not necessarily eliminate positive feedbackor guarantee a unique equilibrium. In games with an unbounded, continuouschoice space, heterogeneity may either weaken or strengthen positive feedback,depending on a simple convexity/concavity condition. We conclude that positivefeedback phenomena derived in representative agent models will often be robustto heterogeneity.
Resumo:
Experiments in which subjects play simultaneously several finite prisoner's dilemma supergames with and without an outside optionreveal that: (i) subjects use probabilistic start and endeffect behaviour, (ii) the freedom to choose whether to play the prisoner's dilemma game enhances cooperation, (iii) if the payoff for simultaneous defection is negative, subjects' tendency to avoid losses leads them to cooperate; while this tendency makes them stick to mutual defection if its payoff is positive.
Resumo:
En aquest treball presentem dues caracteritzacions de dos valors diferents en el marc dels jocs coalicionals amb cooperació restringida. Les restriccions són introduïdes com una seqüència finita de particions del conjunt del jugadors, de manera que cada una d'elles eés més grollera que l'anterior, formant així una estructura amb diferents nivells d'unions a priori.
Resumo:
There exist coalitional games with transferable utility which have the same core but different nucleoli. We show that this cannot happen in the case of assignment games. Whenever two assignment games have the same core, their nucleoli also coincide. To show this, we prove that the nucleolus of an assignment game coincides with that of its buyer-seller exact representative