BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T052059Z
UID:Seminar-EcCo-583@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20181017T130000
DTEND:20181017T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Rida Laraki: Acyclic Gambling Games\n\nWe consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino. Under natural assumptions (such as continuous running payoff and non expansive transitions), we consider for each discount factor the value v ? of the ?-discounted stochastic game and investigate its limit when ? goes to 0. We show that under a strong acyclicity condition, the limit exists and is characterized as the unique solution of a system of functional equations: the limit is the unique continuous excessive and depressive function such that each player, if his opponent does not move, can reach the zone when the current payoff is at least as good than the limit value, without degrading the limit value. The approach generalizes and provides a new viewpoint on the Mertens-Zamir system coming from the study of zero-sum repeated games with lack of information on both sides. A counterexample shows that under a slightly weaker notion of acyclicity, convergence of (v ?) may fail.\n\nJoint work with Jérôme Renault.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=583
LOCATION:
END:VEVENT
END:VCALENDAR