Sciweavers

234 search results - page 14 / 47
» A polynomial-time nash equilibrium algorithm for repeated ga...
Sort
View
UAI
2004
14 years 11 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
CSE
2009
IEEE
15 years 4 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
15 years 3 months ago
Buyer-Supplier Games: Optimization over the Core
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
Nedialko B. Dimitrov, C. Greg Plaxton
VTC
2010
IEEE
114views Communications» more  VTC 2010»
14 years 8 months ago
Power Control Game with SINR-Pricing in Variable-Demand Wireless Data Networks
—Game theory has been applied to model power control in wireless systems for years. Conventional power control games tend to consider unlimited backlogged user traffic. Differen...
Fu-Yun Tsuo, Wei-Lin Lee, Chih-Yu Wang, Hung-Yu We...
WINE
2007
Springer
166views Economy» more  WINE 2007»
15 years 3 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...