18 resultados para Games with music.
em Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco
Resumo:
We assume that 2 x 2 matrix games are publicly known and that players perceive a dichotomous characteristic on their opponents which defines two types for each player. In turn, each type has beliefs concerning her opponent's types, and payoffs are assumed to be type-independent. We analyze whether the mere possibility of different types playing different strategies generates discriminatory equilibria. Given a specific information structure we find that in equilibrium a player discriminates between her types if and only if her opponent does so. We also find that for dominant solvable 2x2 games no discriminatory equilibrium exists, while under different conditions of concordance between players' beliefs discrimination appears for coordination and for competitive games. A complete characterization of the set of Bayesian equilibria is provided.
Resumo:
Eguíluz, Federico; Merino, Raquel; Olsen, Vickie; Pajares, Eterio; Santamaría, José Miguel (eds.)
Resumo:
This paper studies an allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or reject, and con ict is solved bilaterally between the rejector and the proposer. We allow the proposer to make sequential proposals over several periods. If responders are myopic maximizers (i.e. consider each period in isolation), the only equilibrium outcome is the serial rule of Arin and Feltkamp (2012) regardless of the order of moves. If all players are farsighted, the serial rule still arises as the unique subgame perfect equilibrium outcome if the order of moves is such that stronger players respond to the proposal after weaker ones.
Resumo:
We study the supercore of a system derived from a normal form game. For the case of a finite game with pure strategies, we define a sequence of games and show that the supercore of that system coincides with the set of Nash equilibrium strategy profiles of the last game in the sequence. This result is illustrated with the characterization of the supercore for the n-person prisoners’ dilemma. With regard to the mixed extension of a normal form game, we show that the set of Nash equilibrium profiles coincides with the supercore for games with a finite number of Nash equilibria. For games with an infinite number of Nash equilibria this need not be no longer the case. Yet, it is not difficult to find a binary relation which guarantees the coincidence of these two sets.
Resumo:
We generalise and extend the work of Iñarra and Laruelle (2011) by studying two person symmetric evolutionary games with two strategies, a heterogenous population with two possible types of individuals and incomplete information. Comparing such games with their classic homogeneous version vith complete information found in the literature, we show that for the class of anti-coordination games the only evolutionarily stable strategy vanishes. Instead, we find infinite neutrally stable strategies. We also model the evolutionary process using two different replicator dynamics setups, each with a different inheritance rule, and we show that both lead to the same results with respect to stability.
Resumo:
In everyday economic interactions, it is not clear whether sequential choices are visible or not to other participants: agents might be deluded about opponents'capacity to acquire,interpret or keep track of data, or might simply unexpectedly forget what they previously observed (but not chose). Following this idea, this paper drops the assumption that the information structure of extensive-form games is commonly known; that is, it introduces uncertainty into players' capacity to observe each others' past choices. Using this approach, our main result provides the following epistemic characterisation: if players (i) are rational,(ii) have strong belief in both opponents' rationality and opponents' capacity to observe others' choices, and (iii) have common belief in both opponents' future rationality and op-ponents' future capacity to observe others' choices, then the backward induction outcome obtains. Consequently, we do not require perfect information, and players observing each others' choices is often irrelevant from a strategic point of view. The analysis extends {from generic games with perfect information to games with not necessarily perfect information{the work by Battigalli and Siniscalchi (2002) and Perea (2014), who provide different sufficient epistemic conditions for the backward induction outcome.
Resumo:
[SPA] Las disciplinas artísticas siempre han sido un campo tan beneficioso como poco utilizado en educación. En esta propuesta de taller de teatro musical en educación primaria se ha indagado en el mundo de la pedagogía teatral y su relación con la música y el juego como técnicas de transmisión de valores y desarrollo de aprendizajes. La puesta en práctica mediante el diseño e implementación de un taller por parte del mediador ha logrado que los alumnos muestren avances significativos en diversos campos como el autoconocimiento corporal o el descubrimiento de nuevos géneros musicales, además de favorecer a la dinámica grupal dentro y fuera del taller. De cara al futuro, este proceso ha abierto las puertas a nuevas propuestas en el ámbito de la dramatización infantil así como al interés formativo del propio educador.
Resumo:
The paper adapts a non cooperative game presented by Dagan, Serrano and Volij (1997) for bankruptcy problems to the context of TU veto balanced games. We investigate the relationship between the Nash outcomes of a noncooperative game and solution concepts of cooperative games such as the nucleolus, kernel and the egalitarian core.
Resumo:
Published as an article in: Games and Economic Behavior, 2003, vol. 44, issue 1, pages 183-194.
Resumo:
This paper proposes a new method for local key and chord estimation from audio signals. This method relies primarily on principles from music theory, and does not require any training on a corpus of labelled audio files. A harmonic content of the musical piece is first extracted by computing a set of chroma vectors. A set of chord/key pairs is selected for every frame by correlation with fixed chord and key templates. An acyclic harmonic graph is constructed with these pairs as vertices, using a musical distance to weigh its edges. Finally, the sequences of chords and keys are obtained by finding the best path in the graph using dynamic programming. The proposed method allows a mutual chord and key estimation. It is evaluated on a corpus composed of Beatles songs for both the local key estimation and chord recognition tasks, as well as a larger corpus composed of songs taken from the Billboard dataset.
Resumo:
We investigate a version of the classic Colonel Blotto game in which individual battles may have different values. Two players allocate a fixed budget across battlefields and each battlefield is won by the player who allocates the most to that battlefield. The winner of the game is the player who wins the battlefields with highest total value. We focus on the case where there is one large and several small battlefields, such that a player wins if he wins the large and any one small battlefield, or all the small battlefields. We compute the mixed strategy equilibrium for these games and compare this with choices from a laboratory experiment. The equilibrium predicts that the large battlefield receives more than a proportional share of the resources of the players, and that most of the time resources should be spread over more battlefields than are needed to win the game. We find support for the main qualitative features of the equilibrium. In particular, strategies that spread resources widely are played frequently, and the large battlefield receives more than a proportional share in the treatment where the asymmetry between battlefields is stronger.
Resumo:
On several classes of n-person NTU games that have at least one Shapley NTU value, Aumann characterized this solution by six axioms: Non-emptiness, efficiency, unanimity, scale covariance, conditional additivity, and independence of irrelevant alternatives (IIA). Each of the first five axioms is logically independent of the remaining axioms, and the logical independence of IIA is an open problem. We show that for n = 2 the first five axioms already characterize the Shapley NTU value, provided that the class of games is not further restricted. Moreover, we present an example of a solution that satisfies the first five axioms and violates IIA for two-person NTU games (N, V) with uniformly p-smooth V(N).
Resumo:
Ez da arraroa, egungo eskolan, nolabaiteko aukera eza aurkitzea Haur Hezkuntzako haurraren sormena garatzeko. Aukera eza honi erantzuna emateko asmoz sortu da proiektu hau. Hiru bitarteko nagusi uztartzea proposatzen da: alde batetik, musika, sormenaren garapenerako aukera anitz eskaintzen dituelako; bestetik, mugimendua, haurraren garapenen fisiko eta kognitiboan berebiziko garrantzia duen funtzioa; eta, azkenik, jolasa elementu integratzaile bezala, gizakiok haurtzaroan dugun oinarrizko jarduera. Ondoren proposatzen diren jolasak zehazki sortuak, aukeratuak eta moldatuak izan dira sormena era ludikoan garatzeko. Barakaldoko Alkartu Ikastola Publikoan praktikan jarri eta gero, esan dezakegu haurrek ia mugarik gabeko sormena garatu dezaketela, irakasleak bitarteko egokiak eskura jartzen badizkie.
Resumo:
This paper presents a method to generate new melodies, based on conserving the semiotic structure of a template piece. A pattern discovery algorithm is applied to a template piece to extract significant segments: those that are repeated and those that are transposed in the piece. Two strategies are combined to describe the semiotic coherence structure of the template piece: inter-segment coherence and intra-segment coherence. Once the structure is described it is used as a template for new musical content that is generated using a statistical model created from a corpus of bertso melodies and iteratively improved using a stochastic optimization method. Results show that the method presented here effectively describes a coherence structure of a piece by discovering repetition and transposition relations between segments, and also by representing the relations among notes within the segments. For bertso generation the method correctly conserves all intra and inter-segment coherence of the template, and the optimization method produces coherent generated melodies.
Resumo:
The purpose of this study was to compare the effects of Small-Sided Games (SSG) vs. Interval Training (IT) in soccer training on aerobic fitness and physical enjoyment in youth elite soccer players during the last 8 weeks of the season. Seventeen U-16 male soccer players (age = 15.5 +/- 0.6 years, and 8.5 years of experience) of a Spanish First Division club academy were randomized to 2 different groups for 6 weeks: SSG group (n = 9) and IT group (n = 8). In addition to the usual technical and tactical sessions and competitive games, the SSG group performed 11 sessions with different SSGs, whereas the IT group performed the same number of sessions of IT. Players were tested before and after the 6-week training intervention with a continuous maximal multistage running field test and the counter movement jump test (CMJ). At the end of the study, players answered the physical activity enjoyment scale (PACES). During the study, heart rate (HR) and session perceived effort (sRPE) were assessed. SSGs were as effective as IT in maintaining the aerobic fitness in elite young soccer players during the last weeks of the season. Players in the SSG group declared a greater physical enjoyment than IT (P = 0.006; ES = 1.86 +/- 1.07). Coaches could use SSG training during the last weeks of the season as an option without fear of losing aerobic fitness while promoting high physical enjoyment.