Sciweavers

399 search results - page 36 / 80
» Games with Congestion-Averse Utilities
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
14 years 11 months ago
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
FOCS
2007
IEEE
15 years 6 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
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
15 years 5 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...
TSP
2008
167views more  TSP 2008»
14 years 11 months ago
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network
Abstract--We present decentralized adaptive filtering algorithms for sensor activation control in an unattended ground sensor network (UGSN) comprised of ZigBee-enabled nodes. Node...
Vikram Krishnamurthy, Michael Maskery, Gang George...
IWCMC
2006
ACM
15 years 5 months ago
Performance enhancing proxy for interactive 3G network gaming
Unlike non-time-critical applications like email and file transfer, network games demand timely data delivery to maintain the seemingly interactive presence of players in the vir...
Gene Cheung, Takashi Sakamoto, Michael Sweeney