Volume 343,
Numbers 1-2,
10 October 2005
Game Theory Meets Theoretical Computer Science
- Samson Abramsky, Marios Mavronicolas:
Game Theory Meets Theoretical Computer Science.
1-3
- Luis López, Gemma del Rey Almansa, Stéphane Paquelet, Antonio Fernández:
A mathematical model for the TCP Tragedy of the Commons.
4-26
- Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
27-41
- Oswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia:
Games on triangulations.
42-71
- Robert A. Hearn, Erik D. Demaine:
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation.
72-96
- Yoav Shoham, Moshe Tennenholtz:
Non-cooperative computation: Boolean functions with correctness and exclusivity.
97-113
- Joan Feigenbaum, Lance Fortnow, David M. Pennock, Rahul Sami:
Computation in a distributed information market.
114-132
- Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria.
133-157
- Oleg Verbitsky:
The first order definability of graphs with separators via the Ehrenfeucht game.
158-176
- Olivier Laurent:
Syntax vs. semantics: A polarized approach.
177-206
- Andrzej S. Murawski:
Games for complexity of second-order call-by-name programs.
207-236
- Paul-André Melliès:
Sequential algorithms and strongly stable functions.
237-281
Volume 343,
Number 3,
17 October 2005
Formal Methods for Components and Objects Preface
Contributions
Last update Sat May 26 07:14:08 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
