We consider coordination situations with a conflict of interest, and experimentally vary the inefficiency of an equal earnings equilibrium, as well as the number of efficient and unequal earnings equilibria. We observe that equality, as long it is not extremely inefficient, remains very salient,...

Using a network approach we provide a characterization of a separating equilibrium for standard signaling games where the senders payoff function is quasi-linear. Given a strategy of the sender, we construct a network where the node set and the length between two nodes are the set of the senders...

We illustrate an equivalence between the class of two-person symmetric games and the class of decision problems with a complete preference relation. Moreover, we show that a strategy is an optimal threat strategy Nash, 1953 in a two-person symmetric game if and only if it is a maximal element in...

This paper studies collusion in one-shot auctions, where a buyer can bribe his competitors into lowering their bids. We modify the single-unit Vickrey auction to incite deviations from the designated-winner scenario and thus undermine collusion. The construction of mechanism does not require the...

En este trabajo se muestran condiciones para la unicidad del equilibrio de Nash-Cournot para un juego de n-firmas. Estas condiciones garantizan que las funciones de mejor respuesta para n-firmas que compiten en forma oligopolica a la Cournot sean contracciones y generalizan las condiciones de...

We propose a data-constrained generalized maximum entropy estimator for discrete sequential move games of perfect information. Unlike most other work on the estimation of complete information games, the method we proposed is data constrained and requires o simulation or assumptions about the...

We report results from an experiment in which humans repeatedly play one of two games against a computer program that follows either a reinforcement or an experience weighted attraction learning algorithm. Our experiment shows these learning algorithms detect exploitable opportunities more...

We examine experimentally how humans behave when they play against a computer which implements its part of a mixed strategy Nash equilibrium. We consider two games, one zero-sum and another unprofitable with a pure minimax strategy. A minority of subjects' play was consistent with their Nash...

We propose a statistical model to assess whether individuals strategically use mixed strategies in repeated games. We formulate a hidden Markov model in which the latent state space contains both pure and mixed strategies, and allows switching between these states. We apply the model to data...

Based on recent developments in non-cooperative coalitional bargaining theory, I review game theoretical analyses of cooperation and institution. The first part presents basic results of the random-proposer model and applies them to the problem of involuntary unemployment in a labor market....