We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching...

We introduce a class of games with complementarities that has the quasisupermodular games, hence the supermodular games, as a special case. Our games retain the main property of quasisupermodular games: the Nash set is a nonempty complete lattice. We use monotonicity properties on the best reply...

Noting that a full characterization of Nash-implementation is given using a canonical-mechanism and Maskin's theorem (Maskin, 1999) is shown using a mechanism with Saijo's type of strategy space reduction (Saijo, 1988), this paper fully characterizes the class of Nash-implementable social choice...

Many social networks have the following properties: (i) a short average distance between any two individuals; (ii) a high clustering coefficient; (iii) segregation patterns; the presence of (iv) brokers and (v) hubs. (i) and (ii) define a small world network. This paper develops a strategic...

In the literature the outcome of contests is either interpreted as win probabilities or as shares of the prize. With this in mind, we examine two approaches to contest success functions. In the first we analyze the implications of contestants' incomplete information concerning the 'type' of the...

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium

We examine repeated Cournot oligopolies when there is uncertainty about the number of players. Already in the static game, such uncertainty can imply outputs above Nash. For the repeated game, we argue that the uncertainty may lead to a novel strategy, based on a notion of limited depth of...

This paper studies the existence of a pure strategy Nash equilibrium in games with strategic complementarities where the strategy sets are totally ordered. By relaxing the conventional conditions related to upper semicontinuity and single crossing, we enlarge the class of games to which monotone...

This paper studies a non-cooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...

This note analyzes in a fishery management problem the effects of relaxing one of the usual assumptions in the literature of dynamic games. Specifically, the assumption that players restrict to strategies that stabilize the system. Previous works in the literature have shown that feedback Nash...