Programme


A PDF of the programme can be found here

The conference starts with a reception at 7pm on Sunday 18th September at Matou Pan Asian Restaurant. The talks take place on Monday 19th, Tuesday 20th, and half of Wednesday 21st September 2016 at the Hilton Liverpool City Center. The conference dinner is at 7pm on Tuesday 20th September at the The Racquet Club (map here).

Quick links to the program for: Monday; Tuesday; Wednesday.


7pm Sunday 18th September - Reception at Matou Pan Asian Restaurant







Monday 19th September


09:30-10:30Invited talk - A Normalized Value for Information PurchasesOlivier Gossner
10:30-11:00Coffee
11:00-11:20Logarithmic Query Complexity for Approximate Nash Computation in Large GamesPaul Goldberg, Francisco J. Marmolejo Cossio and Zhiwei Steven Wu
11:20-11:40Lipschitz Continuity and Approximate EquilibriaArgyrios Deligkas, John Fearnley and Paul Spirakis
11:40-12:00The parallel complexity of coloring gamesGuillaume Ducoffe
12:00-12:20Complexity and Optimality of the Best Response Algorithm in Random Potential GamesStéphane Durand and Bruno Gaujal
12:20-14:00Lunch
14:00-14:30The Big Match in Small Space (BEST PAPER)Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen and Michal Koucky
14:30-14:50Deciding Maxmin Reachability in Half-Blind Stochastic GamesEdon Kelmendi and Hugo Gimbert
14:50-15:10History-Independent Distributed Multi-Agent LearningAmos Fiat, Yishay Mansour and Mariano Schain
15:10-15:30On the Robustness of the Approximate Price of Anarchy in Generalized Congestion GamesVittorio Bilò
15:30-16:00Coffee
16:00-16:20Efficiency of equilibria in uniform matroid congestion gamesJasper de Jong, Max Klimm and Marc Uetz
16:20-16:40On the Price of Anarchy of Highly Congested Nonatomic Network GamesRiccardo Colini-Baldeschi, Roberto Cominetti and Marco Scarsini
16:40-17:00The Impact of Worst-Case Deviations in Non-Atomic Network Routing GamesPieter Kleer and Guido Schaefer
17:00-17:20On Selfish Creation of Robust NetworksAnkit Chauhan, Pascal Lenzner, Anna Melnichenko and Martin Münn
18:00-19:30 Optional walking tour

Tuesday 20th September


09:30-10:30Invited talk - Linear Fisher Markets with SatiationKurt Mehlhorn
10:30-11:00Coffee
11:00-11:20Dynamic Resource Allocation GamesGuy Avni, Thomas A. Henzinger and Orna Kupferman
11:20-11:40Analyzing Power in Weighted Voting Games With Super-Increasing WeightsYoram Bachrach, Filmus Yuval, Joel Oren and Yair Zick
11:40-12:00Strong and Weak Acyclicity in Iterative VotingReshef Meir
12:00-12:20Stable Matching with Uncertain Linear PreferencesHaris Aziz, Peter Biro, Serge Gaspers, Ronald de Haan, Nicholas Mattei and Baharak Rastegari
12:20-14:00Lunch
14:00-14:20The Stable Roommates problem with short listsÁgnes Cseh, Robert W. Irving and David F. Manlove
14:20-14:40The price of stability of simple symmetric fractional hedonic gamesChristos Kaklamanis, Panagiotis Kanellopoulos and Konstantinos Papaioannou
14:40-15:00Truthfulness and Approximation with Value-Maximizing BiddersSalman Fadaei and Martin Bichler
15:00-15:20Envy-Free Revenue Approximation for Asymmetric Buyers with BudgetsEvangelos Markakis and Orestis Telelis
15:20-15:50Coffee
15:50-16:10SBBA: a Strongly-Budget-Balanced Double-Auction MechanismErel Segal-Halevi, Avinatan Hassidim and Yonatan Aumann
16:10-16:30Revenue Maximization for Market Intermediation with Correlated PriorsMatthias Gerstgrasser, Paul Goldberg and Elias Koutsoupias
16:30-16:50Bribeproof mechanisms for two-values domainsMatúš Mihalák, Paolo Penna and Peter Widmayer
16:50-17:10The Anarchy of Scheduling Without MoneyYiannis Giannakopoulos, Elias Koutsoupias and Maria Kyropoulou
19:00-Conference DinnerThe Racquet Club

Conference dinner


The conference dinner will take place at 7pm on Tuesday at the The Racquet Club.




Wednesday 21st September


09:30-10:30Invited talk - Mechanism Design for Learning AgentsCostis Daskalakis
10:30-11:00Coffee
11:00-11:20An almost ideal coordination mechanism for unrelated machine schedulingIoannis Caragiannis and Angelo Fanelli
11:20-11:40Designing cost-sharing methods for Bayesian GamesGeorge Christodoulou, Stefano Leonardi and Alkmini Sgouritsa
11:40-12:00Essential μ-compatible subgames for obtaining a von Neumann-Morgenstern stable set in an assignment gameKeisuke Bando and Yakuma Furusawa
12:00-12:20Repeated multimarket contact with observation errorsAtsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto and Makoto Yokoo
12:20-14:00Lunch
14:00The End