Sciweavers

224 search results - page 34 / 45
» On Nash-Equilibria of Approximation-Stable Games
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
FOCS
2007
IEEE
14 years 1 months ago
Computing Equilibria in Anonymous Games
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
Constantinos Daskalakis, Christos H. Papadimitriou
ATAL
2004
Springer
14 years 27 days ago
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Ke...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The MIMO Iterative Waterfilling Algorithm
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...