BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260408T120230Z
UID:Seminar-EcCo-614@lxserverA.csc.liv.ac.uk.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20191211T130000
DTEND:20191211T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Guy Avni: Infinite-Duration Bidding Games\n\nGraph games are two-player zero-sum games of infinite duration. The game proceeds by placing a token on a vertex in the game graph and allowing the two players to move it throughout the graph thereby producing an infinite path, which determines the payoff of the game. Bidding games are graph games in which in each turn, an auction is held in order to determine which player moves the token. We study the effect that the auction mechanism has on the properties of the game. Specifically, I will describe an intriguing equivalence between bidding games with first-price auctions and a fragment of stochastic games called “random-turn games”, and how changes to the auction mechanism lead to different equivalences. I will conclude by surveying directions for future work and describe our preliminary results in these directions.\n\nThe talk will cover results from the following papers:\n\n Guy Avni, Thomas A. Henzinger, Ventsislav Chonev:\nInfinite-Duration Bidding Games. CONCUR 2017\n(this one has a J.acm journal version as well)\n\n Guy Avni, Thomas A. Henzinger, Dorde Zikelic:\nBidding Mechanisms in Graph Games. MFCS 2019\n\n Guy Avni, Thomas A. Henzinger, Rasmus Ibsen-Jensen:\nInfinite-Duration Poorman-Bidding Games. WINE 2018\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=614
LOCATION:
END:VEVENT
END:VCALENDAR