This paper examines the conception of individuals as being of certain types in Harsanyi'stransformation of games of incomplete information into games of complete information. Itargues that while the conception of the individual in games of complete information offerspotential advances over the...

Since the seminal paper of Nash (1950) game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.

This paper studies network formation in settings where players are heterogeneous with respect to benefits as well as the costs of forming links. Our results demonstrate that centrality, center-sponsorship and short network diameter are robust features of equilibrium networks. We find that in a...

We introduce a form of pre-play communication that we call preopening. During the preopening, players announce their tentative actions to be played in the underlying game. Announcements are made using a posting system which is subject to stochastic failures. Posted actions are publicly...

Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

The bargaining model with stochastic order of proposing players is properly embedded in continuous time and it is strategically equivalent to the alternating offers model. For all parameter values, the pair of equilibrium proposals corresponds to the Nash bargaining solution of a modified...

We apply the dynamic stochastic framework proposed by recent evolutionaryliterature to the class of strict supermodular games when two simplebehavior rules coexist in the population, imitation and myopic optimization.We assume that myopic optimizers are able to see how well their payoff...

A simultaneous pooled auction with multiple bids and preference lists is a way to auction multiple objects, in which bidders simultaneously express a bid for each object and a preference ordering over which object they would like to get in case they have the highest bid on more than one object....