Corvinus Game Theory Seminar

Room: Corvinus University of Budapest, Jenő Szép Room (Salt House S203)
Coordinators: Tamás Solymosi, Péter Biró, Miklós Pintér, Balázs Sziklai,

2019 Spring:

Time Speaker Title
January 18, 14:00-15:00
Room C:107, New bldg
Abdullah Dasci (Sabanci University, Turkey) Managing procurement from competing suppliers with limited capacities
January 23-24 Advances in Stochastic Games Free workshop at Budapest U. of Technology and Economics, Registration required
January 25, 14:00-15:00 Antonio Nicoló (University of Padova, Italy) Stable and efficient task assignment to pairs
February 8, 13:40-14:40 Tamás Solymosi (Corvinus University) On the Shapley value of liability games
February 15, 13:40-14:40 Radu-Stefan Mincu (University of Bucharest, Romania) IP solutions for international kidney exchange programmes
February 22, 13:40-14:40 Miklós Pintér (Budapest U. of Technology and Economics; Corvinus U.) How to play ambiguously
March 1, 13:40-14:40
Room C:109, New bldg
Gyula Seres (Humboldt University, Germany) On the competitive effects of screening in procurement
March 8, 13:40-14:40
Room C:105, New bldg
Gábor Neszveda (Corvinus University) The Achilles' heel of salience theory and a way to fix it
March 22, 13:40-14:40
Room C:105, New bldg
László Csató (MTA SzTAKI and Corvinus) Optimal tournament design: two case studies in handball
March 29, 13:40-14:40
Room C:109, New bldg
Mánuel Mágó (Corvinus University) The average connected contribution value for graph games
April 5, 13:40-14:40
Room C:416, New bldg
Róbert Somogyi (Budapest University of Technology and Economics) Bertrand-Edgeworth competition with capacity uncertainty - Feasting on leftovers
April 12, 13:40-14:40
Auditorium S:I, Salthouse bldg
Kolos Ágoston (Corvinus University) Mixed Integer LP Formulations in cluster analysis (Habilitation presentation)
May 3, 13:40-14:40 Jacek Szybowski (AGH University, Kraków, Poland) Title
May 10, 13:40-14:40 Speaker (Affiliation) Title
June 7, 14:00-15:00 Szilvia Pápai (Concordia University, Canada) Matching with consecutive acceptance intervals

Previous talks