Sciweavers

4435 search results - page 169 / 887
» Algorithms, games, and the internet
Sort
View
158
Voted
INFOCOM
2006
IEEE
16 years 19 days ago
On the Sensitivity of Online Game Playing Time to Network QoS
Abstract— Online gaming is one of the most profitable businesses on the Internet. Among various threats to continuous player subscriptions, network lags are particularly notorio...
Kuan-Ta Chen, Polly Huang, Guo-Shiuan Wang, Chun-Y...
DM
2006
83views more  DM 2006»
15 years 6 months ago
A note on k-cop, l-robber games on graphs
We give an algorithmic characterisation of finite cop-win digraphs. The case of k > 1 cops and k l 1 robbers is then reduced to the one cop case. Similar characterisations are ...
Gena Hahn, Gary MacGillivray
151
Voted
NIPS
2004
15 years 8 months ago
New Criteria and a New Algorithm for Learning in Multi-Agent Systems
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
Rob Powers, Yoav Shoham
CORR
2008
Springer
227views Education» more  CORR 2008»
15 years 6 months ago
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
Bruno Codenotti, Stefano De Rossi, Marino Pagan
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber