We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

This paper introduces a class of contest models in which each player decides when to stop a privately observed Brownian motion with drift and incurs costs depending on his stopping time. The player who stops his process at the highest value wins a prize. We prove existence and uniqueness of a...

Swarnajayanti Gram Swarozgar Yojana (SGSY) is a government-sponsored microfinance program. The scheme is based on four features: group lending with joint liability, progressive lending, back-ended subsidy, and social capital. We propose a new model of SGSY having these features: group lending...

In the insurance industry, the number of product-specific policies from different companies has increased significantly. The strong market competition has boosted the demand for a competitive premium. In actuarial science, scant literature still exists on how competition actually affects the...

To quantify a player's commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a "canonical extension," which allows each player to adjust his or her move with a certain probability. The commitment measure relates to the average over all...

We establish the existence of pure strategy equilibria in games with discontinuous payoffs where the set of feasible actions of each player varies, also in a discontinuous fashion, as a function of the actions of the other players. Such games are used in modeling abstract economies and other...

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

We consider finite non-cooperative N person games with fixed numbers mi, i = 1, . . . , N , of pure strategies of player i. We propose the following question: is it possible to extend the vector space of finite non-cooperative m1 × m2 × . . . × mN - games in mixed strategies such that all...

Fixed points of the (most) refined best reply correspondence, introduced in Balkenborg, Hofbauer, and Kuzmics (2013), in the agent normal form of extensive form games with perfect recall have a remarkable property. They induce fixed points of the same correspondence in the agent normal form of...

In classical game theory, players have finitely many actions and evaluate outcomes of mixed strategies using a von Neumann-Morgenstern utility function. Allowing a larger, but countable, player set introduces a host of phenomena that are impossible in finite games. Firstly, in coordination...