1599 search results - page 171 / 320 » Algorithms for Parity Games |
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present computational results concerning stable partitions in additively separable hedonic games. First, we propose a polynomial-time algorithm to compute a contractua...
165
click to vote
TCS
2008
15 years 6 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
163
click to vote
FLAIRS
2009
15 years 4 months ago
2009
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
190
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We introduce the Multiplicative Update Selector and Estimator (MUSE) algorithm for sparse approximation in underdetermined linear regression problems. Given f = Φα∗ + µ, the ...
165
click to vote
AAAI
2011
14 years 6 months ago
2011
Attacker-defender Stackelberg games have become a popular game-theoretic approach for security with deployments for LAX Police, the FAMS and the TSA. Unfortunately, most of the ex...