This paper discusses the strategic role of mismatching, where players voluntarily form inefficient teams or forego the formation of efficient teams, respectively. Strategic mismatching can be rational when players realize a competitive advantage (e.g. harming other competitors). In addition, the...

This paper discusses the strategic role of mismatching, where players voluntarily form inefficient teams or forego the formation of efficient teams, respectively. Strategic mismatching can be rational when players realize a competitive advantage (e.g. harming other competitors). In addition, the...

We consider jointly replenishing n ex--ante identical firms that operate under an EOQ like setting using a non-cooperative game under asymmetric information. In this game, each firm, upon being privately informed about its demand rate (or inventory cost rate), submits a private contribution to...

In this paper the well-known minimax theorems of Wald, Ville and Von Neumann are generalized under weaker topological conditions on the payoff function f and/or extended to the larger set of the Borel probability measures instead of the set of mixed strategies

In this note we review some known minimax theorems with applications in game theory and show that these results form an equivalent chain which includes the strong separation result in finite dimensional spaces between two disjoint closed convex sets of which one is compact. By simplifying the...

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...

The Nash bargaining solution of a modified bargaining problem in the contract space yields the pair of stationary subgame perfect equilibrium proposals in the alternating offers model, also for positive time between proposals. As time vanishes, convergence to the Nash bargaining solution is...

We study a bargaining model with a disagreement game between offers and counteroffers. In order to characterize the set of its subgame perfect equilibrium payoffs, we provide a recursive technique that relies on the Pareto frontier of equilibrium payoffs. When players have different time...

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...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...