BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Ical
BEGIN:VTIMEZONE
TZID:Asia/Jerusalem
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:IST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20180323T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:IDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.52366.field_date.0@mathematics.huji.ac.il
DTSTAMP:20191122T152835Z
CREATED:20180207T131626Z
DESCRIPTION:Date: \n\n4:00pm to 5:00pm\n\n\n\n\nSee also: Game Theory & M
athematical Economics\, Events & Seminars\, SeminarsLocation: \n\nElath Ha
ll\, 2nd floor\, Feldman Building\, Edmond J. Safra Campus\n\n\nThe talk w
ill consider evolutionary games on graphs\, which is a generalization of m
atrix games to graphs\, using the solution concept of evolutionary stable
strategies. In evolutionary games on graphs\, there is a graph and a 2x2 m
atrix. Each node of the graph has a strategy of the matrix game - r or b -
and initially all nodes are r. Then\, a uniformly random node is made to
follow b and the following is repeated until the graph is all one strategy
again:1. Find the average payoff of each node when playing against their
neighbors in the graph (depending on their current strategies).2. Translat
e this into a probability distribution and pick a node.3. That node makes
a random neighbor follow its strategy.The question of interest is to find
an approximation of the probability that the graph eventually becomes all
b.We consider two special cases\, depending on the matrix: the matrix is c
onstant in each row (called constant selection or generalized Moran proces
s) or is an instance of the prisoners' dilemma.We show that the former can
be solved in polynomial time and the latter is PSPACE-hard and even for g
eneral matrices can be done in polynomial space. \n\n Export\n \n\n \n
subscribe iCal
DTSTART;TZID=Asia/Jerusalem:20171126T160000
DTEND;TZID=Asia/Jerusalem:20171126T170000
LAST-MODIFIED:20180207T131626Z
SUMMARY:Game Theory & Math Economics: Rasmus Ibsen-Jensen (IST Austria) - '
Computational Complexity of Evolutionary Games on Graphs'
URL;TYPE=URI:https://mathematics.huji.ac.il/event/game-theory-math-economic
s-rasmus-ibsen-jensen-ist-austria-computational-complexity
END:VEVENT
END:VCALENDAR