Sciweavers

4435 search results - page 294 / 887
» Algorithms, games, and the internet
Sort
View
FOCS
2006
IEEE
16 years 26 days ago
Computing Nash Equilibria: Approximation and Smoothed Complexity
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
Xi Chen, Xiaotie Deng, Shang-Hua Teng
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 10 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
WWW
2001
ACM
16 years 7 months ago
Finding authorities and hubs from link structures on the World Wide Web
Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best "authorities" for a given topic or query. Wh...
Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosen...
AH
2004
Springer
15 years 10 months ago
Evaluating Information Filtering Techniques in an Adaptive Recommender System
Abstract. With the huge increase in the volume of information available in digital form and the increasing diversity of Web applications, the need for efficient, reliable, informat...
John O'Donovan, John Dunnion
ATAL
2009
Springer
16 years 1 months ago
Effective tag mechanisms for evolving cooperation
Certain observable features (tags), shared by a group of similar agents, can be used to signal intentions and can be effectively used to infer unobservable properties. Such infere...
Matthew Matlock, Sandip Sen