Sciweavers

3455 search results - page 56 / 691
» Generalized Game Trees
Sort
View
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
15 years 2 months ago
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
MST
2011
206views Hardware» more  MST 2011»
14 years 11 months ago
Weighted Logics for Unranked Tree Automata
: We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two conce...
Manfred Droste, Heiko Vogler
SIGECOM
2010
ACM
165views ECommerce» more  SIGECOM 2010»
15 years 9 months ago
Computing optimal strategies to commit to in extensive-form games
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
Joshua Letchford, Vincent Conitzer
CORR
2011
Springer
212views Education» more  CORR 2011»
14 years 10 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen

Publication
417views
16 years 24 days ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos