5995 search results - page 352 / 1199 » Algorithmic Game Theory |
193
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...
178
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
218
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
198
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...
172
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
Consideration of cost and resource benefits generated from an alliance have prevailed the theoretical and empirical research about strategic alliances and value networks/ webs. As...