Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
  
 

Publications at SAGT

Below you find the list of all publications of the Algorithm Engineering group presented at the International Symposium on Algorithmic Game Theory (SAGT).

2018

  • Schelling Segregation wit... - Download
    Chauhan, Ankit; Lenzner, Pascal; Molitor, Louise Schelling Segregation with Strategic AgentsSymposium on Algorithmic Game Theory (SAGT) 2018
     
  • Cseh, Ágnes; Fleiner, Tamás The Complexity of Cake Cutting with Unequal SharesSymposium Algorithmic Game Theory (SAGT) 2018: 19–30
     

2017

  • Selfish Network Creation ... - Download
    Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Molitor, Louise Selfish Network Creation with Non-Uniform Edge CostSymposium on Algorithmic Game Theory (SAGT) 2017: 160–172
     
  • Efficient Best Response C... - Download
    Friedrich, Tobias; Ihde, Sven; Keßler, Christoph; Lenzner, Pascal; Neubert, Stefan; Schumann, David Efficient Best Response Computation for Strategic Network Formation under AttackSymposium on Algorithmic Game Theory (SAGT) 2017: 199–211
     

2016

  • On Selfish Creation of Ro... - Download
    Chauhan, Ankit; Lenzner, Pascal; Melnichenko, Anna; Münn, Martin On Selfish Creation of Robust NetworksSymposium on Algorithmic Game Theory (SAGT) 2016: 141–152
     
  • Cseh, Ágnes; Irving, Robert W.; Manlove, David F. The Stable Roommates Problem with Short ListsSymposium Algorithmic Game Theory (SAGT) 2016: 207–219
     

2015

  • Cseh, Ágnes; Manlove, David F. Stable Marriage and Roommates Problems with Restricted Edges: Complexity and ApproximabilitySymposium Algorithmic Game Theory (SAGT) 2015: 15–26
     

2014

  • Cseh, Ágnes; Skutella, Martin Paths to Stable AllocationsSymposium Algorithmic Game Theory (SAGT) 2014: 61–73
     

2011

  • On Dynamics in Basic Netw... - Download
    Lenzner, Pascal On Dynamics in Basic Network Creation GamesSymposium on Algorithmic Game Theory (SAGT) 2011: 254–265