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:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20190916T110000
DTEND;TZID=Europe/Helsinki:20190916T120000
DTSTAMP:20260713T041636
CREATED:20190827T144833Z
LAST-MODIFIED:20190827T144833Z
UID:12311-1568631600-1568635200@crest.science
SUMMARY:Julien Combe : "Unpaired Kidney Exchange: Overcoming Double Coincidence of Wants without Money"
DESCRIPTION:CREST Internal Seminar in Microeconomics :  \n\nPlace: Room 3105\n  \nAbstract: We propose a new matching algorithm—Unpaired kidney exchange—to tackle the problem of double coincidence of wants without using money. The fundamental idea is that “memory” can serve as a medium of exchange. In a dynamic matching model with heterogeneous agents\, we prove that average waiting time under the Unpaired algorithm is close-to optimal\, and substantially less than the standard pairwise and chain exchange algorithms. We evaluate this algorithm using a rich dataset of the kidney patients in France. Counterfactual simulations show that the Unpaired algorithm can match nearly 57% of the patients\, with an average waiting time of 424 days (state-of-the-art algorithms match about 31% with an average waiting time of 675 days or more). The optimal algorithm performs only slightly better: it matches 58% of the patients and leads to an average waiting time of 410 days. The Unpaired algorithm confronts two incentive-related practical challenges. We address those challenges via a practical version of the Unpaired algorithm that employs kidneys from the deceased donors waiting list. The practical version can match nearly 87% of patient-donor pairs\, while reducing the average waiting time to about 141 days. \n\n\n\nOrganizers:\nAlexis Larousse (CREST)\nSponsors:\nCREST\n\n  \n
URL:https://crest.science/event/julien-combe-unpaired-kidney-exchange-overcoming-double-coincidence-of-wants-without-money/
LOCATION:3105
END:VEVENT
END:VCALENDAR