837 resultados para Singing games.
Resumo:
Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics and equilibrium: essays in honor to D. Gale, 1992). That paper introduces the innovation of treating as multi-dimensional the payoff of a player with a quota greater than one. This is done for the many-to-many matching model with additively separable utilities, for which the stability concept is defined. It is then proved, via linear programming, that the set of stable outcomes is nonempty and it may be strictly bigger than the set of dual solutions and strictly smaller than the core. The present paper defines a general concept of stability and shows that this concept is a natural solution concept, stronger than the core concept, for a much more general coalitional game than a matching game. Instead of mutual agreements inside partnerships, the players are allowed to make collective agreements inside coalitions of any size and to distribute his labor among them. A collective agreement determines the level of labor at which the coalition operates and the division, among its members, of the income generated by the coalition. An allocation specifies a set of collective agreements for each player.
Resumo:
A stable matching rule is used as the outcome function for the Admission game where colleges behave straightforwardly and the students` strategies are given by their preferences over the colleges. We show that the college-optimal stable matching rule implements the set of stable matchings via the Nash equilibrium (NE) concept. For any other stable matching rule the strategic behavior of the students may lead to outcomes that are not stable under the true preferences. We then introduce uncertainty about the matching selected and prove that the natural solution concept is that of NE in the strong sense. A general result shows that the random stable matching rule, as well as any stable matching rule, implements the set of stable matchings via NE in the strong sense. Precise answers are given to the strategic questions raised.
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:
Parrondo's paradox arises when two losing games are combined to produce a winning one. A history-dependent quantum Parrondo game is studied where the rotation operators that represent the toss of a classical biased coin are replaced by general SU(2) operators to transform the game into the quantum domain. In the initial state, a superposition of qubits can be used to couple the games and produce interference leading to quite different payoffs to those in the classical case. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
In this text, we intend to explore augmented reality as a means to visualise interactive communication projects. With ARToolkit, Virtools and 3ds Max applications, we aim to show how to create a portable interactive platform that resorts to the environment and markers for constructing the game’s scenario. We plan to show that the realism of simulation, together with the merger of artificial objects with the real world, can generate interactive empathy between players and their avatars.
Resumo:
Neste artigo argumenta-se que as simulações numéricas fomentam e exploram relações complexas entre o jogador e o sistema cibernético da máquina que com este se relaciona através da jogabilidade, ou seja, da real aplicação às regras de jogo de tácticas e estratégias usadas pelo participante durante o seu trajecto na aplicação lúdica. Considera-se que o espaço mágico imposto pelo tabuleiro de jogo é mais do que um espaço de confusão entre real e artificial mas antes se apresenta como uma cortina ou interface entre o corpo próprio do participante e a simulação digital inerente ao sistema computacional.
Resumo:
In sport there is a great need to obtain as much information as possible about the factors which affect the dynamics of play. This study uses sequential analysis and temporal patterns (T-patterns)to examine the evolution of defence (against an equal number of attackers)as used by the Spanish handball team at the Beijing 2008 Olympic Games. The aim is to help handball coaches (during their training and gathering of professional experience)to understand the importance of the structure of defensive systems. This can be achieved through observational processes that reveal the evolution and adaptation of these defensive systems according to different variables: the match score, the response of the opposing team and progress through the tournament.
Resumo:
Mestrado, Educação Pré-Escolar e Ensino do 1º Ciclo do Ensino Básico, 12 de Dezembro de 2011, Universidade dos Açores (Relatório de Estágio).