A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

We analyze binary choice models in communication networks, in which both, the formation of links in the network as well as the action choices are endogenous. We provide a complete characterization of the equilibrium action choices and networks, where agents choose their strategies - actions and...

We experimentally study settings where an individual may have an incentive to adopt negative beliefs about another's intentions in order to justify egoistic behavior. Our first study uses a game in which a player can take money from an opponent in order to prevent the opponent from subsequently...

We analyze binary choice models in communication networks, in which both, the formation of links in the network as well as the action choices are endogenous. We provide a complete characterization of the equilibrium action choices and networks, where agents choose their strategies - actions and...

I present a game-theoretic model where economic competition and attention competition are interdependent. On the one hand the effort to attract consumer attention depends on the value of attention to the firm which depends on the grade of price competition among all perceived firms. On the other...

We examine communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we introduce two...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous-time fictitious play converges to Nash equilibrium provided that the overall game is zero-sum. Moreover, the rate of convergence is 1/T , regardless of the size of the network. In contrast,...