Home
Hasso-Plattner-Institut
Hasso-Plattner-Institut
Prof. Dr. Tobias Friedrich
 

schließen

schließen

schließen

schließen

schließen

schließen

schließen

schließen

    11.07.2022

    Three papers accepted at EC and PPSN

    Last year, Pascal Führlich wrote his master thesis with our group. The contents of this thesis were now accepted with the title Improving Ranking Quality and Fairness in Swiss-System Chess Tournaments at the Conference on Economics and Computation (EC), which will take place at the University of Colorado Boulder, USA on July 11-15. The paper considers tournament scheduling for Swiss-system chess tournaments. Novel pairing rules are presented that are based on maximum weight matchings. It is shown empirically that these new pairing rules outperfom the state-of-the-art solution endorsed by the International Chess Federation (FIDE) in terms of ranking quality and also in terms of fairness of the derived tournament pairings.

    Our group also recently had two papers accepted at Parallel Problem Solving from Nature (PPSN) taking place in Dortmund on September 10-14. The first paper was written by Amirhossein Rajabi, who recently visited us, together with former and current members of our group. The paper Escaping Local Optima With Local Search: A Theory-Driven Discussion focuses on different strategies employed to augment local search to help avoid being stuck in a local optimum. An important learning is that different strategies handle some underlying search space characteristics better and others worse. From the results one can see what characteristics of a given search space to look out for to decide what augmentation of local search to employ.

    In the second paper Theoretical Study of Optimizing Rugged Landscapes with the cGA, Aishwarya Radhakrishnan with further group members and another recent visitor of our group, Frank Neumann, contributed to the theoretical understanding of EDAs and pointed out that their distribution approach makes them more suitable to deal with rugged fitness landscapes than classical local search algorithms. In particular, they showed that Compact Genetic Algorithm (cGA) performs better than RLS and (1+1) EA.

    • Improving Ranking Quality... - Download
      Führlich, Pascal; Cseh, Ágnes; Lenzner, Pascal Improving Ranking Quality and Fairness in Swiss-System Chess TournamentsACM Conference on Economics and Computation (EC) 2022: 1101–1102
      [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
       
    • Topological Influence and... - Download
      Bilò, Davide; Bilò, Vittorio; Lenzner, Pascal; Molitor, Louise Topological Influence and Locality in Swap Schelling GamesAutonomous Agents and Multi-Agent Systems (AGNT) 2022: 47
      [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
       
    • Theoretical Study of Opti... - Download
      Friedrich, Tobias; Kötzing, Timo; Neumann, Frank; Radhakrishnan, Aishwarya Theoretical Study of Optimizing Rugge Landscapes with the cGAParallel Problem Solving From Nature (PPSN) 2022: 586–599
      [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]
       
    • Escaping Local Optima Wit... - Download
      Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S.; Rajabi, Amirhossein Escaping Local Optima With Local Search: A Theory-Driven DiscussionParallel Problem Solving from Nature (PPSN) 2022: 442–455
      [ Abstract ] [ BibTeX ] [ URL ] [ DOI ] [ Download ]