Sciweavers

70 search results - page 3 / 14
» Approximate Nash Equilibria under Stability Conditions
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
Pure and Bayes-Nash Price of Anarchy for Generalized Second Price Auction
Generalized Second Price Auction, also knows as Ad Word auctions, and its variants has been the main mechanism used by search companies to auction positions for sponsored search l...
Renato Paes Leme, Éva Tardos
SPAA
2006
ACM
14 years 1 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
ICML
1998
IEEE
14 years 8 months ago
Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
Junling Hu, Michael P. Wellman
SIROCCO
2004
13 years 8 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente