Sciweavers

1410 search results - page 145 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
87
Voted
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
14 years 11 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
78
Voted
ECCC
2006
75views more  ECCC 2006»
14 years 11 months ago
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...
AMC
2008
86views more  AMC 2008»
14 years 11 months ago
Numerical solution of stochastic Nash games with state-dependent noise for weakly coupled large-scale systems
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
Muneomi Sagara, Hiroaki Mukaidani, Toru Yamamoto
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 8 days ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
101
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 6 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...