205 search results - page 15 / 41 » When Can Limited Randomness Be Used in Repeated Games |
130
Voted
CORR
2008
Springer
15 years 7 days ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
101
Voted
OZCHI
2009
ACM
15 years 7 months ago
2009
ACM
People use a wide range of intensity when interacting with computers, spanning from subtle to brute force. However, computer interfaces so far have mainly focused on interactions ...
106
Voted
ML
2006
ACM
15 years 18 days ago
2006
ACM
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
104
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
101
Voted
CRYPTO
2000
Springer
15 years 5 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...