Sciweavers

1599 search results - page 223 / 320
» Algorithms for Parity Games
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
16 years 26 days ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
15 years 6 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...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 6 months 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
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 27 days 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...
SAGT
2009
Springer
155views Game Theory» more  SAGT 2009»
16 years 25 days ago
Anarchy, Stability, and Utopia: Creating Better Matchings
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...
Elliot Anshelevich, Sanmay Das, Yonatan Naamad