BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//https://techplay.jp//JP
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALDESC:Talk by Shunya Noda: Large Matching in Large Market with Flexi
 ble Supply\, Stanford University
X-WR-CALNAME:Talk by Shunya Noda: Large Matching in Large Market with Flexi
 ble Supply\, Stanford University
X-WR-TIMEZONE:Asia/Tokyo
BEGIN:VTIMEZONE
TZID:Asia/Tokyo
BEGIN:STANDARD
DTSTART:19700101T000000
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:JST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:685903@techplay.jp
SUMMARY:Talk by Shunya Noda: Large Matching in Large Market with Flexible S
 upply\, Stanford University
DTSTART;TZID=Asia/Tokyo:20180806T160000
DTEND;TZID=Asia/Tokyo:20180806T173000
DTSTAMP:20260428T102837Z
CREATED:20180719T020540Z
DESCRIPTION:イベント詳細はこちら\nhttps://techplay.jp/event/68590
 3?utm_medium=referral&utm_source=ics&utm_campaign=ics\n\nインセンテ
 ィブサイエンスの算法セミナー\n\nShunya Noda (Stanford Unive
 rsity) \nLarge Matching in Large Market with Flexible Supply\n\nWe study 
 truthful mechanisms that achieve a large size of matching (expected numbe
 r of agents matched to some objects) in an environment where the planner 
 can decide which and how many objects to provide subject to linear upper 
 bound constraints. Naïve extensions of the classical serial mechanisms m
 ay generate an arbitrarily small matching in such environments. Assuming 
 the market to be large (in that the variety of objects is fixed but the c
 apacity to be large)\, we establish several mechanisms that have a consta
 nt guarantee for the size achieved. As a main result\, we propose the ada
 ptive parallel polymatroid serial mechanism\, which (i) is not too comput
 ationally difficult to implement\, (ii) achieves 1-1/e ≈ 63.2% of the m
 aximum feasible size even in the worst case\, and (iii) keeps agents' cho
 ice sets as large as possible.
LOCATION: 理化学研究所 革新知能統合研究センター (AIP) 会
 議室３ 〒103-0027 東京都中央区日本橋1-4-1 日本橋一丁目
 三井ビルディング 15階
URL:https://techplay.jp/event/685903?utm_medium=referral&utm_source=ics&utm
 _campaign=ics
END:VEVENT
END:VCALENDAR