BEGIN:VCALENDAR
PRODID:-//Grails iCalendar plugin//NONSGML Grails iCalendar plugin//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260517T024824Z
DTSTART;TZID=Australia/Melbourne:20160401T070000
DTEND;TZID=Australia/Melbourne:20160401T090000
SUMMARY:From Iterated Revision to Iterated Contraction
UID:20260525T031427Z-iCalPlugin-Grails@philevents-web-6b96c54f56-bljdq
TZID:Australia/Melbourne
LOCATION:Old Quad\, Parkville\, Australia\, 3010
DESCRIPTION:<p>Jake Chandler (La Trobe) will give a talk titled "From Iterated Revision to Iterated Contraction". This talk is joint work with&nbsp\;Richard Booth (Cardiff).&nbsp\;</p>\n<p>Abstract: While a substantial body of research has now accumulated on the problem of iterated belief revision\, work on the parallel problem of iterated contraction remains comparatively underdeveloped.</p>\n<p>One obvious way to level out this discrepancy would be to introduce a bridge principle that enables us to derive\, from constraints on iterated revision\, corresponding constraints on iterated contraction. But while there exists a well known and widely accepted postulate connecting single-shot revision and contraction\, namely the &lsquo\;Harper Identity&rsquo\;\, there has been no suggestion to date as to how to extend this principle to the iterated case.</p>\n<p>After noting that the problem at hand is essentially one of aggregating a pair of preference relations\, we consider a new family of binary preference aggregators\, (a) whose characteristic properties enable us to derive some noteworthy results regarding iterated belief change and (b) whose extension to the n-ary case may also be of potential interest in the field of social choice.&nbsp\;</p>\n
ORGANIZER;CN=Shawn Standefer:
METHOD:PUBLISH
END:VEVENT
END:VCALENDAR
