BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20251104T102000
DTEND;TZID=Europe/Paris:20251104T112000
DTSTAMP:20260419T010538
CREATED:20251017T094128Z
LAST-MODIFIED:20251017T094128Z
UID:11981-1762251600-1762255200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : Paul Dorbec (GREYC) « How can the balance game be so unfair? »
DESCRIPTION:The balance game is played on a graph G by two players\, Admirable (A) and Impish (I)\, who take turns selecting unlabeled vertices of G\, coloring them with their own color. The discrepancy in the balance game is defined as the difference of the number of well colored edges minus the number of monochromatic edges. The two players have opposite goals: Admirable attempts to minimize the discrepancy while Impish attempts to maximize d. \nDuring this talk\, we will show bounds on the discrepancy of graphs\, showing that the game is strongly biased in favor of Impish.
URL:https://www.greyc.fr/event/seminaire-algorithmique-paul-dorbec-greyc-how-can-the-balance-game-be-so-unfair/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR