Skip to main content

Accepted Papers

Learn more about the accepted papers for the 18th International Symposium on Algorithmic Game Theory.


Factsheet

  • On the Effect of Time Preferences on the Price of Anarchy
    Yunpeng Li, Antonis Dimakis and Costas Courcoubetis
  • When is Truthfully Allocating Chores no Harder than Goods?
    Bo Li, Biaoshuai Tao, Fangxiao Wang, Xiaowei Wu, Mingwei Yang and Shengwei Zhou
  • Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps
    Simon Dohn, Kristoffer Hansen and Asger Klinkby
  • Deterministic Refund Mechanisms
    Saeed Alaei, Shuchi Chawla, Zhiyi Huang, Ali Makhdoumi and Azarakhsh Malekian
  • Metric Distortion under Group-Fair Objectives
    Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett and Alexandros Voudouris
  • Hotelling-Downs with Facility Synergy: The Mall Effect
    Elliot Anshelevich, Jianan Lin and Noah Prisament
  • Persuading Agents in Opinion Formation Games
    Martin Hoefer, Tim Koglin and Tolga Tel
  • Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences
    Panagiotis Kanellopoulos and Alexandros Voudouris
  • Coordination Mechanisms on Unrelated Machines with Arbitrary Priority Lists
    Shani Caduri and Tami Tamir
  • On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
    Arnab Maiti, Kevin Jamieson and Lillian Ratliff
  • Near-Linear MIR Algorithms for Stochastically-Ordered Priors
    Gal Bahar, Omer Ben-Porat, Kevin Leyton-Brown and Moshe Tennenholtz
  • Mixed Nash Equilibria in Discrete Tullock Contests
    Vittorio Bilo, Marios Mavronicolas, Paul Spirakis and Daniel Windisch
  • Online Fair Division for Personalized 2-Value Instances
    Georgios Amanatidis, Alexandros Lolos, Evangelos Markakis and Victor Turmel
  • Course Allocation with Credits via Stable Matching
    José Antonio Rodríguez Bacallado and David Manlove
  • A Truthful and Accurate Forecasting Competition Mechanism on Bayesian Network Structured Events
    Chun Lau, David Pennock and Daniel Schoepflin
  • Robustness of voting mechanisms to external information
    Yiling Chen and Jessica Finocchiaro
  • Linear Contracts for Supermodular Functions Based on Graphs
    Kanstantsin Pashkovich and Jacob Skitsko
  • Social Welfare in Battery Charging Games
    Simon Krogmann, Pascal Lenzner, Alexander Skopalik and Tobias Sträubig
  • Online Budget-Feasible Mechanism Design with Predictions
    Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schaefer, Panagiotis Tsamopoulos and Artem Tsikiridis
  • Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
    Frederik Glitzner and David Manlove
  • Tractable Graph Structures in EFX Orientation
    Václav Blažej, Sushmita Gupta, Ramanujan Sridharan and Peter Strulo
  • Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule
    Negar Babashah, Hasti Karimi, Masoud Seddighin and Golnoosh Shahkarami
  • Bayesian Optimal Stopping with Maximum Value Knowledge
    Pieter Kleer and Daan Noordenbos
  • A new lower bound for multi-color discrepancy with applications to fair division
    Ioannis Caragiannis, Kasper Green Larsen and Sudarshan Shyam
  • Constant-Approximate and Constant-Strategyproof Two-Facility Location
    Zeyuan Hu, Greg Plaxton and Elijah Fullerton
  • Whoever Said Money Won’t Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
    Noga Klein Elmalem, Haris Aziz, Rica Gonen, Xin Huang, Kei Kimura, Indrajit Saha, Erel Segal-Halevi, Zhaohong Sun, Mashbat Suzuki and Makoto Yokoo
  • Fairness under Equal-Sized Bundles: Impossibility results and Approximation Guarantees
    Alviona Mancho, Evangelos Markakis, Nicos Protopapas

On this page