対称性を満たすM凸集合の和集合で表現される制約を扱うマッチングメカニズムの提案

• Material Type: 記事
• Title: 対称性を満たすM凸集合の和集合で表現される制約を扱うマッチングメカニズムの提案
• Volume: JSAI2018; 0
• Author/Editor: 張 語哲; 八尋 健太郎; Barrot Nathanael; 横尾 真
• Author Heading: 張 語哲; ZHANG Yuzhe; 八尋 健太郎; YAHIRO Kentaro; Barrot Nathanael; BARROT Nathanael; 横尾 真; YOKOO Makoto
• Publication Date: 2018
• Publication Date (W3CDTF): 2018
• Alternative Title: Strategyproof and Fair Matching Mechanism for Union of Symmetric M-convex Constraints
• Periodical title: 人工知能学会全国大会論文集; Proceedings of the Annual Conference of JSAI
• No. or year of volume/issue: JSAI2018 0
• Volume: JSAI2018
• Issue: 0
• Pages: 1D3OS28b02-1D3OS28b02
• ISSN (Periodical Title): 2758-7347
• Alias of Author: ZHANG Yuzhe; YAHIRO Kentaro; BARROT Nathanael; YOKOO Makoto
• Target Audience: 一般
• DOI: 10.11517/pjsai.JSAI2018.0_1D3OS28b02
• Access Restrictions: インターネット公開
• Data Provider (Database): 科学技術振興機構 : J-STAGE; http://www.jstage.jst.go.jp

• Summary, etc.: <p>In this paper, we identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a variety o...