Sciweavers

128 search results - page 21 / 26
» Computing optimal strategies to commit to in extensive-form ...
Sort
View
AAAI
2000
14 years 11 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 3 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
SIROCCO
2008
14 years 11 months ago
Word of Mouth: Rumor Dissemination in Social Networks
In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maxi...
Jan Kostka, Yvonne Anne Oswald, Roger Wattenhofer
GECCO
2006
Springer
198views Optimization» more  GECCO 2006»
15 years 1 months ago
Reward allotment in an event-driven hybrid learning classifier system for online soccer games
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
Yuji Sato, Yosuke Akatsuka, Takenori Nishizono
94
Voted
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
15 years 2 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...