|
14 Oct 2020 |
Paul Spirakis
|
Computing second Hamiltonian cycles
|
|
28 Oct 2020 |
Dario Paccagnan
Imperial College London |
Optimal Taxes in Atomic Congestion Games
|
|
04 Nov 2020 |
Rasmus Ibsen-Jensen
|
One-clock priced time games
|
09 Nov 2020
dept
|
Dr. Vangelis Markakis
Department of Informatics, Athens University of Economics and Business |
Approximation Guarantees for Fairness Notions under Indivisible Resources
|
|
11 Nov 2020 |
Estelle Varloot
|
Strategy-proof voting rules
|
20 Nov 2020
dept
|
Bryce Sandlund
Cheriton School of Computer Science, University of Waterloo |
Lazy Search Trees
|
|
25 Nov 2020 |
Philip Lazos
Sapienza Universita di Roma |
Truthful mechanisms for two-sided markets
|
|
02 Dec 2020 |
Julian Nickerl
Ulm University |
Congestion Games: The Minimum Tollbooth Problem and Games with Uncertainty
|
|
09 Dec 2020 |
Nikos Protopapas
University of Liverpool |
Truthful aggregation of budget proposals with proportionality guarantees
|
10 Dec 2020
networks
|
George Mertzios
Durham University |
Temporal vertex covers and sliding time windows
|
|
11 Dec 2020 |
Giorgios Christodoulou
University of Liverpool |
On the Nisan-Ronen conjecture
|
|
16 Dec 2020 |
John Fearnley
University of Liverpool |
A faster algorithm for finding Tarski fixed points
|
14 Jan 2021
networks
|
Nathan Harms
University of Waterloo |
Universal Communication, Universal Graphs, and Graph Labeling
|
22 Jan 2021
networks
|
Emanuele Rossi
Twitter and Imperial College |
Machine Learning on Dynamic Graphs: Temporal Graph Networks
|
|
03 Feb 2021 |
Alkmini Sgouritsa
University of Liverpool |
A Little Charity Guarantees Almost Envy-Freeness
|
|
24 Feb 2021 |
Aris Filos-Ratsikas
University of Liverpool |
On the Complexity of Equilibrium Computation in First-Price Auctions
|
|
03 Mar 2021 |
Martin Gairing
University of Liverpool |
In Congestion Games, Taxes Achieve Optimal Approximation
|
|
17 Mar 2021 |
Themistoklis Melissourgos
Technical University of Munich |
Walrasian Equilibria in Markets with Small Demands
|
18 Mar 2021
dept
|
Dr. Rotem Oshman
Department of Computer Science, Tel-Aviv University |
Interactive Distributed Proofs
|
|
21 Apr 2021 |
Estelle Varloot
University of Liverpool |
Level-strategyproof belief aggregation mechanisms
|
22 Apr 2021
dept
|
Prof. Damien Woods
Computer Science, Hamilton Institute, Maynooth University |
Molecular Algorithms Using Reprogrammable DNA Self-Assembly
|
|
28 Apr 2021 |
Piotr Krysta
|
Efficient Truthful Scheduling and Resource Allocation through Monitoring
|
|
12 May 2021 |
Rida Laraki
University of Liverpool |
On Sustainable Equilibria
|
|
02 Jun 2021 |
Rahul Savani
University of Liverpool |
The Complexity of Gradient Descent
|
|
30 Jun 2021 |
Argyrios Deligkas
Royal Holloway University of London |
Square-Cut Pizza Sharing is PPA-complete
|
