BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium : Games\, Learning\, and the Price of Anarchy
DTSTART:20141117T161500
DTEND:20141117T173000
DTSTAMP:20260916T044014Z
UID:d7a2bda484e125868d21968af452fcbc0d7f6994653b4beea91ce73a
CATEGORIES:Conferences - Seminars
DESCRIPTION:By : Eva Tardos - Cornell UniversityVideo of her talkAbstract 
 :\nSelfish behavior can often lead to suboptimal outcome for all participa
 nts\, a phenomenon illustrated by classical examples in game theory\, such
  as the prisoner dilemma . Yet\, many algorithms\, that are originally des
 igned without explicitly considering incentive properties\, are later used
  in settings when participants can act strategically. How good are they in
  the presence of strategic behavior? We'll will show robust guarantees for
  performance on a broad range of algorithms in presence of strategic behav
 ior of the participants.  Joint work with Paul Duetting and Thomas Kessel
 heim.Bio :\nEva Tardos is a Jacob Gould Schurman Professor of Computer Sci
 ence at Cornell University\, was Computer Science department chair 2006-20
 10. She received her BA and PhD from Eotvos University in Budapest. She jo
 ined the faculty at Cornell in 1989. She has been elected to the National 
 Academy of Engineering\, the National Academy of Sciences\, the American A
 cademy of Arts and Sciences\, is an external member of the Hungarian Acade
 my of Sciences\, and is the recipient of a number of fellowships and award
 s including the Packard Fellowship\, the Goedel Prize\, Dantzig Prize\, Fu
 lkerson Prize\, and the IEEE Technical Achievement Award. She was editor e
 ditor-in-Chief of SIAM Journal of Computing 2004-2009\, and is currently e
 ditor of several other journals including the Journal of the ACM and Combi
 natorica\, served as problem committee member for many conferences\, and w
 as program committee chair for SODA’96\, FOCS’05\, and EC’13.\nTardo
 s’s research interest is algorithms and algorithmic game theory\, the su
 barea of theoretical computer science theory of designing systems and algo
 rithms for selfish users. Her research focuses on algorithms and games on 
 networks.  She is most known for her work on network-flow algorithms\, ap
 proximation algorithms\, and quantifying the efficiency of selfish routing
 .More information
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR