869 resultados para Nash equilibria for discontinuous games
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:
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:
We will call a game a reachable (pure strategy) equilibria game if startingfrom any strategy by any player, by a sequence of best-response moves weare able to reach a (pure strategy) equilibrium. We give a characterizationof all finite strategy space duopolies with reachable equilibria. Wedescribe some applications of the sufficient conditions of the characterization.
Resumo:
This paper explores the relationships between noncooperative bargaining games and the consistent value for non-transferable utility (NTU) cooperative games. A dynamic approach to the consistent value for NTU games is introduced: the consistent vector field. The main contribution of the paper is to show that the consistent field is intimately related to the concept of subgame perfection for finite horizon noncooperative bargaining games, as the horizon goes to infinity and the cost of delay goes to zero. The solutions of the dynamic system associated to the consistent field characterize the subgame perfect equilibrium payoffs of the noncooperative bargaining games. We show that for transferable utility, hyperplane and pure bargaining games, the dynamics of the consistent fields converge globally to the unique consistent value. However, in the general NTU case, the dynamics of the consistent field can be complex. An example is constructed where the consistent field has cyclic solutions; moreover, the finite horizon subgame perfect equilibria do not approach the consistent value.
Resumo:
This paper explores three aspects of strategic uncertainty: its relation to risk, predictability of behavior and subjective beliefs of players. In a laboratory experiment we measure subjects certainty equivalents for three coordination games and one lottery. Behavior in coordination games is related to risk aversion, experience seeking, and age.From the distribution of certainty equivalents we estimate probabilities for successful coordination in a wide range of games. For many games, success of coordination is predictable with a reasonable error rate. The best response to observed behavior is close to the global-game solution. Comparing choices in coordination games with revealed risk aversion, we estimate subjective probabilities for successful coordination. In games with a low coordination requirement, most subjects underestimate the probability of success. In games with a high coordination requirement, most subjects overestimate this probability. Estimating probabilistic decision models, we show that the quality of predictions can be improved when individual characteristics are taken into account. Subjects behavior is consistent with probabilistic beliefs about the aggregate outcome, but inconsistent with probabilistic beliefs about individual behavior.
Resumo:
We propose a simple adaptive procedure for playing a game. In thisprocedure, players depart from their current play with probabilities thatare proportional to measures of regret for not having used other strategies(these measures are updated every period). It is shown that our adaptiveprocedure guaranties that with probability one, the sample distributionsof play converge to the set of correlated equilibria of the game. Tocompute these regret measures, a player needs to know his payoff functionand the history of play. We also offer a variation where every playerknows only his own realized payoff history (but not his payoff function).
Resumo:
We report an experiment on the effect of intergroup competition on group coordination in the minimal-effort game (Van Huyck et al., 1990). The competition was between two 7-person groups. Each player in each group independently chose an integer from 1 to 7. The group with the higher minimum won the competition and each of its members was paid according to the game s original payoff matrix. Members of the losing group were paid nothing. In case of a tie, each player was paid half the payoff in the original matrix. This treatment was contrasted with two control treatments where each of the two groups played an independent coordination game, either with or without information about the minimum chosen by the outgroup. Although the intergroup competition does not change the set of strict equilibria, we found that it improved collective rationality by moving group members in the direction of higher-payoff equilibria. Merely providing group members with information about the minimal-effort level in the other group was not sufficient to generate this effect.
Resumo:
We describe the unusual structure of a vaccinia virus late mRNA. In these molecules, the protein-coding sequences of a major late structural polypeptide are preceded by long leader RNAs, which in some cases are thousands of nucleotides long. These sequences map to different regions of the viral genome and in one instance are separated from the late gene by more than 100 kb of DNA. Moreover, the leader sequences map either upstream or downstream of the late gene, are transcribed from either DNA strand, and are fused to the late gene coding sequence via a poly(A) stretch. This demonstrates that vaccinia virus produces late mRNAs by tagging the protein-coding sequences onto the 3' end of other RNAs.