122 search results - page 16 / 25 » Probabilistic Techniques in Algorithmic Game Theory |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
MM
2009
ACM
14 years 2 months ago
2009
ACM
We propose a novel technique for semi-supervised image annotation which introduces a harmonic regularizer based on the graph Laplacian of the data into the probabilistic semantic ...
ATAL
2005
Springer
14 years 28 days ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
COLT
2003
Springer
14 years 21 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...