Abstract is missing.
- The Search for Equilibrium ConceptsChristos H. Papadimitriou. 1-3 [doi]
- Experimental Results on the Process of Goal Formation and Aspiration AdaptationReinhard Selten. 4 [doi]
- Approximate Equilibria for Strategic Two Person GamesPaul G. Spirakis. 5-21 [doi]
- The Influence of Link Restrictions on (Random) Selfish RoutingMartin Hoefer, Alexander Souza. 22-32 [doi]
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of AnarchyDimitris Fotakis. 33-45 [doi]
- The Price of Anarchy on Uniformly Related Machines RevisitedLeah Epstein, Rob van Stee. 46-57 [doi]
- Approximate Strong Equilibrium in Job Scheduling GamesMichal Feldman, Tami Tamir. 58-69 [doi]
- Bertrand Competition in NetworksShuchi Chawla, Tim Roughgarden. 70-82 [doi]
- On the Approximability of Combinatorial Exchange ProblemsMoshe Babaioff, Patrick Briest, Piotr Krysta. 83-94 [doi]
- Window-Games between TCP FlowsPavlos Efraimidis, Lazaros Tsavlidis. 95-108 [doi]
- Price Variation in a Bipartite Exchange NetworkRonen Gradwohl. 109-120 [doi]
- Atomic Congestion Games: Fast, Myopic and ConcurrentDimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. 121-132 [doi]
- Frugal Routing on Wireless Ad-Hoc NetworksGunes Ercal, Rafit Izhak-Ratzin, Rupak Majumdar, Adam Meyerson. 133-144 [doi]
- Facets of the Fully Mixed Nash Equilibrium ConjectureRainer Feldmann, Marios Mavronicolas, Andreas Pieris. 145-157 [doi]
- Sensitivity of Wardrop EquilibriaMatthias Englert, Thomas Franke, Lars Olbrich. 158-169 [doi]
- Prompt Mechanisms for Online AuctionsRichard Cole, Shahar Dobzinski, Lisa Fleischer. 170-181 [doi]
- A Truthful Mechanism for Offline Ad Slot SchedulingJon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál. 182-193 [doi]
- Alternatives to Truthfulness Are Hard to RecognizeVincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre. 194-205 [doi]
- Distributed Algorithmic Mechanism Design and Algebraic Communication ComplexityMarkus Bläser, Elias Vicari. 206-217 [doi]
- The Price of Anarchy of a Network Creation Game with Exponential PayoffNadine Baumann, Sebastian Stiller. 218-229 [doi]
- A Hierarchical Model for Cooperative GamesUlrich Faigle, Britta Peis. 230-241 [doi]
- Strategic Characterization of the Index of an EquilibriumArndt von Schemde, Bernhard von Stengel. 242-254 [doi]
- The Local and Global Price of Anarchy of Graphical GamesOren Ben-Zwi, Amir Ronen. 255-266 [doi]
- Approximate Nash Equilibria for Multi-player GamesSébastien Hémon, Michel de Rougemont, Miklos Santha. 267-278 [doi]
- Subjective vs.Objective Reality - The Risk of Running LateAmos Fiat, Hila Pochter. 279-290 [doi]
- On the Hardness and Existence of Quasi-Strict EquilibriaFelix Brandt, Felix A. Fischer. 291-302 [doi]
- The Price of Stochastic AnarchyChristine Chung, Katrina Ligett, Kirk Pruhs, Aaron Roth. 303-314 [doi]
- Singleton Acyclic Mechanisms and Their Applications to Scheduling ProblemsJanina Brenner, Guido Schäfer. 315-326 [doi]
- Is Shapley Cost Sharing Optimal?Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan. 327-336 [doi]
- Non-cooperative Cost Sharing Games Via SubsidiesNiv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda. 337-349 [doi]
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility LocationYvonne Bleischwitz, Florian Schoppmann. 350-361 [doi]