Universität Bonn

Game Theory Workshop


December 14-17, 2015

HIM Lecture Hall,  Poppelsdorfer Allee 45

Organizers: 

Jochen Könemann, Ruta Mehta, Heiko Röglin, Bernhard von Stengel

Topics: Algorithmic and Computational Game Theory

Main speakers: 

  • Paul Duetting
  • Edith Elkind
  • Kurt Mehlhorn
  • Ruta Mehta
  • Rahul Savani
  • Chaitanya Swamy

Schedule

Monday, December 14

10:00 - 10:30 Registration & Welcome coffee
10:30 - 11:30 Lightning Talks
11:30 - 12:20 Chaitanya Swamy: Signaling in Bayesian Games
12:20 - 14:40 Lunch break
14:40 - 15:00 Aviad Rubinstein: ETH-Hardness for Symmetric Signaling in Zero-Sum Games
15:00 - 15:20 Yun Kuen (Marco) Cheung: Asynchronous Tatonnement and Coordinate Descent
15:20 - 15:40 Kousha Etessami: The complexity of computing a (quasi-)perfect equilibrium for n-player extensive form games of perfect recall
15:40 - 16:00 Jugal Garg: ETR-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria
16:00 - 16:30 Tea and cake
16:30 - 16:50 Agnes Cseh: Paths to stable allocations
16:50 - 17:10 Linda Farczadi: The nucleolus of matching games
17:10 - 17:30 Matthias Mnich: Stable Marriage with Covering Constraints – A Complete Computational Trichotomy
20:00 - Concert at the Arithmeum (Lennéstrasse 2): Leipziger Querflötenensemble Quintessenz - "Engelsklänge"

Tuesday, December 15

9:40 - 10:30 Rahul Savani: Polymatrix Games: Algorithms and Applications
10:30 - 11:00 Coffee break and group photo
11:00 - 11:20 Guido Schäfer: Efficient Equilibria in Polymatrix Coordination Games
11:20 - 11:40 Alexander Skopalik: Multilevel Network Games
11:40 - 12:00 Tobias Harks: Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion
12:00 - 14:10 Lunch break
14:10 - 15:00 Edith Elkind: Coalitional Games on Sparse Social Networks
15:00 - 16:00 Open problems
16:00 - 16:30 Tea and cake
16:30 - 16:50 Dominik Peters: Structural Tractability in Hedonic Games
16:50 - 17:10 Tamás Király: Complexity of finding equilibria in linear service-providing games
17:10 - 17:30 Rachel Cummings: The Strange Case of Privacy in Equilibrium Models
afterwards Reception

Wednesday, December 16

9:40 - 10:30 Kurt Mehlhorn: An improved combinatorial algorithm for linear Arrow-Debreu Markets and its implementation
10:30 - 11:00 Coffee break
11:00 - 11:20 Martin Hoefer: Efficient Algorithms for Unknown Markets
11:20 - 11:40 Adrian Vetta: On the Welfare of Ascending Auctions
11:40 - 12:00 Georgios Piliouras: What Nash did not know: Modern Topology and Game Theory
12:00 - 14:30 Lunch break
14:30 - 15:10 Ilan Adler: Economic-Combinatorial Games
15:10 - 16:00 Ruta Mehta: A Market for Scheduling, with Applications to Cloud Computing
16:00 - 16:30 Tea and cake
16:30 - 16:50 John Fearnley: Distributed Methods for Finding Approximate Equilibria
16:50 - 17:10 Umang Bhaskar: On the Existence of Low-Rank Explanations for Mixed Strategy Behavior
17:10 - 17:30 Vahab Mirrokni: Coordination Mechanisms and Price of Anarchy via Fenchel Duality

Thursday, December 17

9:40 - 10:30 Paul Dütting: Truthful Outcomes from Non-Truthful Position Auctions
10:30 - 11:00 Coffee break
11:00 - 11:20 Elisa Celis: Constrained Online Auctions
11:20 - 11:40 Zsuzsanna Jankó: Trading Networks with Bilateral Contracts
11:40 - 12:00 Neil Olver: Easy or Selfish Scheduling on Related Machines
12:00 - 15:00 Lunch break
15:00 - 15:20 Matthias Feldotto: Existence and Approximation of Pure Nash Equilibria in Bandwidth Allocation Games
15:20 - 15:40 Thomas Kesselheim: Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round
15:40 - 16:00 Martin Gairing: Cost-Sharing in Congestion Games
16:00 - 16:30 Tea and cake
17:00 - 18:00 Arithmeum tour (We walk together from HIM, leaving at 16:45.)

Participants

Person
Affiliation
Period of stay
Ahmad Abdi University of Waterloo
Ilan Adler University of California
Sara Ahmadian University of Waterloo
Alexander Apke Universität zu Köln
Umang Bhaskar Tata Institute of Fundamental Research
Toni Böhnlein Universität zu Köln
Elisa Celis EPFL
Yun Kuen Cheung University of Vienna
Agnes Cseh TU Berlin
Rachel Cummings California Institute of Technology
Daniel Dadush Centrum Wiskunde en Informatica
Jesus De Loera University of California
Paul Duetting ETH Zürich
Edith Elkind University of Oxford
Kousha Etessami University of Edinburgh
Linda Farczadi EPFL
John Fearnley University of Liverpool
Matthias Feldotto University of Paderborn
Elisabeth Finhold UC Davis
Martin Gairing University of Liverpool
Jugal Garg Max-Planck-Institut for Informatics
Corinna Gottschalk RWTH Aachen
Tobias Harks Maastricht University
Stephan Held Universität Bonn
Stefan Hougardy Universität Bonn
Martin Höfer Max-Planck-Institut für Informatik
Zsuzsanna Jankó Eötvös Loránd University
Marek Karpinski Universität Bonn
Thomas Kesselheim Max-Planck-Institut für Informatik
Tamás Király Eötvös University Budapest
Bernhard Korte Universität Bonn
Jochen Könemann University of Waterloo
Roland Mainka Universität zu Köln
Nimrod Megiddo IBM Allmaden Research Center
Kurt Mehlhorn MPI Informatik
Ruta Mehta Georgia Institute of Technology
Vahab Mirrokni Google Research
Matthias Mnich Universität Bonn
Yasamin Nazari INRIA Rennes
Alantha Newman CNRS
Neil Olver VU University Amsterdam & CWI
Kanstantsin Pashkovich University of Waterloo
Britta Peis RWTH Aachen
Dominik Peters University of Oxford
Georgios Piliouras Singapore University of Technology and Design
Aviad Rubinstein UC Berkeley
Heiko Röglin Universität Bonn
Rahul Savani University of Liverpool
Guido Schäfer Centrum Wiskunde & Informatica
Alexander Skopalik University of Paderborn
Bernhard von Stengel London School of Economics
Chaitanya Swamy University of Waterloo
Troels Bjerre Sørensen IT-University of Copenhagen
Louis Theran Aalto University
Laura Vargas Koch RWTH Aachen
Adrian Vetta McGill University
Jens Vygen Universität Bonn
Anke van Zuylen College of William & Mary
Wird geladen