77 resultados para Games of chance (Mathematics)
Resumo:
In this article we try to look at the learning of mathematics through games in the first years of schooling. The use of game resources in the class should not be carried out in a uniquely intuitive way but rather in a manner that contains some preliminary reflections such as, what do we understand by games? Why use games as a resource in the Mathematics classroom? And what does its use imply?
Resumo:
In this paper we present a set of axioms guaranteeing that, in exchange economies with or without indivisible goods, the set of Nash, Strong and active Walrasian Equilibria all coincide in the framework of market games.
Resumo:
This text has been published in the book Jocs Olímpics, comunicació i intercanvis culturals: l’experiència dels últims quatre Jocs Olímpics d’estiu, gathering the communications presented in the international Symposium that was celebrated in Barcelona from 3 to 5 april of 1991.
Resumo:
Paper discussing on the impact of the Games on the urban development of host cities, analysing in particular the Barcelona'92 Olympic Village. This article was published in the book entitled "Olympic Villages: a hundred years of urban planning and shared experiences" compiling the papers given at the 1997 International Symposium on International Chair in Olympism (IOC-UAB).
Resumo:
Paper presented at the 2001 seminar of the International Chair in Olympism (IOC-UAB). The seminar offers a general reflection, from the time of the bid onwards, of the 2000 Games experience in Sydney and Australia.
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:
This paper was presented at the International Sport Business Symposium, held by the Capital University of Economics and Business in Beijing, in 2008. The speakers, Ferran Brunet, as a professor at the Autonomous University of Barcelona and Zuo Xinwen, as a member of Beijing Development and Reform Commission, both set out to analyze changes in the economic and social development of the city which were undertaken with the aim to celebrate the 2008 Olympic Games. They discuss aspects as a transformation in the mode of economic growth, resources of the Organizing Committee, investments related to the Games, transport and communications, industries, the balance of urban and rural development, urban construction and management service and operations into a well-off society.
Resumo:
This paper studies the limits of discrete time repeated games with public monitoring. We solve and characterize the Abreu, Milgrom and Pearce (1991) problem. We found that for the "bad" ("good") news model the lower (higher) magnitude events suggest cooperation, i.e., zero punishment probability, while the highrt (lower) magnitude events suggest defection, i.e., punishment with probability one. Public correlation is used to connect these two sets of signals and to make the enforceability to bind. The dynamic and limit behavior of the punishment probabilities for variations in ... (the discount rate) and ... (the time interval) are characterized, as well as the limit payo¤s for all these scenarios (We also introduce uncertainty in the time domain). The obtained ... limits are to the best of my knowledge, new. The obtained ... limits coincide with Fudenberg and Levine (2007) and Fudenberg and Olszewski (2011), with the exception that we clearly state the precise informational conditions that cause the limit to converge from above, to converge from below or to degenerate. JEL: C73, D82, D86. KEYWORDS: Repeated Games, Frequent Monitoring, Random Pub- lic Monitoring, Moral Hazard, Stochastic Processes.
Resumo:
We compare behavior in modified dictator games with and without role uncertainty. Subjectschoose between a selfish action, a costly surplus creating action (altruistic behavior) and acostly surplus destroying action (spiteful behavior). While costly surplus creating actions are themost frequent under role uncertainty (64%), selfish actions become the most frequent withoutrole uncertainty (69%). Also, the frequency of surplus destroying choices is negligible with roleuncertainty (1%) but not so without it (11%). A classification of subjects into four differenttypes of interdependent preferences (Selfish, Social Welfare maximizing, Inequity Averse andCompetitive) shows that the use of role uncertainty overestimates the prevalence of SocialWelfare maximizing preferences in the subject population (from 74% with role uncertainty to21% without it) and underestimates Selfish and Inequity Averse preferences. An additionaltreatment, in which subjects undertake an understanding test before participating in theexperiment with role uncertainty, shows that the vast majority of subjects (93%) correctlyunderstand the payoff mechanism with role uncertainty, but yet surplus creating actions weremost frequent. Our results warn against the use of role uncertainty in experiments that aim tomeasure the prevalence of interdependent preferences.
Resumo:
We examine the effect of unilateral and mutual partner selection in the context of prisoner's dilemmas experimentally. Subjects play simultaneously several finitely repeated two-person prisoner's dilemma games. We find that unilateral choice is the best system. It leads to low defection and fewer singles than with mutual choice. Furthermore, with the unilateral choice setup we are able to show that intendingdefectors are more likely to try to avoid a match than intending cooperators. We compare our results of multiple games with single game PD-experiments and find no difference in aggregate behavior. Hence the multiple game technique is robust and might therefore be an important tool in the future for testing the use of mixed strategies.
Resumo:
Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.
Resumo:
We characterize the prekernel of NTU games by means of consistency,converse consistency, and five axioms of the Nash type on bilateral problems.The intersection of the prekernel and the core is also characterized with thesame axioms over the class of games where the core is nonempty.
Resumo:
We construct a model in which the ambiguity of candidates allows them toincrease the number of voters to whom they appeal when voters have intense preferences for one of the alternatives available. An ambiguous candidate may offer voters with different preferences the hope that their most preferred alternative will be implemented. We find conditions under which ambiguous strategies are chosen in equilibrium. These conditions include the case in which there is an outcome that is a majority winner against all other outcomes but is not the most preferred outcome for a majority of voters. It is shown that if the number of candidates or parties increases, ambiguity will not be possible in equilibrium, but a larger set of possible policies increases the chance that at least one candidate will choose to be ambiguous in equilibrium.
Resumo:
It is shown that in any affine space of payoff matrices the equilibriumpayoffs of bimatrix games are generically finite.