BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20260329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260416T222503Z
UID:69a04ff97f19f809141205@ist.ac.at
DTSTART:20260312T133000
DTEND:20260312T143000
DESCRIPTION:Speaker: Antoine El-Hayek\nAbstract: In population protocols\, 
 n different agents\, which one can think of as tiny mobile computers with 
 limited memory\, run an algorithm to try and solve a particular problem\, 
 using pairwise interactions. Consider the relative majority problem: each 
 agent is given an opinion among k many\, the agents have to compute the op
 inion that is the most represented. In this talk\, we will run an algorith
 m that solves the relative majority problem: I will ask each of you to pla
 y the role of an agent\, and we will run the algorithm collectively and ch
 aotically. Expect to move around\, interact with each other\, and not do a
  lot of sitting down. This will show how stable this surprising algorithm 
 is to different parameters\, including human error.
LOCATION:Moonstone Bldg / Ground floor / Seminar Room G (I24.EG.030g)\, IST
 A
ORGANIZER:achaturv@ist.ac.at
SUMMARY:Antoine El-Hayek: Interactive TCS Seminar
URL:https://talks-calendar.ista.ac.at/events/6339
END:VEVENT
END:VCALENDAR