#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1992

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

A class of noncooperative games in which the players share a common set of strategies is described. The payoff a player receives for playing a particular strategy depends only on the total number of players playing the same strategy and decreases with that number in a manner which is specific to the particular player. It is shown that each game in this… (More)

- Igal Milchtaich
- Games and Economic Behavior
- 2006

Different kinds of networks, such as transportation, communication, computer, and supply networks, are susceptible to similar kinds of inefficiencies. These arise when congestion externalities make each user’s cost depend on the other users’ choices of routes. If each user chooses the least expensive (e.g., fastest) route from the users’ common point of… (More)

- Igal Milchtaich
- Math. Oper. Res.
- 2005

Equilibrium ow in a physical network with a large number of users (e.g., transportation, communication and computer networks) need not be unique if the costs of the network elements are not the same for all users. Such di¤erences among users may arise if they are not equally a¤ected by congestion or have di¤erent intrinsic preferences. Whether or not, for… (More)

We consider a special case of weighted congestion games with playerspecific latency functions where each player uses for each particular resource a fixed (non-decreasing) delay function together with a player-specific constant. For each particular resource, the resource-specific delay function and the playerspecific constant (for that resource) are composed… (More)

- Igal Milchtaich
- WINE
- 2006

An open problem is presented regarding the existence of pure strategy Nash equilibrium (PNE) in network congestion games with a finite number of non-identical players, in which the strategy set of each player is the collection of all paths in a given network that link the player’s origin and destination vertices, and congestion increases the costs of edges.… (More)

- Igal Milchtaich
- J. Economic Theory
- 2004

Congestion externalities may result in non-optimal equilibria. For these to occur, it suffices that facilities differ in their fixed utilities or costs. As this paper shows, the only case in which equilibria are always socially optimal, regardless of the fixed components, in that in which the costs increase logarithmically with the size of the set of users.… (More)

- Igal Milchtaich
- Math. Oper. Res.
- 2000

A crowding game is a noncooperative game in which the payo¤ of each player depends only on the players action and the size of the set of players choosing that particular action: The larger the set, the smaller the payo¤. Finite, n-player crowding games often have multiple equilibria. However, a large crowding game generically has just one equilibrium, and… (More)

- Igal Milchtaich
- Int. J. Game Theory
- 1998

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 sequentially solvable if each of its sequential-move… (More)

- Igal Milchtaich
- Games and Economic Behavior
- 2009

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 or multiplicatively) separable. This paper considers the… (More)

- Shani Alkoby, David Sarne, Igal Milchtaich
- AAAI
- 2017