Pfad: SAGT08 > Accepted Papers
Accepted Papers

  • Martin Hoefer and Alexander Souza
    The Influence of Link Restrictions on (Random) Selfish Routing
  • Ulrich Faigle and Britta Peis
    A Hierarchical Model for Cooperative Games
  • Nadine Baumann and Sebastian Stiller
    The Price of Anarchy of a Network Creation Game with Exponential Payoff
  • Moshe Babaioff, Patrick Briest and Piotr Krysta
    On the Approximability of Combinatorial Exchange Problems
  • Leah Epstein and Rob van Stee
    The price of anarchy on uniformly related machines revisited
  • Michal Feldman and Tami Tamir
    Approximate Strong Equilibrium in Job Scheduling Games
  • Richard Cole, Shahar Dobzinski and Lisa Fleischer
    Prompt Mechanisms for Online Auctions
  • Ronen Gradwohl
    Price Variation in a Bipartite Exchange Network
  • Christine Chung, Katrina Ligett, Kirk Pruhs and Aaron Roth
    The Price of Stochastic Anarchy
  • Yvonne Bleischwitz and Florian Schoppmann
    Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
  • Jon Feldman, S Muthukrishnan, Evdokia Nikolova and Martin Pal
    A Truthful Mechanism for Offline Ad Slot Scheduling
  • Matthias Englert, Thomas Franke and Lars Olbrich
    Sensitivity of Wardrop Equilibria
  • Dimitris Fotakis
    Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
  • Amos Fiat and Hila Pochter
    Subjective vs Objective Reality .the Risk of Running Late
  • Niv Buchbinder, Liane Lewin-Eytan, Seffi Naor and Ariel Orda
    Non-Cooperative Cost Sharing Games via Subsidies
  • Dimitris Fotakis, Alexis Kaporis and Paul Spirakis
    Atomic congestion games: fast, myopic and concurrent
  • Sébastien Hémon, Michel de Rougemont and Miklos Santha
    Approximate Nash Equilibria for multi-players Games
  • Pavlos Efraimidis and Lazaros Tsavlidis
    Window-Games between TCP flows
  • Janina Brenner and Guido Schaefer
    Singleton Acyclic Mechanisms and their Applications to Scheduling Problems
  • Gunes Ercal, Rafit Izhak-Razin, Rupak Majumdar and Adam Meyerson
    Frugal Routing on Wireless Ad-Hoc Networks
  • Shuchi Chawla and Tim Roughgarden
    Bertrand competition in networks
  • Rainer Feldmann, Marios Mavronicolas and Andreas Pieris
    Facets of the Fully Mixed Nash Equilibrium Conjecture
  • Felix Brandt and Felix Fischer
    Computational Properties of Quasi-Strict Equilibrium
  • Markus Blaeser and Elias Vicari
    Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
  • Arndt von Schemde and Bernhard von Stengel
    Strategic characterization of the index of an equilibrium
  • Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden and Mukund Sundararajan
    Is Shapley Cost Sharing Optimal?
  • Vincenzo Auletta, Paolo Penna, Giuseppe Persiano and Carmine Ventre
    Alternatives to Truthfulness are Hard to Recognize
  • oren ben-zwi and amir ronen
    The Local and Global Price of Anarchy of Graphical Games

 

Last Change: 21.01.2008 | Impressum | © 2007/2008