Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...

This note reexamines the connection between the asymmetric Nash bargaining solution and the equilibria of strategic bargaining games. Several papers in the literature obtain the asymmetric Nash bargaining solution as the unique limit of subgame perfect equilibria in stationary strategies when...

We analyze the simplest Condorcet cycle with three players and three alternatives within a strategic bargaining model with recognition probabilities and costless delay. Mixed consistent subgame perfect equilibria exist whenever the geometric mean of the agents'' risk coefficients, ratios of...

We introduce the concept of a transferable utility game with uncertainty (TUU-game). In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature may materialize and conditional on the state, the players are involved in a particular...

We study the implications of procedural fairness on income taxation. We formulateprocedural fairness as a particular non-cooperative bargaining game and examine thestationary subgame perfect equilibria of the game. The equilibrium outcome is called tax equilibrium and is shown to be unique. The...

We propose a model on strategic formation of communication networks with (i) link specificity: the more direct links somebody maintains, the less she can specify her attention per link, the lower her links’ value, while this negative externality was previously ignored in the communication...

We examine the notion of the core when cooperation takes place in a setting with time and uncertainty. We do so in a two-period general equilibrium setting with incomplete markets. Market incompleteness implies that players cannot make all possible binding commitments regarding their actions at...

We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU...

We show that in the canonical non-cooperative multilateral bargaining game, a subgameperfect equilibrium exists in pure stationary strategies, even when the space of feasible payoffs is not convex. At such an equilibrium there is no delay. We also have the converse result that randomization will...

This paper studies the sales of a single indivisible object where bidders have continuous valuations. In Grigorieva et al. [13] it was shown that, in this setting, query auctions necessarily allocate inefficiently in equilibrium. In this paper we propose a new sequential auction, called the...