Skip to main content

The International Symposium on Algorithmic Game Theory (SAGT) 2025 Program

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


Factsheet

** Tuesday, September 2, 2025 -- Tutorial and Reception**

Start Finish Description
15:00 15:30 Registration
15:30 16:30 Tutorial 1 -- General Evaluation of AI Agents - Ian Gemp (Chair: Ron Lavi)
16:30 17:00 Break (refreshments)
17:00 18:00 Tutorial 2 -- General Evaluation of AI Agents - Ian Gemp (Chair: Jie Zhang)
18:00 19:00 Posters + Reception + Registration

** Wednesday, September 3, 2025 -- Conference Day 1**

Start Finish Description
09:30 10:00 Registration and Coffee
10:00 10:10 Opening Remarks (Chair: Ron Lavi & Jie Zhang)
10:10 11:10 Invited Talk: Recent Progress on Approximating Nash Equilibria -- Evangelos Markakis (Chair: Jie Zhang)
11:10 11:40 Coffee Break
11:40 12:40 Session 1 : Facility Location (Chair: Georgios Amanatidis)
- - Constant-Approximate and Constant-Strategyproof Two-Facility Location - Elijah Fullerton, Zeyuan Hu, Greg Plaxton
- - Constrained Truthful Obnoxious Two-Facility Location with Optional Preferences - Panagiotis Kanellopoulos, Alexandros Voudouris
- - Hotelling-Downs with Facility Synergy: The Mall Effect - Elliot Anshelevich, Jianan Lin, Noah Prisament
12:40 13:40 Lunch
13:40 15:00 Session 2: Computational and Algorithmic Aspects of Games (Chair: Kristoffer Arnsfelt Hansen)
- - Mixed Nash Equilibria in Discrete Tullock Contests - Vittorio Bilò, Marios Mavronicolas, Paul Spirakis, Daniel Windisch
- - On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback - Arnab Maiti, Kevin Jamieson, Lillian Ratliff
- - On the Effect of Time Preferences on the Price of Anarchy - Yunpeng Li, Antonis Dimakis, Costas Courcoubetis
- - Coordination Mechanisms on Unrelated Machines with Arbitrary Priority Lists - Shani Caduri and Tami Tamir
15:00 15:30 Coffee Break
15:30 16:50 Session 3: Mechanism Design and Algorithmic Contracts (Chair: Pascal Lenzner)
- - Deterministic Refund Mechanisms - Saeed Alaei, Shuchi Chawla, Zhiyi Huang, Ali Makhdoumi, Azarakhsh Malekian
- - Robustness of Voting Mechanisms to External Information - Yiling Chen, Jessica Finocchiaro
- - Online Budget-Feasible Mechanism Design with Predictions - Georgios Amanatidis, Evangelos Markakis, Christodoulos Santorinaios, Guido Schäfer, Panagiotis Tsamopoulos, Artem Tsikiridis
- - Linear Contracts for Supermodular Functions Based on Graphs - Kanstantsin Pashkovich and Jacob Skitsko
17:00 17:30 Business Meeting (Chair: Ron Lavi & Jie Zhang)

** Thursday, September 4, 2025 -- Conference Day 2**

Start Finish Description
09:30 10:00 Coffee
10:00 11:00 Invited Talk: Combining Game Theory and Machine Learning to Refine Interaction Strategies – Yoram Bachrach (Chair: Ron Lavi)
11:00 11:30 Coffee Break
11:30 12:30 Session 4: Bayesian Decision Making (Chair: Jie Zhang)
- - Persuading Agents in Opinion Formation Games - Martin Hoefer, Tim Koglin, Tolga Tel
- - Bayesian Optimal Stopping with Maximum Value Knowledge - Pieter Kleer, Daan Noordenbos
- - A Truthful and Accurate Forecasting Competition Mechanism on Bayesian Network Structured Events - Chun Lau, David Pennock, Daniel Schoepflin
12:30 13:30 Lunch
13:30 14:30 Session 5: Markets and Matching (Chair: Ron Lavi)
- - Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching - Frederik Glitzner, David Manlove
- - Course Allocation with Credits via Stable Matching - José Antonio Rodríguez Bacallado, David Manlove
- - Social Welfare in Battery Charging Games - Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Tobias Sträubig
14:30 16:00 Coffee Break and Poster session
16:30 18:30 Walking tour – Outside the Roman Baths
18:45 21:00 Dinner at the Botanist

** Friday, September 5, 2025 -- Conference Day 3**

Start Finish Description
09:30 10:00 Registration – Coffee
10:00 11:00 Session 6: Fair Division and Resource Allocation (Chair: Ioannis Caragiannis
- - Tractable Graph Structures in EFX Orientation - Václav Blažej, Sushmita Gupta, M.S. Ramanujan, Peter Strulo
- - Online Fair Division for Personalized 2-Value Instances - Georgios Amanatidis, Alexandros Lolos, Evangelos Markakis, Victor Turmel
- - 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, Makoto Yokoo
11:00 11:30 Coffee Break
11:30 12:30 The Algorithmic Nature of (Some) Simple Mechanisms - Carmine Ventre (Chair: Jie Zhang)
12:30 13:30 Lunch
13:30 14:30 Session 7: Computational Social Choice (Chair: Ioannis Caragiannis)
- - Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule - Negar Babashah, Hasti Karimi, Masoud Seddighin, Golnoosh Shahkarami
- - Metric Distortion under Group-Fair Objectives - Georgios Amanatidis, Elliot Anshelevich, Christopher Jerrett, Alexandros Voudouris
- - Near-Linear MIR Algorithms for Stochastically-Ordered Priors - Gal Bahar, Omer Ben-Porat, Kevin Leyton-Brown, Moshe Tennenholtz
14:30 15:00 Coffee Break
15:00 16:20 Session 8: Hardness and Approximation (Chair: Aris Filos-Ratsikas)
- - Fairness under Equal-Sized Bundles: Impossibility results and Approximation Guarantees - Alviona Mancho, Evangelos Markakis, Nicos Protopapas
- - Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps - Simon Dohn, Kristoffer Arnsfelt Hansen, and Asger Klinkby
- - A new lower bound for multi-color discrepancy with applications to fair division - Ioannis Caragiannis, Kasper Green Larsen, and Sudarshan Shyam
- - When is Truthfully Allocating Chores no Harder than Goods? - Bo Li, Biaoshuai Tao, Fangxiao Wang, Xiaowei Wu, Mingwei Yang, and Shengwei Zhou
16:20 16:20 End

On this page