✦ LIBER ✦

Combinatorial optimization in nash games

✍ Scribed by Michael M. Kostreva

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 546 KB
Volume: 25
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90278-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multidisciplinary topology optimization

Multidisciplinary topology optimization solved as a Nash game

✍ Abderrahmane Habbal; Joakim Petersson; Mikael Thellner 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

Nash equilibria in multineuron games

✍ Robert H. Baran; James P. Coughlin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Nash-equilibrium in stochastic different

Nash-equilibrium in stochastic differential games

✍ Svetoslav D. Gaidov 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 343 KB

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

Computing approximate Nash equilibria in

Computing approximate Nash equilibria in network congestion games

✍ Andreas Emil Feldmann; Heiko Röglin; Berthold Vöcking 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB

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.