975 resultados para games technology


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper provides experimental evidence on how players predict end game effects in a linear public good game. Our regression analysis yields a measure of the relative importance of priors and signals on subjects\' beliefs on contributions and allow us to conclude that, firstly, the weight of the signal is relatively unimportant, while priors have a large weight and, secondly, priors are the same for all periods. Hence, subjects do not expect end game effects and there is very little updating of beliefs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We characterize a monotonic core concept defined on the class of veto balanced games. We also discuss what restricted versions of monotonicity are possible when selecting core allocations. We introduce a family of monotonic core concepts for veto balanced games and we show that, in general, the nucleolus per capita is not monotonic.

Relevância:

20.00% 20.00%

Publicador:

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.

Relevância:

20.00% 20.00%

Publicador:

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.