We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
At excavations a large number of sherds of archaeological pottery is found. Since the documentation and administration of these fragments represent a temporal and personnel effort...
We examine the problem of determining a user's value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website persona...
Scott Buffett, Nathan Scott, Bruce Spencer, Michae...
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...