Sciweavers

115 search results - page 17 / 23
» Finding Optimal Abstract Strategies in Extensive-Form Games
Sort
View
TSP
2010
13 years 2 months ago
Cooperative resource allocation games under spectral mask and total power constraints
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang
ISDA
2010
IEEE
13 years 5 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 14 days ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...
WINE
2009
Springer
200views Economy» more  WINE 2009»
14 years 13 days ago
Pricing Strategies for Viral Marketing on Social Networks
Abstract. We study the use of viral marketing strategies on social networks that seek to maximize revenue from the sale of a single product. We propose a model in which the decisio...
David Arthur, Rajeev Motwani, Aneesh Sharma, Ying ...
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 7 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...