Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

04.07.2016

Paper accepted at SAGT 2016

The Symposium on Algorithmic Game Theory (SAGT) is one of the premier conferences on Algorithmic Game Theory and its purpose is to bring together researchers from Computer Science, Economics, Mathematics, Psychology, Physics, and Biology to present and discuss original research at the intersection of Algorithms and Game Theory.

The Algorithm Engineering group contributes the paper presented below.

Anna Melnichenko, a PhD students of the group, will receive student support from the ACM allowing her to present her research in Liverpool.

  • Cseh, Ágnes; Irving, Robert W.; Manlove, David F. The Stable Roommates Problem with Short ListsSymposium Algorithmic Game Theory (SAGT) 2016: 207–219
     
  • 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