Sciweavers

560 search results - page 26 / 112
» From Continuous to Discrete Games
Sort
View
ICML
2010
IEEE
13 years 6 months ago
Heterogeneous Continuous Dynamic Bayesian Networks with Flexible Structure and Inter-Time Segment Information Sharing
Classical dynamic Bayesian networks (DBNs) are based on the homogeneous Markov assumption and cannot deal with heterogeneity and non-stationarity in temporal processes. Various ap...
Frank Dondelinger, Sophie Lebre, Dirk Husmeier
ATAL
2011
Springer
12 years 7 months ago
Game theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
Sam Ganzfried, Tuomas Sandholm
CAAN
2007
Springer
13 years 11 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh
JMLR
2010
119views more  JMLR 2010»
13 years 2 months ago
The Coding Divergence for Measuring the Complexity of Separating Two Sets
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...
Mahito Sugiyama, Akihiro Yamamoto
CHI
2009
ACM
14 years 8 months ago
Lessons from brain age on persuasion for computer security
Users generally have difficulty understanding and managing computer security tasks. We examined Nintendo's Brain Age games for ways to help users remember more secure passwor...
Alain Forget, Sonia Chiasson, Robert Biddle