Sciweavers

110 search results - page 6 / 22
» Simple Search Methods for Finding a Nash Equilibrium
Sort
View
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 9 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
14 years 2 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
ATAL
2010
Springer
13 years 9 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
VTC
2010
IEEE
163views Communications» more  VTC 2010»
13 years 7 months ago
Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory
— In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed ...
Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Ha...
WWW
2006
ACM
14 years 9 months ago
Finding specification pages according to attributes
This paper presents a method for finding a specification page on the web for a given object (e.g., "Titanic") and its class label (e.g., "film"). A specificati...
Naoki Yoshinaga, Kentaro Torisawa