894 search results - page 142 / 179 » Game Theory with Costly Computation |
DAC
2002
ACM
16 years 2 months ago
2002
ACM
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, ...
117
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
121
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Making commitments, e.g., through promises and threats, enables a player to exploit the strengths of his own strategic position as well as the weaknesses of that of his opponents....
112
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...