BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Picture yourself in a committee numerically evaluating a scien
 tific proposal that you find worth funding: A rating of &quot;0&quot; means &quot;easily a
 chievable but not at all innovative&quot;\, whereas &quot;1&quot; means &quot;very innovative b
 ut totally unachievable&quot;. In both cases\, funding is not recommended. In co
 ntrast\, &quot;1/2&quot; means &quot;innovative and achievable&quot;\, in other words: worth fu
 nding. All intermediate values are possible. Any rating that is closer to &quot;
 1/2&quot; than to &quot;1/4&quot; and &quot;3/4&quot; is considered a vote for funding. The proposal
  passes if 50% of the members support funding\, i.e.\, rate the proposal be
 tween &quot;1/2 - 1/8&quot; and &quot;1/2 + 1/8&quot;. Now\, there are 10 meetings ahead of you
 . You have an idea how the opinions of the committee members develop. How s
 hould your statements look like in the meetings one through ten if you want
  to have eventually as many supporters of the proposal as possible? This is
  an instance of the &quot;Optimal Diplomacy Problem&quot; (ODP)\, introduced by Hegse
 lmann\, König\, Kurz\, Niemann\, and Rambau in 2010\, published in 2015. Ho
 w do opinions interact? How is the dynamics of opinions modeled mathematica
 lly? What does it mean to &quot;influence others&quot; in this dynamical system? How 
 difficult is it to find optimal diplomacies? How can one compute or at leas
 t narrow down optimal diplomacies? What happens if not all informations abo
 ut committee members are known to the diplomat? In this talk we will discus
 s our findings\, techniques\, and open questions based on the arguably most
  influential model: the Bounded-Confidence model by Hegselmann and Krause. 
 We draw on joint work with Andreas Deuerling\, Rainer Hegselmann\, Stefan K
 önig\, Julia Kinkel\, Sascha Kurz\, and Christoph Niemann. 
DTSTAMP:20181120T171100
DTSTART:20181119T141500
CLASS:PUBLIC
LOCATION:Technische Universität Berlin Institut für Mathematik Straße des 1
 7. Juni 136 10623 Berlin Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Jörg Rambau (Universität Bayreuth): Optimal Diplomacy
UID:92314740@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20181119-L-Ram
 bau.html
END:VEVENT
END:VCALENDAR
