Sciweavers

347 search results - page 32 / 70
» Some Second Order Set Theory
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 4 months ago
Towards a communication-theoretic understanding of system-level power consumption
Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be signif...
Pulkit Grover, Kristen Ann Woyach, Anant Sahai
LICS
2008
IEEE
14 years 1 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
ATAL
2008
Springer
13 years 9 months ago
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
ENTCS
2002
152views more  ENTCS 2002»
13 years 7 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg