3780 search results - page 51 / 756 » Algorithms for Game Metrics |
118
click to vote
ERSHOV
2003
Springer
15 years 8 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
145
Voted
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
135
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
156
click to vote
COCO
2010
Springer
15 years 7 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
147
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...