When there is incomplete information on the source of power in a contest, the contestants may divide their lobbying efforts between the potential centers of power, only one of which determines the contests’ winning probabilities. Our analysis focuses on the effect of ambiguity regarding the...

This paper introduces games of incomplete information in which the number, as well as the identity, of the participating players is determined by chance. The participation of certian players may not be independent of the participation of others, and hence the very fact that a particular player...

A formula is presented for computing the completely mixed equilibrium payoffs in finite two-person games.

Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively)...

Players in a congestion game may differ from one another in their intrinsic preferences (e.g., the benefit they get from using a specific resource), their contribution to congestion, or both. In many cases of interest, intrinsic preferences and the negative effect of congestion are (additively...

A sequential-move version of a given normal-form game is an extensive-form game of perfect information in which each player chooses his action after observing the actions of all players who precede him and the payoffs are determined according to the payoff functions in . A normal-form game is...

A formula is presented for computing the equilibrium payoffs in a generic finite two-person game when the support of the equilibrium is known.