3353 search results - page 306 / 671 » Laver and set theory |
162
click to vote
IJAC
2002
15 years 6 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
194
click to vote
MST
2010
15 years 5 months ago
2010
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
180
click to vote
SIGECOM
2006
ACM
16 years 19 days ago
2006
ACM
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
201
click to vote
FOSSACS
2005
Springer
16 years 6 days ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
179
click to vote
WINE
2005
Springer
16 years 4 days ago
2005
Springer
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...