Sciweavers

757 search results - page 14 / 152
» How to decide
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Hedged learning: regret-minimization with learning experts
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
Yu-Han Chang, Leslie Pack Kaelbling
ALDT
2009
Springer
110views Algorithms» more  ALDT 2009»
14 years 2 months ago
Manipulating Tournaments in Cup and Round Robin Competitions
In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the ...
Tyrel Russell, Toby Walsh
AUTOMATICA
2006
85views more  AUTOMATICA 2006»
13 years 7 months ago
Stability analysis of network-based cooperative resource allocation strategies
Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we fo...
Alvaro E. Gil, Kevin M. Passino
COLING
2002
13 years 7 months ago
An Inference-based Approach to Dialogue System Design
We present an architecture for spoken dialogue systems where first-order inference (both theorem proving and model building) plays a crucial role in interpreting utterances of dia...
Johan Bos, Tetsushi Oka
FOCS
2005
IEEE
14 years 1 months ago
AdWords and Generalized On-line Matching
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vij...