248 search results - page 29 / 50 » Bayesian Coalitional Games |
IGPL
2010
14 years 8 months ago
2010
Collective rationality in its ordinary sense is rationality’s extension to groups. It does not entail efficiency by definition. Showing that it entails efficiency requires a nor...
CORR
2010
Springer
14 years 10 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...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
Computing optimal Stackelberg strategies in general two-player Bayesian games (not to be confused with Stackelberg strategies in routing games) is a topic that has recently been ga...
101
click to vote
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
110
click to vote
ATAL
2011
Springer
13 years 9 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...