Sciweavers

502 search results - page 27 / 101
» Monotone Approximation of Decision Problems
Sort
View
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
15 years 4 months ago
Oracular Partially Observable Markov Decision Processes: A Very Special Case
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
Nicholas Armstrong-Crews, Manuela M. Veloso
IJCAI
2007
14 years 11 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe
ATAL
2008
Springer
14 years 11 months ago
Sequential decision making in repeated coalition formation under uncertainty
The problem of coalition formation when agents are uncertain about the types or capabilities of their potential partners is a critical one. In [3] a Bayesian reinforcement learnin...
Georgios Chalkiadakis, Craig Boutilier
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
14 years 9 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 7 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...