𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing approximate Nash equilibria in network congestion games

✍ Scribed by Andreas Emil Feldmann; Heiko Röglin; Berthold Vöcking

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
116 KB
Volume
59
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation of Nash equilibria in Baye
Approximation of Nash equilibria in Bayesian games
✍ Olivier Armantier; Jean-Pierre Florens; Jean-Francois Richard 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract We define a new concept of constrained strategic equilibrium (CSE) for Bayesian games. We show that a sequence of CSEs approximates an equilibrium under standard conditions. We also provide an algorithm to implement the CSE approximation method numerically in a broad class of Bayesian g

A differential game model of Nash equili
A differential game model of Nash equilibrium on a congested traffic network
✍ Byung-Wook Wie 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 755 KB

## Abstract This paper considers the problem of the competition among a finite number of players who must transport the fixed volume of traffic on a simple network over a prescribed planning horizon. Each player attempts to minimize his total transportation cost by making simultaneous decisions of

Nash equilibria in N-person games withou
Nash equilibria in N-person games without convexity
✍ Jen-Chih Yao 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 219 KB

h this note, an extended version of the Zhou and Chen minimax inequaiity is obtained for reflexive Banach spaces. An application of the result to the existence of Nash equilibrium points without assuming that cost functions are convex is given.