Focusing on signaling games, I illustrate the relevance of the rationalizability approach for the analysis multistage games with incomplete information. I define a class of iterative solution procedures, featuring a notion of "forward induction": the Receiver tries to explain the Sender's...

Most network games assume that the best response of a player is a linear function of the actions of her neighbors; clearly, this is a restrictive assumption. We developed a theory called sign-equivalent transformation (SET) underlying the mathematical structure behind a system of equations...

This chapter surveys voting game experiments that involve incomplete information with regard to voters’ opinions about what the best course of action might be and characteristics, especially their private costs and benefits related to decision making and their group affiliations (i.e., which...

This paper explores cooperation incentives in the absence of public reputation information, using an infinite-horizon Prisoners' Dilemma model of sequential relationships. We examine a strategy which we call Quit-for-Tat (QFT). In this model, individuals initially are paired randomly. In the...

In this paper we study the effects of adding unmediated communication to static, finite games of complete and incomplete information. We characterize SU(G), the set of outcomes of a game G, that are induced by sequential equilibria of cheap talk extensions. A cheap talk extension of G is an...

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given...

In this paper we present a new iterative acution, the bisection auction, that can be used for the sale of a single indivisible object. We will show that the bisection auction is computationally more efficient than the classical English auction while it still preserves all characteristics the...

Epistemic game theory formalizes assumptions about rationality and mutual beliefs in a formal language, then studies their behavioral implications in games. Specifically, it asks: what do different notions of rationality and different assumptions about what players believe about…what others...

We provide an overview and synthesis of the literatures analyzing games in which players are connected via a network structure. We discuss, in particular, the impact of the structure of the network on individuals’ behaviors. We focus on game theoretic modeling, but also include some discussion...

The sealed-bid k-double auction mechanism for two-person bargaining under incomplete information can be extended by providing a bonus for both traders if, and only if, an agreement is reached. Brams and Kilgour (1996) proved that there is a unique level of bonus, namely, half the difference...