5995 search results - page 325 / 1199 » Algorithmic Game Theory |
167
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 ...
169
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...
169
Voted
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...
195
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
193
Voted
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provabl...