On the Average-Case Complexity of Predicting Round-Robin Tournaments

Dorothea Baumeister, Tobias Hogrebe. On the Average-Case Complexity of Predicting Round-Robin Tournaments. In Piotr Faliszewski, Viviana Mascardi, Catherine Pelachaud, Matthew E. Taylor, editors, 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022. pages 1542-1544, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2022. [doi]

@inproceedings{BaumeisterH22,
  title = {On the Average-Case Complexity of Predicting Round-Robin Tournaments},
  author = {Dorothea Baumeister and Tobias Hogrebe},
  year = {2022},
  url = {https://dl.acm.org/doi/10.5555/3535850.3536028},
  researchr = {https://researchr.org/publication/BaumeisterH22},
  cites = {0},
  citedby = {0},
  pages = {1542-1544},
  booktitle = {21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, Auckland, New Zealand, May 9-13, 2022},
  editor = {Piotr Faliszewski and Viviana Mascardi and Catherine Pelachaud and Matthew E. Taylor},
  publisher = {International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)},
  isbn = {978-1-4503-9213-6},
}