Sciweavers

66 search results - page 9 / 14
» A Game Theoretical Model for Adversarial Learning
Sort
View
FOCS
2007
IEEE
15 years 3 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
79
Voted
JUCS
2008
104views more  JUCS 2008»
14 years 9 months ago
Optimal Transit Price Negotiation: The Distributed Learning Perspective
: We present a distributed learning algorithm for optimizing transit prices in the inter-domain routing framework. We present a combined game theoretical and distributed algorithmi...
Dominique Barth, Loubna Echabbi, Chahinez Hamlaoui
AAI
2002
109views more  AAI 2002»
14 years 9 months ago
Probabilistic Assessment of User's Emotions in Educational Games
We present a probabilistic model to monitor a user's emotions and engagement during the interaction with educational games. We illustrate how our probabilistic model assesses...
Cristina Conati
84
Voted
AIIDE
2009
14 years 10 months ago
Improving Offensive Performance Through Opponent Modeling
Although in theory opponent modeling can be useful in any adversarial domain, in practice it is both difficult to do accurately and to use effectively to improve game play. In thi...
Kennard Laviers, Gita Sukthankar, David W. Aha, Ma...
ICALP
2009
Springer
15 years 9 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio