BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20240111T121500
DTEND;TZID=Europe/Helsinki:20240111T133000
DTSTAMP:20260710T223431
CREATED:20240103T183620Z
LAST-MODIFIED:20241104T135410Z
UID:16400-1704975300-1704979800@crest.science
SUMMARY:Yuki Tamura (NYU Abu Dhabi) "Obviously Strategy-proof Rules for Object Reallocation”
DESCRIPTION:Micro Seminar \nTime: 12:15 pm – 13:30 pm\nDate: 11th of January\nRoom : 3001 \nYuki Tamura (NYU Abu Dhabi) “Obviously Strategy-proof Rules for Object Reallocation” \n  \nAbstract : For object reallocation problems\, Bade (2019) defines a rule\, the “crawler”\, and shows that on the domain of single-peaked preferences\, this rule satisfies efficiency\, the endowments lower bounds\, and obvious strategy-proofness. Her result raises the question if other rules exist that satisfy these properties. We provide a complete answer to this question. Based on the idea of the crawler\, we obtain a family of rules that we call “crawler-jumper rules”. We show that a rule satisfies efficiency\, the endowments lower bounds\, and obvious strategy-proofness if and only if it is a crawler-jumper rule. \n  \nOrganizers: Julien COMBE\n \n
URL:https://crest.science/event/yuki-tamura-nyu-abu-dhabi-obviously-strategy-proof-rules-for-object-reallocation/
CATEGORIES:Applied Seminar,Economics,Seminars
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR