Sciweavers

228 search results - page 38 / 46
» Expected Reachability-Time Games
Sort
View
AMEC
2003
Springer
15 years 7 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
ATAL
2003
Springer
15 years 7 months ago
Coordination in multiagent reinforcement learning: a Bayesian approach
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
Georgios Chalkiadakis, Craig Boutilier
100
Voted
HICSS
2002
IEEE
150views Biometrics» more  HICSS 2002»
15 years 6 months ago
Social Capital and Volunteerism in Virtual Communities: The Case of the Internet Chess Club
This paper considers the theory of social capital and volunteerism in an online gaming community, the Internet Chess Club (ICC). We discuss how increased social capital provides b...
Mark Ginsburg, Suzanne P. Weisband
140
Voted
KR
2010
Springer
15 years 6 months ago
I Don't Want to Think About it Now: Decision Theory with Costly Computation
Computation plays a major role in decision making. Even if an agent is willing to ascribe a probability to all states and a utility to all outcomes, and maximize expected utility,...
Joseph Y. Halpern
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 6 months 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...