Sciweavers

85 search results - page 14 / 17
» Applications of approximation algorithms to cooperative game...
Sort
View
AAAI
2012
11 years 9 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
CVPR
2009
IEEE
1385views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Distributed Multi-Target Tracking In A Self-Configuring Camera Network
This paper deals with the problem of tracking multiple targets in a distributed network of self-configuring pan-tilt-zoom cameras. We focus on applications where events unfold over...
Amit K. Roy Chowdhury, Bi Song, Cristian Soto
ATAL
2008
Springer
13 years 9 months ago
Reinforcement learning for DEC-MDPs with changing action sets and partially ordered dependencies
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
Thomas Gabel, Martin A. Riedmiller