Sciweavers

3504 search results - page 6 / 701
» Computational Aspects of Equilibria
Sort
View
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 8 months ago
Near Rationality and Competitive Equilibria in Networked Systems
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
Nicolas Christin, Jens Grossklags, John Chuang
TCS
2010
13 years 7 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer
CSJM
2006
81views more  CSJM 2006»
13 years 8 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 2 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou