Updated on 2024/09/10

Information

 

写真a

 
YOKOO MAKOTO
 
Organization
Faculty of Information Science and Electrical Engineering Department of Informatics Professor
School of Engineering Department of Electrical Engineering and Computer Science（Concurrent）
Graduate School of Information Science and Electrical Engineering Department of Information Science and Technology（Concurrent）
Joint Graduate School of Mathematics for Innovation （Concurrent）
Title
Professor
Contact information
メールアドレス
Tel
0928023585
Profile
When there exist multiple agents in a shared environment, there usually exist constraints among possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that satisfies these inter-agent constraints. A distributed CSP is a fundamental problem for achieving the coordination among agents, and this problem can formalize various application problems in DAI, such as MultiAgent truth maintenance tasks and distributed resource allocation problems. I have developed a basic algorithm called asynchronous backtracking that is guaranteed to be complete, i.e., when there exists a consistent solution, the agents can eventually find it, and if there exists no solution since the constraints are too tight, the agents can eventually find out the fact that there exists no solution. Furthermore, this basic algorithm can be extended to a more efficient asynchronous weak-commitment search algorithm by introducing dynamic ordering among agents. The notion of weak-commitment is also effective for solving normal, centralized constraint satisfaction problems. Furthermore, I'm conducting researches on mechanism design in multi-agent systems (e.g., auctions), iterative improvement algorithms for solving distributed CSPs, algorithms for over-constrained distributed CSPs, Multi-agent Real-time search algorithms, methods for solving CSPs using reconfigurable hardware (field programmable gate arrays), and landscape analysis of CSPs.
Homepage
External link

Research Areas

  • Informatics / Intelligent informatics

Degree

  • Research on Distributed Constraint Satisfaction Problem

Research History

  • 1986年から2004年までNTTに勤務

    1986年から2004年までNTTに勤務

Research Interests・Research Keywords

  • Research theme：game theory

    Keyword：game theory

    Research period： 2024

  • Research theme：distributed constraint reasoning

    Keyword：distributed constraint reasoning

    Research period： 2024

  • Research theme：mechanism design

    Keyword：mechanism design

    Research period： 2024

  • Research theme：マルチエージェントシステム

    Keyword：マルチエージェントシステム

    Research period： 2024

  • Research theme：Research on constrained two-sided matching

    Keyword：two-sided matching, strategyproofness, deferred acceptance mechanism

    Research period： 2015.4

  • Research theme：Mechanism Design, Internet Auctions

    Keyword：Multi-agent Systems, Economics, Game theory

    Research period： 1998.8

  • Research theme：Distributed Constraint Reasoning

    Keyword：Search, Constraint Satisfaction, Multi-agent systems

    Research period： 1989.1

Awards

  • Symposium on Multi Agent Systems for Harmonization 2021 (SMASH21) SUMMER SYMPOSIUM 優秀賞

    2021.9   リッド上の公害財配置問題におけるメカニズムデザイン

  • 合同エージェントワークショップ＆シンポジウム2019（JAWS-2019）優秀学生論文賞

    2019.9   合同エージェントワークショップ＆シンポジウム2019   SATソルバーを利用した施設配置のメカニズムデザイン

  • 合同エージェントワークショップ＆シンポジウム2019（JAWS-2019）最優秀論文賞

    2019.9   合同エージェントワークショップ＆シンポジウム2019   部分的選好下における学校選択メカニズム

  • 合同エージェントワークショップ＆シンポジウム2019（JAWS-2019）優秀論文賞

    2019.9   合同エージェントワークショップ＆シンポジウム2019   敵対者が存在する場合のk携構造形成問題

  • 合同エージェントワークショップ＆シンポジウム2019（JAWS-2019）優秀論文賞

    2019.9   合同エージェントワークショップ＆シンポジウム2019   ネットワークオークションにおける戦略的操作不可性かつ非浪費性を満たすメカニズムの設計

  • 第33回人工知能学会全国大会優秀賞

    2019.6   一般社団法人　人工知能学会   SATソルバーを利用した施設配置のメカニズムデザイン

  • JAWS2018 IEEE Young Researcher Award

    2018.9  

  • 平成30年度科学技術分野の文部科学大臣表彰科学技術賞（研究部門）

    2018.4   文部科学省   文部科学省では、科学技術に関する研究開発、理解増進等において顕著な成果を収めた者を「科学技術分野の文部科学大臣表彰」として顕彰してきており、今回、「マルチエージェントシステムに関する先駆的研究」に対する業績が評価されての受賞。

    　More details

    マルチエージェントシステムに関する先駆的研究：マルチエージェントシステムとは、複数の自律的な主体（エージェント）間の相互作用に関する研究分野である。従来、エージェントによる協調問題解決に関しては、様々な応用事例を扱える一般的な技術が欠落していた。また、利害が対立するエージェント間の合意形成に関しては、ミクロ経済学の一分野としてマーケットデザイン研究が進展しているが、ネットワークでの匿名性や現実の応用で生じる制約条件は考慮の対象外であった。本研究では、分散制約充足問題と呼ばれる一般的な枠組を提案し、種々の理論的性質を満たすアルゴリズムを提案している。また、匿名性を用いた不正行為である架空名義入札に頑健な入札メカニズム、および種々の制約を満たすマッチングメカニズムを提案している。本研究により、分散制約充足問題という新しい研究分野が開拓され、マーケットデザインに関する情報科学の観点からの新しい課題と解決策が示され、研究コミュニティが発展している。本成果は、マルチエージェントシステムとマーケットデザイン研究の今後の理論的発展及び実用化に寄与することが期待される。

  • 科学技術分野の文部科学大臣表彰（研究部門）

    2018.4   文部科学省  

  • JAWS2017 IEEE Young Researcher Award

    2017.9  

  • IEEE Young Researcher Award

    2017.9   IEEE Young Researcher Award

    　More details

    「ヘドニックゲームの新たな選好モデルにおけるコア安定性の一考察」

  • Distinguished Service Award

    2017.9   the International Conference on Principles and Practice of Multi-Agent Systems   Distinguished Service Award

  • 全国大会優秀賞

    2017.5   一般社団法人 人工知能学会   下限制約と初期保有財を考慮した学校選択メカニズムの特徴付け

  • 全国大会優秀賞(口頭発表部門）

    2017.5   人工知能学会  

    　More details

    「2次元格子空間上の施設配置問題におけるパレート効率性の考察」
    「下限制約と初期保有財を考慮した学校選択メカニズムの特徴付け」

  • 全国大会優秀賞

    2017.5   一般社団法人 人工知能学会   2次元格子空間上の施設配置問題におけるパレート効率性の考察

  • 優秀論文賞

    2016.9   合同エージェントワークショップ＆シンポジウム2016（JAWS2016)   分割関数ゲームの提携構造形成アルゴリズム

  • 優秀論文賞

    2016.9   合同エージェントワークショップ＆シンポジウム2016（JAWS2016)  

    　More details

    「分割関数ゲームの提携構造形成アルゴリズム」

  • 全国大会優秀賞

    2016.6   一般社団法人　人工知能学会   異なる性質を有する二施設配置のための架空名義操作不可能なメカニズム

  • 全国大会学生奨励賞

    2016.6   人工知能学会  

    　More details

    「学校選択制におけるパレート効率的かつ耐戦略的なメカニズム」

  • 全国大会優秀賞（口頭発表部門）

    2016.6   人工知能学会  

    　More details

    「異なる性質を有する二施設配置のための架空名義操作不可能なメカニズム」

  • Distinguished Service Award

    2015.10   the International Conference on Principles and Practice of Multi-Agent Systems  

  • 最優秀論文賞

    2015.10   合同エージェントワークショップ＆シンポジウム２０１５ (JAWS-2015)   クラウドソーシングのための一般化スコアリングルールの提案

  • IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    2015.10  

  • IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    2015.10  

  • IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    2015.9   IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    　More details

    「日本の学校選択制に適用可能なマッチングメカニズムの提案」
    「私的観測付無限回繰り返しチーム生産ゲームのサボタージュ行動」

  • 最優秀論文賞

    2015.9   合同エージェントワークショップ＆シンポジウム2015（JAWS2015)  

    　More details

    「クラウドソーシングのための一般化スコアリングルールの提案」

  • 全国大会優秀賞

    2015.6   一般社団法人　人工知能学会   戦略的操作不可能なケーキ分割メカニズムの提案

  • 全国大会優秀賞

    2015.6   一般社団法人　人工知能学会   不完全観測繰り返しゲームのチーム生産モデルにおける均衡解析

  • 全国大会優秀賞（口頭発表部門）

    2015.5   人工知能学会  

    　More details

    「戦略的操作不可能なケーキ分割メカニズムの提案」
    「不完全観測繰り返しゲームのチーム生産モデルにおける均衡解析」

  • 日本ソフトウェア科学会　2014年度フェロー

    2014.9   日本ソフトウェア科学会  

  • FIT船井ベストペーパー賞

    2014.9   情報科学技術フォーラム、船井情報科学振興財団  

    　More details

    「架空名義操作不可能な再配分メカニズムの特徴付け」

  • 船井ベストペーパー賞

    2014.9   架空名義操作不可能な再配分メカニズムの特徴付け

  • 全国大会優秀賞

    2014.5   一般社団法人　人工知能学会   効率性と誘因制約を両立可能な物々交換モデルの特徴付け

  • 全国大会優秀賞（口頭発表部門）

    2014.5   人工知能学会  

    　More details

    「効率的な資源利用のための利用予測申告と実行動に関する一考察」
    「効率性と誘因制約を両立可能な物々交換モデルの特徴付け」

  • 全国大会優秀賞

    2014.5   一般社団法人　人工知能学会   効率的な資源利用のための利用予測申告と実行動に関する一考察

  • FIT論文賞

    2013.9   情報科学技術フォーラム  

    　More details

    「地域制約の下での戦略的操作不可能なマッチングメカニズム」

  • IEEE若手奨励賞

    2013.9   合同エージェントワークショップ＆シンポジウム2013 ( JAWS-2013)  

    　More details

    「地域制約の下での戦略的操作不可能なマッチングメカニズム」

  • 全国大会優秀賞（口頭発表部門）

    2013.6   人工知能学会  

    　More details

    「下限制約付きマッチングメカニズムの理論的設計と評価」

  • 日本ソフトウェア科学会　2011年度基礎研究賞

    2012.8   日本ソフトウェア科学会   基礎研究賞は毎年2件程度の業績を選定し、主要な貢献のあった研究者に賞状および副賞を授与するものである。第4回にあたる2011年度は。2012年2月24日に開催された基礎研究賞選定委員会の審議結果を受け、同年3月15日の役員会において、2件の研究に基礎研究賞を授与することに決定した。そのうちの1件が横尾真に授与された。

  • 2011年度基礎研究賞

    2012.8   日本ソフトウェア科学会  

  • 情報処理学会論文賞

    2012.6   情報処理学会  

  • 論文賞

    2012.6   情報処理学会  

    　More details

    「架空名義操作不可能な施設配置メカニズムの特徴付け」

  • Best Paper Award

    2011.11  

  • PRIMA 2011Best Paper Award

    2011.11   The 14th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2011)   PRIMA 2011Best Paper Award

    　More details

    "A Compact Representation Scheme of Coalitional Games Based on Multi‐Terminal Zero‐Suppressed Binary Decision Diagrams"

  • Best Paper Award

    2011.11   the 14th International Conference on Principles and Practice of Multi-Agent Systems(PRIMA2011)   Best Paper Award

    　More details

    ‟A Compact Representation Scheme of Coalitional Games Based on Multi-Terminal Zero-Suppressed Binary Decision Diagrams”

  • IEEE Computer Society Japan Chapter JAWS Young Researcher Award(2件）

    2011.10   合同エージェントワークショップ＆シンポジウム２０１１ (JAWS-2011)  

  • iJAWS優秀論文賞

    2011.10  

    　More details

    ‟Laboratories/students problem with minimun/maximum quotas”

  • JAWS10周年記念賞

    2011.10   合同エージェントワークショップ＆シンポジウム2011 (JAWS2011)  

    　More details

    「匿名の開環境下における協力ゲームについて」

  • IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    2011.10   IEEE Computer Society Japan Chapter JAWS Young Researcher Award

    　More details

    「線形計画法を用いた提携構造形成と利得配分の同時解決」

  • JAWS2011優秀論文賞

    2011.10   合同エージェントワークショップ＆シンポジウム２０１１ (JAWS-2011)  

  • iJAWS Best Paper Award

    2011.10  

  • 船井ベストペーパー賞

    2011.9  

  • Best Application Paper Award

    2011.9   17th International Conference on Principles and Practice of   Best Application Paper Award

    　More details

    "Reducing the Search Space of Resource Constrained DCOPs"

  • Best Application Paper Award

    2011.9   17th International Conference on Principles and Practice of Constraint Programming(CP-2011)  

  • Fellow

    2011.8   Association for the Advancement of Artificial Intelligence(AAAI)  

  • AAAI Fellow

    2011.8   The Association for the Advancement of Artificial Intelligence (AAAI)   AAAI Fellow

  • FIT船井ベストペーパー賞

    2011.6   情報科学技術フォーラム，船井情報科学振興財団  

    　More details

    「自動メカニズムデザインを利用した組合せオークションのルール抽出アルゴリズムの提案」

  • 情報処理学会フェロー

    2011.3   情報処理学会   情報処理および情報通信等の分野で貢献した会員に対し、その貢献を称えるとともに、その貢献が広く周知されるよう社会的認知度を高めることを目的として、平成11年度に新設された。当該分野で学術的または産業的発展・普及・振興などに著しい貢献をした会員に「情報処理学会フェロー」の称号が授与される。

  • フェロー

    2011.3   情報処理学会  

  • Best Paper Award(Runner-up)

    2010.11   the 2010 International Conference on Principles andPractice of Multi-agent Systems(PRIMA2010)  

  • Best Paper Award (Runner-up)

    2010.11   The 2010 International Conference on Principles and Practice of Multi-agent Systems (PRIMA2010)   Best Paper Award (Runner-up)

    　More details

    "Effect of DisCSP Variable-Ordrering Heuristics in Scale-free Networks"

  • 学生奨励賞

    2010.10   合同エージェントワークショップ＆シンポジウム２０１０ (JAWS-2010)   協力ゲームにおける特性関数のエージェントのタイプに基づく簡略表記法

  • 学生奨励賞

    2010.10   合同エージェントワークショップ＆シンポジウム2010 (JAWS-2010)  

    　More details

    「協力ゲームにおける特性関数のエージェントのタイプに基づく簡略表記法」
    「MC-nets を用いた提携構造形成アルゴリズムの拡張：負の利得と外部性の導入」

  • iJAWS Best Paper Award

    2010.10   iJAWS Best Paper Award

    　More details

    "False-name-proofness in Online Mechanisms"

  • iJAWS: Best Paper Award

    2010.10  

  • 学生奨励賞

    2010.10   合同エージェントワークショップ＆シンポジウム２０１０ (JAWS-2010)   MC-netsを用いた提携構造形成アルゴリズムの拡張：負の利得と外部性の導入

  • FIT論文賞

    2010.9   第9回情報科学技術フォーラム(FIT-2010)   架空名義操作不可能な施設配置メカニズムの特徴付け

  • FIT 論文賞

    2010.9   情報科学技術フォーラム  

    　More details

    「架空名義操作不可能な組合せオークションメカニズム：VCG メカニズムの改良」
    「架空名義操作不可能な施設配置メカニズムの特徴付け」

  • FIT論文賞

    2010.9   第9回情報科学技術フォーラム(FIT-2010)   架空名義操作不可能な組合せオークションメカニズム：VCGメカニズムの改良

  • 全国大会優秀賞

    2010.6   2010年人工知能学会全国大会   「入札者の選好を考慮した検索連動型広告オークションの提案」

  • 業績賞

    2010.6   人工知能学会  

  • 全国大会優秀賞

    2010.6   人工知能学会  

    　More details

    「入札者の選好を考慮した検索連動型広告オークションの提案」

  • 業績賞

    2010.6   人工知能学会   人工知能に関する学術またはその応用に関し，著しい業績を成し遂げた者を表彰し，もって学術またはその応用のより一層の発展を奨励することを目的とする．

  • Influential Paper Award

    2010.5   2010 IFAAMAS Autonomous Agents and Multi Agent Systems  

  • 2010 Influential Paper Award

    2010.5   International Foundation for Autonomous Agents and Multiagent Systems   2010 Influential Paper Award "The Distributed Constraint Satisfaction Problem: Formalization and Algorithms" "Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems"

    　More details

    "The Distributed Constraint Satisfaction Problem: Formalization and Algorithms"
    "Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems"

  • Autnomous Agents and Multiagent Systems Influential paper award

    2010.5   International Foundation for Autonomous Agents and Multiagent Systems   This award is given to a paper that has published at least 10 years ago and has a significant influence to the research community of autonomous agents and multiagent systems. The award is give to the following papers: Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and Kazuhiro Kuwabara, ``The Distributed Constraint Satisfaction Problem: Formalization and Algorithms'', IEEE Transactions on Knowledge and Data Engineering 10:673-685, 1998, together with, Makoto Yokoo and Katsutoshi Hirayama, ``Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems'', Second International Conference on Multiagent Systems (ICMAS-96), pp.401-408, 1996.

  • 学生奨励賞

    2009.10   合同エージェントワークショップ＆シンポジウム2009 (JAWS-2009)  

    　More details

    「第一価格入札における架空名義入札の影響の解析」
    「分散制約最適化問題に基づく提携構造形成問題」

  • 2009年人工知能学会全国大会優秀賞

    2009.6   人工知能学会   架空名義入札に頑健な再配分メカニズムの提案

  • 全国大会優秀賞

    2009.6   人工知能学会  

    　More details

    「架空名義入札に頑健な再配分メカニズムの提案」
    「架空名義操作不可能な組合せオークションの割当規則の特性」
    「第一価格入札における架空名義操作の影響の解析」

  • 2009年人工知能学会全国大会優秀賞

    2009.6   人工知能学会   第一価格入札における架空名義操作の影響の解析''

  • 2009年人工知能学会全国大会優秀賞

    2009.6   人工知能学会   架空名義操作不可能な組合せオークションの割当規則の特性

  • Nomination for the Best Student Paper Award

    2009.5   Eighth International Joint Conference on Autonomous Agents and Multi-Agent System (AAMAS-2009)  

  • Best student paper award nomination

    2009.5   Eighth International Joint Conference on Autonomous Agents and Multi-Agent System (AAMAS-2009)   Best student paper award nomination "Characterizing False-name-proof Allocation Rules in Combinatorial Auctions"

    　More details

    "Characterizing False-name-proof Allocation Rules in Combinatorial Auctions"

  • 山下記念研究賞

    2009.3   情報処理学会  

    　More details

    「適切な掲載数を決定するキーワード広告オークションの提案」

  • Best Paper Award

    2008.12   IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-2008)  

  • 全国大会優秀賞

    2008.6   人工知能学会  

    　More details

    「ネットワーク分散部分観測可能マルコフ決定過程におけるプラン構築への通信の導入」

  • Best student paper award

    2008.5   Seventh International Joint Conference on Autonomous Agents and Multi-Agent System (AAMAS-2008)  

  • Best Student Paper Award

    2008.5   The Seventh International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2008)   Best Student Paper Award

  • Best Paper Award

    2007.11   Tenth Pacific Rim International Workshop on Multi-agents (PRIMA-2007)  

  • Best Paper Award

    2007.11   Tenth Pacific Rim International Workshop on Multi-agents (PRIMA-2007)   Best Paper Award

  • Best Paper Award

    2007.10   IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-2007)  

  • 最優秀論文賞

    2007.10   合同エージェントワークショップ＆シンポジウム2007 (JAWS-2007)   適切な掲載数を決定するキーワード広告オーク ションの提案

  • Best Paper Award

    2007.10   Best Paper Award

  • 日本学士院学術奨励賞

    2006.3   日本学術振興会   「マルチエージェントシステムにおける分散制約充足問題の研究」

  • 日本学術振興会賞

    2006.3   日本学術振興会   マルチエージェントシステムにおける分散制約充足問題の研究

  • 学術奨励賞

    2006.3   日本学士院   マルチエージェントシステムにおける分散制約充足問題の研究

  • 日本学術振興会賞

    2006.3   日本学術振興会   「マルチエージェントシステムにおける分散制約充足問題の研究」

  • 第１９回全国大会優秀賞

    2005.7   人工知能学会  

  • 第9回ソフトウェア科学会論文賞

    2005.6   ソフトウェア科学会  

  • 全国大会優秀賞

    2005.6   人工知能学会   開環境での協力ゲームにおける解概念の提案

    　More details

    横尾真, Vincent Conitzer, Tuomas Sandholm, 大田直樹, 岩崎敦,「開環境での協力ゲームにおける解概念の提案」

  • Best Paper Award

    2004.8   Best Paper Award Takayuki Suyama, and Makoto Yokoo. AAMAS'04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol.1, pp.160-167.

    　More details

    Takayuki Suyama, and Makoto Yokoo. AAMAS'04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol.1, pp.160-167.

  • The Best Paper Award

    2004.7   the Third International Jonit Conferece on AAMAS  

  • Autonomous Agent Research Award

    2004.3   Association for Computing Machinery (ACM) Special Interest Group on Artificial Intelligence (SIGART)   Autonomous Agent Research Award

  • Association for Computing Machinery (ACM) Special Interest Group on Artificial Intellitence (SIGART) Autonomous Agent reserch Award

    2004.1   Association for Computing Machinery (ACM) Specail Interst Group on Artificial Intellitence (SIGART) Autonomous Agent  

  • Association for Computing Machinery (ACM) Recognition of Service Award

    2003.1   Association for Computing Machinery (ACM)  

  • Best Paper Award

    2002.1   Pacific-Rim International Workshop on Multi-agents (PRIMA-2002)  

  • 人工知能学会論文賞

    2002.1   人工知能学会   論文：架空名義入札に頑健な複数ユニットオークションプロトコル

  • 電子情報通信学会情報セキュリティ研究専門委員会　暗号と情報セキュリティシンポジウム （CI2002) 論文賞

    2002.1   電子情報通信学会   論文：セキュアな動的計画法と組合わせオークションへの応用

  • 全国大会優秀論文賞

    1999.6   人工知能学会   `電子商取引における一般化 Vickrey オークションの問題点:架空名義入札に対する頑健性

    　More details

    櫻井 祐子，横尾 真，松原 繁夫

  • IPSJ Sakai Special Researcher Award

    1995.3   Information Processing Society of Japan   IPSJ Sakai Special Researcher Award

▼display all

Papers

  • Daycare Matching in Japan: Transfers and Siblings Reviewed International journal

    Zhaohong Sun, Daisuke Moriwaki, Yoshihiro Takenami, Yoji Tomita, Makoto Yokoo

    Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI-2023)   2023.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategyproof Mechanism for Two-Sided Matching with Resource Allocation Reviewed International journal

    Kwei-guu Liu, Kentaro Yahiro, Makoto Yokoo

    Artificial Intelligence   316   2023.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints Reviewed International journal

    Takamasa Suzuki, Akihisa Tamura, Kentaro Yahiro, Makoto Yokoo, Yuzhe Zhang

    Artificial Intelligence   315   2023.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Subtraction games in more than one dimension

    Larsson, U; Saha, I; Yokoo, M

    THEORETICAL COMPUTER SCIENCE   1016   2024.11   （ ISSN:0304-3975 eISSN:1879-2294 ）

    　More details

    Publisher：Theoretical Computer Science  

    This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966), with finite subtraction sets. In case of two move rulesets we find a complete solution, via a certain P-to-P principle (where P means that the previous player wins). Namely x∈P if and only if x+a+b∈P, where a and b are the two move options. Flammenkamp (1997) observed that, already in one dimension, rulesets with three moves can be hard to analyze, and still today his related conjecture remains open. Here, we solve instances of rulesets with three moves in two dimensions, and conjecture that they all have regular outcomes. Through several computer visualizations of outcomes of multi-move two-dimensional rulesets, we observe that they tend to partition the game board into periodic mosaics on very few regions/segments, which can depend on the number of moves in a ruleset. For example, we have found a five-move ruleset with an outcome segmentation into six semi-infinite slices. In this spirit, we develop a coloring automaton that generalizes the P-to-P principle. Given an initial set of colored positions, it quickly paints the P-positions in segments of the game board. Moreover, we prove that two-dimensional rulesets have row/column eventually periodic outcomes. We pose open problems on the generic hardness of two-dimensional rulesets; several regularity conjectures are provided, but we also conjecture that not all rulesets have regular outcomes.

    DOI： 10.1016/j.tcs.2024.114775

    Web of Science

    Scopus

  • When Should Prices Stay Fixed? on the Chances and Limitations of Spot Pricing in Larger Markets

    Dierks L., Yokoo M.

    SIGMETRICS/PERFORMANCE 2024 - Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems   71 - 72   2024.6   （ ISBN:9798400706240 ）

    　More details

    Publisher：SIGMETRICS/PERFORMANCE 2024 - Abstracts of the 2024 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems  

    Selling resources via auctions often seems profit-optimal in theory. Yet in practice, providers most often choose to sell homogeneous resources such as cloud computing instances at fixed prices. While it has been argued that this is explained by relatively non-volatile demand distributions and highly competitive market environments, these arguments only paint a partial picture. Through a formal game theoretic analysis, we show that the relative profit increase of offering resources through a spot pricing mechanism instead of at a fixed price is unbounded as long as a sufficiently competitive outside option exists, even if demand is very non-volatile. To explain the lack of spot pricing in practice, we consider that users might be biased against more complex auction-based mechanisms. We find that in large, non-volatile markets even a very small user bias will turn fixed-pricing profit-optimal if demand is sufficiently large and non-volatile. We derive a sufficient condition under which fixed prices are profit-optimal and illustrate the observed effects through a numerical example.

    DOI： 10.1145/3652963.3655089

    Scopus

  • When Should Prices Stay Fixed? on the Chances and Limitations of Spot Pricing in Larger Markets

    Dierks L., Yokoo M.

    Performance Evaluation Review   52 ( 1 )   71 - 72   2024.6   （ ISSN:01635999 ）

    　More details

    Publisher：Performance Evaluation Review  

    Selling resources via auctions often seems profit-optimal in theory. Yet in practice, providers most often choose to sell homogeneous resources such as cloud computing instances at fixed prices. While it has been argued that this is explained by relatively non-volatile demand distributions and highly competitive market environments, these arguments only paint a partial picture. Through a formal game theoretic analysis, we show that the relative profit increase of offering resources through a spot pricing mechanism instead of at a fixed price is unbounded as long as a sufficiently competitive outside option exists, even if demand is very non-volatile. To explain the lack of spot pricing in practice, we consider that users might be biased against more complex auction-based mechanisms. We find that in large, non-volatile markets even a very small user bias will turn fixed-pricing profit-optimal if demand is sufficiently large and non-volatile. We derive a sufficient condition under which fixed prices are profit-optimal and illustrate the observed effects through a numerical example.

    DOI： 10.1145/3673660.3655089

    Scopus

  • Stable Matchings in Practice: A Constraint Programming Approach

    Sun Z., Yamada N., Takenami Y., Moriwaki D., Yokoo M.

    Proceedings of the AAAI Conference on Artificial Intelligence   38 ( 20 )   22377 - 22384   2024.3   （ ISSN:21595399 ）

    　More details

    Publisher：Proceedings of the AAAI Conference on Artificial Intelligence  

    We study a practical two-sided matching problem of allocating children to daycare centers, which has significant social implications. We are cooperating with several municipalities in Japan and our goal is to devise a reliable and trustworthy clearing algorithm to deal with the problem. In this paper, we describe the design of our new algorithm that minimizes the number of unmatched children while ensuring stability. We evaluate our algorithm using real-life data sets, and experimental results demonstrate that our algorithm surpasses the commercial software that currently dominates the market in terms of both the number of matched children and the number of blocking coalitions (measuring stability). Our findings have been reported to local governments, and some are considering adopting our proposed algorithm in the near future, instead of the existing solution. Moreover, our model and algorithm have broader applicability to other important matching markets, such as hospital-doctor matching with couples and school choice with siblings.

    DOI： 10.1609/aaai.v38i20.30244

    Scopus

  • A fair and truthful mechanism with limited subsidy Reviewed International journal

    Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo,

    Games and Economic Behavior   144   40 - 70   2024.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： https://doi.org/10.1016/j.geb.2023.12.006.

  • A fair and truthful mechanism with limited subsidy

    Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo

    Games and Economic Behavior   144   49 - 70   2024.3   （ ISSN:0899-8256 eISSN:1090-2473 ）

    　More details

    Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

    DOI： 10.1016/j.geb.2023.12.006

    Web of Science

    Scopus

    researchmap

  • Strategyproof and fair matching mechanism for union of symmetric m-convex constraints

    Barrot, N; Yahiro, K; Yokoo, M; Zhang, YZ

    PLOS ONE   19 ( 2 )   e0289965   2024.2   （ ISSN:1932-6203 ）

    　More details

    Language：English   Publisher：PLoS ONE  

    We identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a wide range of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of symmetric M-convex sets does not belong to this well-behaved class of constraints. Consequently, devising a fair and strategyproof mechanism to handle this new class is challenging. We present a novel mechanism for it called Quota Reduction Deferred Acceptance (QRDA), which repeatedly applies the standard Deferred Acceptance mechanism by sequentially reducing artificially introduced maximum quotas. We show that QRDA is fair and strategyproof when handling a union of symmetric M-convex sets, which extends previous results obtained for a subclass of the union of symmetric M-convex sets: ratio constraints. QRDA always yields a weakly better matching for students than a baseline mechanism called Artificial Cap Deferred Acceptance (ACDA). We also experimentally show that QRDA outperforms ACDA in terms of nonwastefulness.

    DOI： 10.1371/journal.pone.0289965

    Web of Science

    Scopus

    PubMed

  • Stable Matchings in Practice: A Constraint Programming Approach Reviewed International journal

    Zhaohong Sun and Naoyuki Yamada and Yoshihiro Takenami and Daisuke Moriwaki and Makoto Yokoo

    Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI)   2024.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： https://doi.org/10.1609/aaai.v38i20.30244

  • Towards Optimal Subsidy Bounds for Envy-Freeable Allocations Reviewed International journal

    Yasushi Kawase and Kazuhisa Makino and Hanna Sumita and Akihisa Tamura and Makoto Yokoo

    Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI)   2024.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： https://doi.org/10.1609/aaai.v38i9.28842

  • Fairness and Nonwastefulness in Two-Period Matching

    KOMETANI Hayato, KIMURA Kei, SUN Zhaohong, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   1I3GS501 - 1I3GS501   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>In this paper, we explore a two-period matching problem in which agents' preferences may evolve over time. This model enables agents to be matched with different partners over the two periods. Previous research defines dynamic stability as the absence of any single agent or pair of agents gaining an advantage through coalition across any period. We introduce new fairness, nonwastefulness and individually rationality notions tailored for the two-period matching setting and examine its relationship with dynamic stability. We also discuss the existence of matching that simultaneously satisfies the newly introduced fairness and nonwastefulness properties.</p>

    DOI： 10.11517/pjsai.jsai2024.0_1i3gs501

    CiNii Research

  • Non-Obvious Manipulability in Ordered Weighted Average Mechanisms for Facility Location Games

    YOSHIDA Kento, KIMURA Kei, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   2F6GS502 - 2F6GS502   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>In this presentation, we consider a facility location game on a one-dimensional line segment, i.e., a problem in which participating agents declare their positions on a one-dimensional line segment and a mechanism determines the placement of facilities based on these declarations. In particular, we focus on the ordered weighted average (OWA) mechanisms and discuss its non-obvious manipulability. An OWA mechanism is a mechanism that orders the agent's reported values in ascending order, applies weights according to that order, and returns the sum of the weights. In this presentation, we analyze how the non-obvious manipulability changes by changing the weights in an OWA.</p>

    DOI： 10.11517/pjsai.jsai2024.0_2f6gs502

    CiNii Research

  • A study on L-extendability of integrally convex functions by linear interpolation

    YOKOYAMA Ken, IWAMASA Yuni, KIMURA Kei, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   3Xin235 - 3Xin235   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Integrally convex functions are a basic class of functions in discrete convex analysis, including M-convex functions and L-convex functions. Recently, the concept of L-extendable functions has been proposed for algorithm development for discrete optimization problems. A function h on an integer lattice is L-extendable if there exists an L-convex function g on a half-integer lattice such that the restriction of g on the integer lattice coincides with that of h. L-extendability is known to be useful in developing approximation algorithms and fast exact algorithms for various discrete optimization problems that are NP-hard. The purpose of this paper is to investigate L-extendability of integrally convex functions. In particular, we focus on L-extensibility by linear interpolation and discuss a characterization of integrally convex functions for which such extensions are possible.</p>

    DOI： 10.11517/pjsai.jsai2024.0_3xin235

    CiNii Research

  • On Stable Algorithms for Two-Sided Matching with Information Diffusion

    HAMASAKI Shinnosuke, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   1I3GS504 - 1I3GS504   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>It is known that there is no stable algorithm that satisfy strategy-proofness in the two-sided matching with information diffusion. In this research, we examine the existence of stable algorithms by weakening the incentive requirement. More precisely, we show that even the non-obvious manipulability property is not achievable by stable algorithms.</p>

    DOI： 10.11517/pjsai.jsai2024.0_1i3gs504

    CiNii Research

  • Various Anonymity Properties in Diffusion Mechanism Design for Facility Location Games

    ANDO Ryoto, KIMURA Kei, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   3Xin250 - 3Xin250   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Diffusion mechanism design is a new research paradigm in the literature of mechanism design, which aims to incentivise agents to invite as many colleagues as possible to participate in a mechanism. An existing work on diffusion mechanism design for facility location games showed that there is no mechanism that satisfies strategy-proofness, Pareto efficiency and full anonymity, as well as proposed two naive mechanisms that satisfy strategy-proofness and Pareto efficiency by ignoring the full anonymity property. In this paper we aim to reveal to what extent strategy-proof and Pareto efficient mechanisms could be anonymous. We first define a class of anonymity properties by introducing a concept of partitions of the set of participating agents, and clarify a sufficient condition on partitions that guarantees the existence of mechanisms satisfying an anonymity property, as well as strategy-proofness and Pareto efficiency.</p>

    DOI： 10.11517/pjsai.jsai2024.0_3xin250

    CiNii Research

  • New Concept of Fairness Applicable to School Choice

    WAKASUGI Temma, KIMURA Kei, SUN Zhaohong, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   2F6GS501 - 2F6GS501   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>The theory of two-sided matching has been extensively developed, and it is hoped that matching will reduce students' envies and improve overall welfare. However, it turns out that there exists a trade-off between efficiency and fairness. Therefore, keeping fairness at a certain level that can be applied in the real world also leads to increased efficiency. Our contribution is to establish a weaker fairness requirement called reverse Envy-Freeness from up to k peers (r-EF-k). r-EF-k requires that each student is envied by at most k students. By varying k, r-EF-k can represent different levels of fairness. We discuss mechanism that satisfy r-EF-k and certain efficiency properties.</p>

    DOI： 10.11517/pjsai.jsai2024.0_2f6gs501

    CiNii Research

  • An Improvement of MaxSAT Encoding for Coalition Structure Generation with Externaliies

    KINOSHITA Haruto, SAKURAI Yuko, KOSHIMURA Miyuki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   2M4OS11b04 - 2M4OS11b04   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>The Coalition Structure Generation (CSG) problem involves dividing the set of agents to maximize the sum of coalition values, and various algorithms have been proposed to address it. We propose an improvement that enables more efficient solving of the CSG problem, where externalities exist between coalitions, compared to the conventional MaxSAT encoding. Computational experiments demonstrate that our approach can reduce CPU computation time compared to traditional methods.</p>

    DOI： 10.11517/pjsai.jsai2024.0_2m4os11b04

    CiNii Research

  • Local envy freeness in two-sided matching

    TAKESHIMA Ryota, KIMURA Kei, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2024 ( 0 )   3Xin2112 - 3Xin2112   2024   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>According to the insights of behavioral economics, it is believed that people feel happiness by comparing themselves with others who are close to them. In accordance with this insight, this study considers two-sided matching where envy occurs only with those directly connected in the social network, and examines the relationship between efficiency and fairness. In particular, we define the aforementioned envy as local envy, and adopt the absence of local envy as a relaxation of conventional fairness. Then, by restricting preferences on one side, we discuss the existence of matchings that are both locally envy free and Pareto efficient, as well as mechanisms to find such matchings.</p>

    DOI： 10.11517/pjsai.jsai2024.0_3xin2112

    CiNii Research

  • Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.

    Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo

    AAAI   38 ( 9 )   9824 - 9831   2024   （ ISSN:21595399 ISBN:1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 1577358872, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879, 9781577358879 ）

    　More details

    Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1609/aaai.v38i9.28842

    Scopus

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/aaai/aaai2024.html#KawaseMSTY24

  • Group Correction-based Local Disturbance Particle Swarm Optimization algorithm for solving Continuous Distributed Constraint Optimization Problems

    Shi M., Xin H., Yokoo M.

    Proceedings - 2024 IEEE Conference on Artificial Intelligence, CAI 2024   652 - 658   2024   （ ISBN:9798350354096 ）

    　More details

    Publisher：Proceedings - 2024 IEEE Conference on Artificial Intelligence, CAI 2024  

    Continuous Distributed Constraint Optimization Problems (C-DCOPs) are a significant constraint handling framework to model continuous variable problems of multi-agent systems. Many excellent algorithms have been designed to solve C-DCOPs in recent decades. However, these algorithms are prone to falling into local optimum, which is a major challenge in solving C-DCOPs. This paper proposes a Group Correction-based Local Disturbance Particle Swarm Optimization algorithm named GC-LDP to improve its solution quality. In GC-LDP, we introduce two items, the average of the personal best positions and the average of the personal current positions, into the velocity update formula of traditional Particle Swarm Optimization to utilize the group knowledge to correct the exploitation direction. In addition, a local disturbance strategy is designed in GC-LDP to increase the swarm diversity by searching the nearest particle group in the solution space to enhance the algorithm's exploration ability. GC-LDP has been theoretically proven to be an anytime algorithm. Furthermore, based on the extensive experiments on four types of benchmark problems, we demonstrate that GC-LDP outperforms state-of-the-art C-DCOP algorithms in terms of convergence speed and solution quality.

    DOI： 10.1109/CAI59869.2024.00128

    Scopus

  • Fairness and efficiency trade-off in two-sided matching.

    Sung-Ho Cho, Kei Kimura, Kiki Liu, Kwei-guu Liu, Zhengjie Liu, Zhaohong Sun 0001, Kentaro Yahiro, Makoto Yokoo

    CoRR   abs/2402.01084   2024

    　More details

    Publishing type：Research paper (scientific journal)  

    DOI： 10.48550/arXiv.2402.01084

    researchmap

  • Fairness and Efficiency Trade-off in Two-Sided Matching

    Cho S.H., Kimura K., Liu K., Liu K.G., Liu Z., Sun Z., Yahiro K., Yokoo M.

    Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS   2024-May   372 - 380   2024   （ ISSN:15488403 ）

    　More details

    Publisher：Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS  

    The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of environments, researchers and practitioners have encountered various forms of distributional constraints. As a mechanism can handle a more general class of constraints, we can assign students more flexibly to colleges to increase students' welfare. However, it turns out that there exists a trade-off between students' welfare (efficiency) and fairness (which means no student has justified envy). Furthermore, this trade-off becomes sharper as the class of constraints becomes more general. The first contribution of this paper is to clarify the boundary on whether a strategyproof and fair mechanism can satisfy certain efficiency properties for each class of constraints. Our second contribution is to establish a weaker fairness requirement called envy-freeness up to k peers (EF-k), which is inspired by a similar concept used in the fair division of indivisible items. EF-k guarantees that each student has justified envy towards at most k students. By varying k, EF-k can represent different levels of fairness. We investigate theoretical properties associated with EF-k. Furthermore, we develop two contrasting strategyproof mechanisms that work for general hereditary constraints, i.e., one mechanism can guarantee a strong efficiency requirement, while the other can guarantee EF-k for any fixed k. We evaluate the performance of these mechanisms through computer simulation.

    Scopus

  • Budgeted Recommendation with Delayed Feedback

    Liu, K; Maghsudi, S; Yokoo, M

    GOOD PRACTICES AND NEW PERSPECTIVES IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 3, WORLDCIST 2024   987   202 - 213   2024   （ ISSN:2367-3370 ISBN:978-3-031-60220-7 eISSN:2367-3389 ）

    　More details

    Publisher：Lecture Notes in Networks and Systems  

    In a conventional contextual multi-armed bandit problem, the feedback (or reward) is immediately observable after an action. Nevertheless, delayed feedback arises in numerous real-life situations and is particularly crucial in time-sensitive applications. The exploration-exploitation dilemma becomes particularly challenging under such conditions, as it couples with the interplay between delays and limited resources. Besides, a limited budget often aggravates the problem by restricting the exploration potential. A motivating example is the distribution of medical supplies at the early stage of COVID-19. The delayed feedback of testing results, thus insufficient information for learning, degraded the efficiency of resource allocation. Motivated by such applications, we study the effect of delayed feedback on constrained contextual bandits. We develop a decision-making policy, delay-oriented resource allocation with learning (DORAL), to optimize the resource expenditure in a contextual multi-armed bandit problem with arm-dependent delayed feedback.

    DOI： 10.1007/978-3-031-60221-4_20

    Web of Science

    Scopus

  • Balancing Fairness and Efficiency in 3D Repeated Matching in Ridesharing Reviewed International journal

    Garima Shakya and Makoto Yokoo

    ECAI 2023 - 26th European Conference on Artificial Intelligence   2023.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： https://doi.org/10.3233/FAIA230507

  • Balancing Fairness and Efficiency in 3D Repeated Matching in Ridesharing

    Shakya G., Yokoo M.

    Frontiers in Artificial Intelligence and Applications   372   2121 - 2128   2023.9   （ ISSN:09226389 ISBN:9781643684369 ）

    　More details

    Publisher：Frontiers in Artificial Intelligence and Applications  

    Ride-hailing services' main feature is mediating the assignment and transactions between drivers and passengers. Essentially, they decide on the quality of passengers' experience and the drivers' workload balancing. To boost the company's profit, these services try to maximize the utility for the passengers by optimizing the matching, resulting in shorter waiting times and better service availability. Often, in the process of maximizing revenue, drivers' interests get sidelined. We focus on two objectives: efficiency (minimizing total distance traveled by drivers) and fairness (minimizing the maximum traveled distance by any driver) for shared-mode rides, where the vehicles' capacity is two passengers. We theoretically show the relation between the optimal solutions of both objectives and as the problem is computationally intractable, we propose a heuristic algorithm to achieve an approximately optimal solution. We also propose a re-assignment-based algorithm when the aim is to achieve maximum matching with fairness up to a given threshold, if that is feasible. The experimental analysis for the proposed algorithms on real-world data from Chicago city shows that our approach can significantly improve fairness for drivers without losing much efficiency.

    DOI： 10.3233/FAIA230507

    Scopus

  • Daycare Matching in Japan: Transfers and Siblings

    Sun Z., Takenami Y., Moriwaki D., Tomita Y., Yokoo M.

    Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023   37   14487 - 14495   2023.6   （ ISBN:9781577358800 ）

    　More details

    Publisher：Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023  

    In this paper, we study a daycare matching problem in Japan and report the design and implementation of a new centralized algorithm. There are two features that make this market different from the classical hospital-doctor matching problem: i) some children are initially enrolled and prefer to be transferred to other daycare centers; ii) one family may be associated with two or more children and is allowed to submit preferences over combinations of daycare centers. We revisit some well-studied properties including individual rationality, non-wastefulness, as well as stability, and generalize them to this new setting. We design an algorithm based on integer programming (IP) that captures these properties and conduct experiments on five real-life data sets provided by three municipalities. Experimental results show that i) our algorithm performs at least as well as currently used methods in terms of numbers of matched children and blocking coalition; ii) we can find a stable outcome for all instances, although the existence of such an outcome is not guaranteed in theory.

    Scopus

  • Distributed Artificial Intelligence - 4th International Conference, DAI 2022, Tianjin, China, December 15-17, 2022, Proceedings

    DAI   13824   2023.4   （ ISBN:9783031255489, 9783031255496 ）

    　More details

    Publishing type：Research paper (international conference proceedings)   Publisher：Springer  

    DOI： 10.1007/978-3-031-25549-6

    researchmap

  • Strategyproof Mechanism for Two-Sided Matching with Resource Allocation

    Kwei-guu Liu, Kentaro Yahiro, Makoto Yokoo

    Artificial Intelligence   316   103855 - 103855   2023.3   （ ISSN:0004-3702 eISSN:1872-7921 ）

    　More details

    Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

    DOI： 10.1016/j.artint.2023.103855

    Web of Science

    Scopus

    researchmap

  • Daycare Matching in Japan: Transfers and Siblings. Reviewed

    Zhaohong Sun 0001, Yoshihiro Takenami, Daisuke Moriwaki, Yoji Tomita, Makoto Yokoo

    AAAI   14487 - 14495   2023.2

    　More details

    Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1609/aaai.v37i12.26694

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/aaai/aaai2023.html#0001TMTY23

  • Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints

    Takamasa Suzuki, Akihisa Tamura, Kentaro Yahiro, Makoto Yokoo, Yuzhe Zhang

    Artificial Intelligence   315   103825 - 103825   2023.2   （ ISSN:0004-3702 eISSN:1872-7921 ）

    　More details

    Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

    DOI： 10.1016/j.artint.2022.103825

    Web of Science

    Scopus

    researchmap

  • Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints.

    Kei Kimura, Kwei-guu Liu, Zhaohong Sun 0001, Kentaro Yahiro, Makoto Yokoo

    CoRR   abs/2309.10968   2023

    　More details

    Publishing type：Research paper (scientific journal)  

    DOI： 10.48550/arXiv.2309.10968

    researchmap

  • Designing Double Auction Mechanism Through Deep Learning

    SUEHARA Tsuyoshi, TAKEUCHI Koh, KASHIMA Hisashi, OYAMA Satoshi, SAKURAI Yuko, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2023 ( 0 )   1F4GS505 - 1F4GS505   2023   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Mechanism design, a branch of economics, aims at designing rules that can autonomously achieve desired outcomes in resource allocation and public decision making. The research on mechanism design using machine learning is called automated mechanism design or mechanism learning. In our research, we construct a new network based on the existing method for single auctions and aim to automatically design an mechanism by applying it to double auctions. Especially, we focus on the following four desirable properties for the mechanism: individual rationality, balanced budget, Pareto efficiency, and incentive compatibility. We conducted experiments assuming a small-scale double auction and clarified the convergence of the obtained mechanism. We also confirmed how much the learnt mechanism satisfies the four properties compared to two representative protocols. As a result, we verified that the mechanism is more budget-balanced than VCG protocol and more Pareto-efficient than MD protocol, with the incentive compatibility mostly guaranteed.</p>

    DOI： 10.11517/pjsai.jsai2023.0_1f4gs505

    CiNii Research

  • A study on L-extendability of integrally convex functions

    YOKOYAMA Ken, KIMURA Kei, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2023 ( 0 )   2J4GS102 - 2J4GS102   2023   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Integrally convex functions are a basic class of functions in discrete convex analysis, including M-convex functions and L-convex functions. Recently, the concept of L-extendable functions has been proposed for algorithm development for discrete optimization problems. A function h on an integer lattice is L-extendable if there exists an L-convex function g on a half-integer lattice such that the restriction of g on the integer lattice coincides with that of h. L-extendability is known to be useful in developing approximation algorithms and fast exact algorithms for various discrete optimization problems that are NP-hard. The purpose of this paper is to investigate L-extendability of integrally convex functions. Specifically, we first define a half-integrally convex function on a half-integer lattice that has properties similar to those of an integrally convex function. Then, we investigate the conditions under which an integrally convex function can be relaxed to a half-integrally convex function. Finally, we point out a research direction to investigate the condition under which an integrally convex function is L-extendable.</p>

    DOI： 10.11517/pjsai.jsai2023.0_2j4gs102

    CiNii Research

  • Strategy-Proof Mechanisms for Facility Location Games with Information Diffusion

    ANDO Ryoto, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2023 ( 0 )   1F3GS503 - 1F3GS503   2023   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Diffusion mechanism design is a new research paradigm in the literature of mechanism design, which aims to incentivise agents to invite as many colleagues as possible to participate in a mechanism. In this paper we apply diffusion mechanism design to the facility location game, one of the most well-studied model in MAS domain. We first provide a general impossibility result on the existence of possibly randomized facility location mechanisms that are strategy-proof, Pareto efficient and fully anonymous. We then present two strategy-proof mechanisms that satisfy some weaker notions of anonymity.</p>

    DOI： 10.11517/pjsai.jsai2023.0_1f3gs503

    CiNii Research

  • Analysis of manipulation on mechanisms for a one-dimensional facility location problem

    YOSHIDA Kento, KIMURA Kei, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2023 ( 0 )   2F5GS502 - 2F5GS502   2023   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>We consider manipulation on facility location mechanisms which do not satisfy strategyproofness.Specifically, we deal with two mechanisms called the midpoint mechanism and the Nash mechanism. In the midpoint mechanism, the location is determined as half of the sum of the minimum and maximum values among the reported values.In the Nash mechanism, the location of facility is determined as that maximizing the product of utilities of the agents.Agents can improve their utility by manipulation in those mechanisms. In this paper, we investigate how one agent can manipulate the location of a facility in those mechanisms.</p>

    DOI： 10.11517/pjsai.jsai2023.0_2f5gs502

    CiNii Research

  • Analysing the compatibility of Nash stability and information diffusion in hedonic games

    AKAHOSHI Yuta, KIMURA Kei, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2023 ( 0 )   2F4GS503 - 2F4GS503   2023   （ eISSN:27587347 ）

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>Hedonic games are mathematical models in which a group of agents is divided into appropriate subgroups, and have been studied as a field of cooperative games. Cooperative games with permission structures, on the other hand, are models in which an agent’s participation in a game is by permission of another agent. In this paper, we introduce a permission structure into SASHG, a type of hedonic game, and consider solutions to hedonic games in which information diffusion, i.e., the incentive to issue as many permissions as possible, holds. Specifically, we first show that Nash stable solutions and information diffusion are incompatible. Given this impossibility, we propose an algorithm with incentives for information diffusion and show the approximate rate of social surplus that can be achieved. As a result, we show the incompatibility theorem of social surplus maximization and Nash stability with incentives for information diffusion, and furthermore, we show that the achievable approximation rate is 0.</p>

    DOI： 10.11517/pjsai.jsai2023.0_2f4gs503

    CiNii Research

  • Towards Optimal Subsidy Bounds for Envy-freeable Allocations.

    Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo

    CoRR   abs/2308.11230   2023

    　More details

    Publishing type：Research paper (scientific journal)  

    DOI： 10.48550/arXiv.2308.11230

    researchmap

  • False-Name-Proof Facility Location on Wheel Graphs. Reviewed

    Koji Osoegawa, Taiki Todo, Makoto Yokoo

    PRIMA   13753   139 - 155   2022.11   （ ISSN:0302-9743 ISBN:978-3-031-21202-4 eISSN:1611-3349 ）

    　More details

    Language：Others   Publishing type：Research paper (other academic)   Publisher：Springer  

    DOI： 10.1007/978-3-031-21203-1_9

    Web of Science

    Scopus

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/prima/prima2022.html#OsoegawaTY22

  • Measuring power in coalitional games with friends, enemies and allies Reviewed International journal

    Oskar Skibski, Takamasa Suzuki, Tomasz Grabowski, Yuko Sakurai, Tomasz P. Michalak, Makoto Yokoo

    Artificial Intelligence   313   2022.10

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Robust Weighted Partial Maximum Satisfiability Problem: Challenge to σ2P-Complete Problem. Reviewed

    Tomoya Sugahara, Kaito Yamashita, Nathanaël Barrot, Miyuki Koshimura, Makoto Yokoo

    PRICAI 2022: Trends in Artificial Intelligence - 19th Pacific Rim International Conference on Artificial Intelligence   13629   17 - 31   2022.10   （ ISSN:0302-9743 ISBN:978-3-031-20861-4 eISSN:1611-3349 ）

    　More details

    Language：Others   Publishing type：Research paper (other academic)   Publisher：Springer  

    DOI： 10.1007/978-3-031-20862-1_2

    Web of Science

    Scopus

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/pricai/pricai2022-1.html#SugaharaYBKY22

  • Proactive Dynamic Distributed Constraint Optimization Problems. Reviewed

    Khoi D. Hoang, Ferdinando Fioretto, Ping Hou, William Yeoh 0001, Makoto Yokoo, Roie Zivan

    Journal of Artificial Intelligence Research   74   179 - 225   2022.10

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)  

    DOI： 10.1613/jair.1.13499

  • Two-Sided Matching over Social Networks. Reviewed

    Sung-Ho Cho, Taiki Todo, Makoto Yokoo

    IJCAI   186 - 193   2022.8

    　More details

    Publishing type：Research paper (international conference proceedings)   Publisher：ijcai.org  

    DOI： 10.24963/ijcai.2022/27

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/ijcai/ijcai2022.html#ChoTY22

  • Two-Sided Matching over Social Networks Reviewed International journal

    Sung-Ho Cho, Taiki Todo, Makoto Yokoo

    The 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)   186 - 193   2022.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Matching Market Design with Constraints

    Aziz H., Biró P., Yokoo M.

    Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022   36   12308 - 12316   2022.6   （ ISBN:1577358767, 9781577358763 ）

    　More details

    Publisher：Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022  

    Two-sided matching is an important research area that has had a major impact on the design of real-world matching markets. One consistent feature in many of the real-world applications is that they impose new feasibility constraints that lead to research challenges. We survey developments in the field of two-sided matching with various constraints, including those based on regions, diversity, multi-dimensional capacities, and matroids.

    Scopus

  • Impossibility of Weakly Stable and Strategy-proof Mechanism Reviewed

    Sung-Ho Cho, Miyuki Koshimura, Pinaki Mandal, Kentaro Yahiro, Makoto Yokoo

    Economics Letters   217   110675 - 110675   2022.6   （ ISSN:0165-1765 eISSN:1873-7374 ）

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

    Many real matching markets are subject to distributional constraints. When the set of feasible matchings is restricted by some distributional constraints, a stable matching may not exist. In contrast, a weakly stable matching is guaranteed to exist under a very general class of constraints that satisfies a condition called heredity. However, it has been an open question whether a weakly stable matching can be obtained by a strategy-proof mechanism. We negatively answer this open question; no weakly stable and strategy-proof mechanism exists under any heredity feasibility constraint in general.

    DOI： 10.1016/j.econlet.2022.110675

    Web of Science

    Scopus

    researchmap

  • Fair and Truthful Mechanism with Limited Subsidy.

    Hiromichi Goko, Ayumi Igarashi 0001, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo

    21st International Conference on Autonomous Agents and Multiagent Systems(AAMAS)   534 - 542   2022.5

    　More details

    Language：Others   Publishing type：Research paper (other academic)  

  • Strategy-Proof House Allocation with Existing Tenants over Social Networks. Reviewed

    Bo You, Ludwig Dierks, Taiki Todo, Minming Li, Makoto Yokoo

    21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022)   1446 - 1454   2022.5

    　More details

    Language：English  

  • Proactive Dynamic Distributed Constraint Optimization Problems. Reviewed International journal

    Khoi D. Hoang, Ferdinando Fioretto, Ping Hou, William Yeoh, Makoto Yokoo, Roie Zivan

    Journal of Artificial Intelligence Research   74   179 - 225   2022.5

    　More details

    Language：English  

    DOI： 10.1613/jair.1.13499

  • Fair and Truthful Mechanism with Limited Subsidy Reviewed

    Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo

    21st International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2022)   534 - 542   2022.5

  • Fair and Truthful Mechanism with Limited Subsidy.

    Hiromichi Goko, Ayumi Igarashi 0001, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo

    21st International Conference on Autonomous Agents and Multiagent Systems(AAMAS)   534 - 542   2022.5   （ ISBN:9781450392136 ）

    　More details

    Publishing type：Research paper (international conference proceedings)   Publisher：International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)  

    researchmap

    Other Link： https://dl.acm.org/doi/10.5555/3535850.3535911

  • Strategy-Proof House Allocation with Existing Tenants over Social Networks. Reviewed

    Bo You, Ludwig Dierks, Taiki Todo, Minming Li, Makoto Yokoo

    AAMAS   1446 - 1454   2022.5   （ ISBN:9781450392136 ）

    　More details

    Publishing type：Research paper (international conference proceedings)   Publisher：International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)  

    researchmap

    Other Link： https://dl.acm.org/doi/10.5555/3535850.3536011

  • Concise integer linear programming formulation for clique partitioning problems. Reviewed International journal

    Miyuki Koshimura, Emi Watanabe, Yuko Sakurai, Makoto Yokoo

    Constraints   27 ( 1-2 )   99 - 115   2022.4   （ ISSN:1383-7133 eISSN:1572-9354 ）

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10601-022-09326-z

    Web of Science

    Scopus

    researchmap

  • Matching Market Design with Constraints Reviewed International journal

    Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2022)   36 ( 11 )   12308 - 12316   2022.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： https://doi.org/10.1609/aaai.v36i11.21495

  • Measuring power in coalitional games with friends, enemies and allies. Reviewed

    Oskar Skibski, Takamasa Suzuki, Tomasz Grabowski, Yuko Sakurai, Tomasz P. Michalak, Makoto Yokoo

    Artificial Intelligence   313   103792 - 103792   2022.2   （ ISSN:00043702 ）

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2022.103792

    Scopus

    researchmap

  • Manipulation-resistant false-name-proof facility location mechanisms for complex graphs Reviewed International journal

    Ilan Nehama, Taiki Todo, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   36 ( 12 )   12 - 12   2022.1   （ ISSN:1387-2532 eISSN:1573-7454 ）

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-021-09535-5

    Web of Science

    Scopus

    researchmap

  • An improved exact algorithm for multi-agent pathfinding problems

    SHIBATA Koshi, KIMURA Kei, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2022 ( 0 )   1N1GS503 - 1N1GS503   2022

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>The multi-agent pathfinding (MAPF) problem takes as input a set of agents with different starts and goals, and assigns a path that does not cause conflicts among the agents. There is a powerful exact algorithm called Meta-Agent Conflict Based Search (MA-CBS) for minimizing the sum of the costs for each agent to reach the goal, which is known to be NP-hard. The behavior of MA-CBS varies depending on a condition called the merge policy, but it is known that it requires a huge amount of execution time for some MAPF instances under the conventional static merge policy. In this paper, we propose a new merge policy that dynamically changes the properties of the algorithm, and show by computer experiments that the algorithm that implements the proposed merge policy runs efficiently on more various instances than the conventional one.</p>

    DOI： 10.11517/pjsai.jsai2022.0_1n1gs503

    CiNii Research

  • Two-Sided Matching over Social Networks

    CHO Sung Ho, TODO Taiki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2022 ( 0 )   2N4GS505 - 2N4GS505   2022

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>A new paradigm of mechanism design, called mechanism design over social networks, investigates agents’ incentives to diffuse the information of mechanisms to their followers over social networks. In this paper we consider it for two-sided matching, where the agents on one side, say students, are distributed over social networks and thus are not fully observable from the mechanism designer, while the agents on the other side, say colleges, are known a priori. The main purpose of this paper is to clarify the existence of mechanisms that satisfy several properties that are classified into four criteria: incentive constraints, efficiency constraints, stability constraints, and fairness constraints. We proposed three mechanisms and showed that no mechanism is better than these mechanisms, i.e., they are in the Pareto frontier according to the set of properties defined in this paper.</p>

    DOI： 10.11517/pjsai.jsai2022.0_2n4gs505

    CiNii Research

  • Two-Sided Matching over Social Networks

    Cho S.H., Todo T., Yokoo M.

    IJCAI International Joint Conference on Artificial Intelligence   186 - 193   2022   （ ISSN:10450823 ISBN:9781956792003 ）

    　More details

    Publisher：IJCAI International Joint Conference on Artificial Intelligence  

    A new paradigm of mechanism design, called mechanism design over social networks, investigates agents' incentives to diffuse the information of mechanisms to their followers over social networks. In this paper we consider it for two-sided matching, where the agents on one side, say students, are distributed over social networks and thus are not fully observable to the mechanism designer, while the agents on the other side, say colleges, are known a priori. The main purpose of this paper is to clarify the existence of mechanisms that satisfy several properties that are classified into four criteria: incentive constraints, efficiency constraints, stability constraints, and fairness constraints. We proposed three mechanisms and showed that no mechanism is better than these mechanisms, i.e., they are in the Pareto frontier according to the set of properties defined in this paper.

    Scopus

  • Strategy-Proof House Allocation with Existing Tenants over Social Networks

    You B., Dierks L., Todo T., Li M., Yokoo M.

    Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS   3   1446 - 1454   2022   （ ISSN:15488403 ISBN:9781713854333 ）

    　More details

    Publisher：Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS  

    Mechanism design over social networks, whose goal is to incentivize agents to diffuse the information of a mechanism to their followers, as well as to report their true preferences, is one of the new trends in market design. In this paper, we reconsider the traditional house allocation problem with existing tenants from the perspective of mechanism design over social networks. Since our model is a generalization of the networked housing market investigated by Kawasaki et al. [9], no mechanism simultaneously satisfies strategy-proofness, individual rationality and Pareto efficiency for general social network structures. We therefore examine the cases where the social network has a tree structure. We first show that even for the restricted structure, a weaker welfare requirement called non-wastefulness is not achievable by any strategy-proof and individually rational mechanism. We then show that a non-trivial modification of You Request My House - I Get Your Turn mechanism (YRMH-IGYT) is individually rational, strategy-proof, and weakly non-wasteful. Furthermore, it chooses an allocation in the strict core for neighbors and satisfies weak group strategy-proofness.

    Scopus

  • R-MaxSAT : MaxSAT with adversary

    YAMASHITA Kaito, SUGAHARA Tomoya, KOSHIMURA Miyuki, YOKOO Makoto

    Proceedings of the Annual Conference of JSAI   JSAI2022 ( 0 )   4F1OS8a04 - 4F1OS8a04   2022

    　More details

    Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

    <p>This paper presents a new problem called Robust weighted Partial Maximum Satisfiability (R-PMaxSAT), which is an extension of Robust MaxSAT (R-MaxSAT) whose decision version is Sigma2P-complete. In R-MaxSAT (or R-PMaxSAT), a problem solver called the defender expects to maximize the number of satisfied clauses (or the sum of their weights) as a standard MaxSAT, although the obtained solution must be robust. We presume an adversary called the attacker will modify some variables after the defender decides a solution. R-PMaxSAT can formalize a robust Clique Partitioning Problem (robust CPP), where CPP has many real-life applications. Then, we introduce two algorithms to solve R-PMaxSAT, by utilizing a modern SAT solver or a QBF solver as a subroutine. Our experimental results show that we can obtain optimal solutions within reasonable time for randomly generated R-MaxSAT instances and robust CPP instances based on CPP benchmark problems.</p>

    DOI： 10.11517/pjsai.jsai2022.0_4f1os8a04

    CiNii Research

  • Proactive Dynamic Distributed Constraint Optimization Problems

    Hoang, KD; Fioretto, F; Hou, P; Yeoh, W; Yokoo, M; Zivan, R

    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH   74   179 - 225   2022   （ ISSN:1076-9757 eISSN:1943-5037 ）

    　More details

  • Matching Market Design with Constraints.

    Haris Aziz 0001, Péter Biró, Makoto Yokoo

    Thirty-Sixth AAAI Conference on Artificial Intelligence(AAAI)   12308 - 12316   2022   （ ISBN:9781577358763 ）

    　More details

    Publishing type：Research paper (international conference proceedings)   Publisher：AAAI Press  

    DOI： 10.1609/aaai.v36i11.21495

    researchmap

    Other Link： https://dblp.uni-trier.de/db/conf/aaai/aaai2022.html#0001BY22

  • Matching Market Design with Constraints

    Aziz, H; Biró, P; Yokoo, M

    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE   12308 - 12316   2022   （ ISSN:2159-5399 ISBN:978-1-57735-876-3 eISSN:2374-3468 ）

    　More details

  • Fair and Truthful Mechanism with Limited Subsidy

    Goko H., Igarashi A., Kawase Y., Makino K., Sumita H., Tamura A., Yokoi Y., Yokoo M.

    Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS   1   534 - 542   2022   （ ISSN:15488403 ISBN:9781713854333 ）

    　More details

    Publisher：Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS  

    The notion of envy-freeness is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guaranteed to exist. Classical works have avoided this issue by introducing an additional divisible resource, i.e., money, to subsidize envious agents. In this paper, we aim to design a truthful allocation mechanism of indivisible goods to achieve both fairness and efficiency criteria with a limited amount of subsidy. Following the work of Halpern and Shah, our central question is as follows: to what extent do we need to rely on the power of money to accomplish these objectives? We show that, when agents have matroidal valuations, there is a truthful allocation mechanism that achieves envy-freeness and utilitarian optimality by subsidizing each agent with at most 1, the maximum marginal contribution of each item for each agent. The design of the mechanism rests crucially on the underlying matroidal M-convexity of the Lorenz dominating allocations. For superadditive valuations, we show that there is a truthful mechanism that achieves envy-freeness and utilitarian optimality, with each agent receiving a subsidy of at most m; furthermore, we show that the amount m is necessary even when agents have additive valuations.

    Scopus

  • Daycare Matching in Japan: Transfers and Siblings.

    Zhaohong Sun 0001, Yoshihiro Takenami, Daisuke Moriwaki, Yoji Tomita, Makoto Yokoo

    CoRR   abs/2212.02751   2022

    　More details

    Publishing type：Research paper (scientific journal)  

    DOI： 10.48550/arXiv.2212.02751

    researchmap

  • Lazy Gale-Shapley for Many-to-One Matching with Partial Information. Reviewed

    Taiki Todo, Ryoji Wada, Kentaro Yahiro, Makoto Yokoo

    Algorithmic Decision Theory - 7th International Conference (ADT 2021)   390 - 405   2021.11

    　More details

    Language：English  

  • New Algorithms for Japanese Residency Matching Reviewed

    Zhaohong Sun, Taiki Todo, Makoto Yokoo

    Thirtieth International Joint Conference on Artificial Intelligence (IJCAI 2021)   412 - 418   2021.8

    　More details

    Language：English  

  • Lazy Gale-Shapley for Many-to-One Matching with Partial Information. Reviewed

    Taiki Todo, Ryoji Wada, Kentaro Yahiro, Makoto Yokoo

    Algorithmic Decision Theory - 7th International Conference(ADT)   390 - 405   2021.6

    　More details

    Language：Others   Publishing type：Research paper (other academic)  

    DOI： 10.1007/978-3-030-87756-9_25

  • Mechanism Design for Housing Markets over Social Networks Reviewed International journal

    Takehiro Kawasaki, Ryoji Wada, Taiki Todo, Makoto Yokoo

    20th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2021)   692 - 700   2021.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • False-Name-Proof Facility Location on Discrete Structures Reviewed International journal

    Taiki Todo, Nodoka Okada, Makoto Yokoo

    24th European Conference on Artificial Intelligence (ECAI-2020)   227 - 234   2020.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.3233/FAIA200097

  • Split Manipulations in Cost Sharing of Minimum Cost Spanning Tree Reviewed International journal

    Taiki Todo, Makoto Yokoo

    24th European Conference on Artificial Intelligence (ECAI-2020)   219 - 226   2020.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.3233/FAIA200096

  • New Algorithms for Continuous Distributed Constraint Optimization Problems Reviewed International journal

    Khoi Hoang, William Yeoh, Makoto Yokoo, Zinovi Rabinovich

    19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2020)   502 - 510   2020.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • New Algorithms for Continuous Distributed Constraint Optimization Problems. Reviewed

    Khoi D. Hoang, William Yeoh 0001, Makoto Yokoo, Zinovi Rabinovich

    Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems(AAMAS)   502 - 510   2020.5

    　More details

    Language：Others   Publishing type：Research paper (other academic)  

  • Signed Graph Games: Coalitional Games with Friends, Enemies and Allies Reviewed International journal

    Oskar Skibski, Takamasa Suzuki, Tomasz Grabowski, Tomasz Michalak, Makoto Yokoo

    19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2020)   1287 - 1295   2020.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Game Theoretic Analysis for Two-Sided Matching with Resource Allocation Reviewed International journal

    Kentaro Yahiro, Makoto Yokoo

    19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2020)   1548 - 1556   2020.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach Reviewed

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI-2020)   34 ( 2 )   2038 - 2045   2020.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach

    DOI： 10.1609/aaai.v34i02.5576

  • Strategyproof and fair matching mechanism for ratio constraints Reviewed International journal

    Kentaro Yahiro, Yuzhe Zhang, Nathanael Barrot, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   23   2020.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-020-09448-9

  • Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach Reviewed International journal

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-2020)   2038 - 2045   2020.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1609/aaai.v34i02.5576

  • Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network Reviewed International journal

    Takehiro Kawasaki, Seiji Takanashi, Nathanael Barrot, Taiki Todo, Makoto Yokoo

    Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-2020)   2062 - 2069   2020.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1609/aaai.v34i02.5579

  • Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities. Reviewed

    Oskar Skibski, Tomasz P. Michalak, Yuko Sakurai, Michael J. Wooldridge, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   34 ( 1 )   11 - 11   2020.1

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-019-09429-7

  • Strategyproof and Fair Matching Mechanism for Ratio Constraints Reviewed

    Autonomous Agents and Multi-Agent Systems   34 ( 1 )   23 - 23   2020.1

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-020-09448-9

  • SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location Reviewed International journal

    Nodoka Okada, Taiki Todo, Makoto Yokoo

    22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019   321 - 337   2019.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-030-33792-6_20

  • 最短経路探索問題のための動的計画法へのコスト平準化の指標の適用 Reviewed

    松井 俊浩, マリウス シラギ, 平山 勝敏, 横尾 真, 松尾 啓志

    情報処理学会論文誌   60 ( 10 )   1603 - 1616   2019.10

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Solving Coalition Structure Generation Problems over Weighted Graph Reviewed International journal

    Emi Watanabe, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

    22nd International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019   338 - 353   2019.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-030-33792-6_21

  • Attachment centrality: Measure for connectivity in networks Reviewed International journal

    Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Makoto Yokoo

    Artificial Intelligence   274   151 - 179   2019.9

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2019.03.002

  • Stable and envy-free partitions in hedonic games Reviewed International journal

    28th International Joint Conference on Artificial Intelligence, IJCAI 2019   67 - 73   2019.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.24963/ijcai.2019/10

  • Robustness against agent failure in hedonic games Reviewed International journal

    Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo

    Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019   364 - 370   2019.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.24963/ijcai.2019/52

  • Diffusion and auction on graphs Reviewed International journal

    Bin Li, Dong Hao, Dengji Zhao, Makoto Yokoo

    28th International Joint Conference on Artificial Intelligence, IJCAI 2019   435 - 441   2019.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Competitive Auctions and Envy-Freeness for Group of Agents Reviewed

    Taiki Todo, Atsushi Iwasaki, Makoto Yokoo

    25th International Computing and Combinatorics Conference (COCOON-2019)   541 - 553   2019.7

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    DOI： 10.1007/978-3-030-26176-4_45

  • Weighted Matching Markets with Budget Constraints Reviewed International journal

    Anisse Ismaili, Naoto Hamada, Yuzhe Zhang, Takamasa Suzuki, Makoto Yokoo

    Journal of Artificial Intelligence Research   65   393 - 421   2019.7

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Manipulation-resistant facility location mechanisms for ZV-line graphs Reviewed International journal

    Ilan Nehama, Taiki Todo, Makoto Yokoo

    18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019   1452 - 1460   2019.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Competitive Auctions and Envy-Freeness for Group of Agents. Reviewed

    Taiki Todo, Atsushi Iwasaki, Makoto Yokoo

    Computing and Combinatorics - 25th International Conference(COCOON)   541 - 553   2019.5

    　More details

    Language：Others   Publishing type：Research paper (other academic)  

    DOI： 10.1007/978-3-030-26176-4_45

  • Parameterized heuristics for incomplete weighted CSPs with elicitation costs Reviewed International journal

    Atena M. Tabakhi, William Yeoh, Makoto Yokoo

    18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019   476 - 484   2019.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Privacy stochastic games in distributed constraint reasoning Reviewed

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Ren{'e, Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    Annals of Mathematics and Artificial Intelligence   88 ( 7 )   691 - 715   2019.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Privacy stochastic games in distributed constraint reasoning

    DOI： 10.1007/s10472-019-09628-8

  • 分割決定木を用いた分割関数ゲームの提携構造形成アルゴリズム Reviewed

    査 澳龍, 越村 三幸, 櫻井 祐子, 横尾 真

    電子情報通信学会論文誌D   J102-D ( 4 )   2019.4

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

    提携構造形成問題は協力ゲーム理論の問題の一つで，エージェント集合を社会的利得が最大となるよう分割する問題である．本論文で扱う分割関数ゲームでは，分割で得られる個々のチーム（提携）の利得はそのチームのメンバーだけでは決まらず，他チームのメンバー構成の影響も受ける．また提携の利得は必ずしも正であるとは限らず，負の利得もあり得る．分割決定木は分割関数ゲームの簡潔記述法の一つである．本論文では，分割決定木で記述された問題の二つの解法を提案する．一つは深さ優先分枝限定法に基づくアルゴリズムで，もう一つはMaxSAT問題に帰着させる手法である．ランダムに生成した数千のインスタンスによる計算機実験を行い，利得が正のみの問題に対しては前者が優れ，負の利得もある問題に対しては後者が優れていることが分かった．<br />

    DOI： 10.14923/transinfj.2018JDP7037

  • Attachment centrality: Measure for connectivity in networks. Reviewed

    Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Makoto Yokoo

    Artificial Intelligence   274   151 - 179   2019.2

    　More details

    Language：Others   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2019.03.002

  • Improved WPM encoding for coalition structure generation under MC-nets Reviewed

    Xiaojuan Liao, Miyuki Koshimura, Kazuki Nomoto, Suguru Ueda, Yuko Sakurai, Makoto Yokoo

    Constraints   24 ( 1 )   25 - 55   2019.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Improved WPM encoding for coalition structure generation under MC-nets

    DOI： 10.1007/s10601-018-9295-4

  • Unknown Agents in Friends Oriented Hedonic Games: Stability and Complexity Stability and Complexity Reviewed International journal

    Nathanael Barrot, Kazunori Ota, Yuko Sakurai, Makoto Yokoo

    Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-2019)   1756 - 1763   2019.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Privacy stochastic games in distributed constraint reasoning Reviewed

    Annals of Mathematics and Artificial Intelligence   2019.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10472-019-09628-8

  • Improved WPM encoding for coalition structure generation under MC-nets Reviewed

    Xiaojuan Liao, Miyuki Koshimura, Kazuki Nomoto, Suguru Ueda, Yuko Sakurai, Makoto Yokoo

    Constraints   24 ( 1 )   25 - 55   2019.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10601-018-9295-4

  • A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences Reviewed International journal

    Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo, Makoto Yokoo

    Journal of Artificial Intelligence Research   Res.63   515 - 555   2018.11

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1613/jair.1.11254

  • Student-project-resource allocation Complexity of the symmetric case Reviewed International journal

    Anisse Ismaili, Tomoaki Yamaguchi, Makoto Yokoo

    21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018   226 - 241   2018.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-030-03098-8_14

  • Repeated triangular trade Sustaining circular cooperation with observation errors Reviewed International journal

    Kota Shigedomi, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo

    21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018   242 - 257   2018.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-030-03098-8_15

  • Efficient allocation mechanism with endowments and distributional constraints Reviewed International journal

    Takamasa Suzuki, Akihisa Tamura, Makoto Yokoo

    17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018   50 - 67   2018.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Designing matching mechanisms under constraints: An approach from discrete convex analysis Reviewed

    Fuhito Kojima, Akihisa Tamura, Makoto Yokoo

    Journal of Economic Theory   176   803 - 833   2018.7

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.jet.2018.05.004

  • Strategyproof and fair matching mechanism for ratio constraints. Reviewed International journal

    Kentaro Yahiro, Yuzhe Zhang, Nathanael Barrot, Makoto Yokoo

    17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2018)   59 - 67   2018.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategyproof and fair matching mechanism for union of symmetric m-convex constraints Reviewed International journal

    27th International Joint Conference on Artificial Intelligence, IJCAI 2018   590 - 596   2018.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Facility location with variable and dynamic populations Reviewed International journal

    Yuho Wada, Tomohiro Ono, Taiki Todo, Makoto Yokoo

    17th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2018   336 - 344   2018.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Designing matching mechanisms under constraints: An approach from discrete convex analysis Reviewed International journal

    Fuhito Kojima, Akihisa Tamura, Makoto Yokoo

    Journal of Economic Theory   178   803 - 833   2018.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.jet.2018.05.004

  • Coalition structure generation in cooperative games with compact representations Reviewed International journal

    Suguru Ueda, Atsushi Iwasaki, Vincent Conitzer, Naoki Ohta, Yuko Sakurai, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   32 ( 4 )   503 - 533   2018.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-018-9386-z

  • Leximin Asymmetric Multiple Objective Distributed Constraint Optimization Problem Reviewed

    Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo

    Computational Intelligence   34 ( 1 )   49 - 84   2018.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1111/coin.12106

  • Facility Location Games with Fractional Preferences Reviewed International journal

    Chi Kit Ken Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo

    Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-2018)   1039 - 1046   2018.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Facility location games with fractional preferences Reviewed International journal

    Ken C.K. Fong, Minming Li, Pinyan Lu, Taiki Todo, Makoto Yokoo

    32nd AAAI Conference on Artificial Intelligence, AAAI 2018   1039 - 1046   2018.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Leximin Asymmetric Multiple Objective Distributed Constraint Optimization Problem Reviewed International journal

    Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo

    Computational Intelligence   34 ( 1 )   49 - 84   2018.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1111/coin.12106

  • Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    Fundamenta Informaticae   158 ( No.1-3, )   63 - 91   2018.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.3233/FI-2018-1642

  • Strategy-proof Cake Cutting Mechanisms for All-or-nothing Utility Reviewed International journal

    Takamasa Ihara, Shunsuke Tsuruta, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    Fundamenta Informaticae   158 ( 1-3 )   41 - 61   2018.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.3233/FI-2018-1641

  • Stochastic Game Modelling for Distributed Constraint Reasoning with Privacy Reviewed International journal

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018)   2018.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Study of route optimization considering bottlenecks and fairness among partial paths Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    10th International Conference on Agents and Artificial Intelligence, ICAART 2018   37 - 47   2018.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation Reviewed

    Aolong Zha, Kazuki Nomoto, Suguru Ueda, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

    Proceedings of PRIMA 2017   143 - 159   2017.10

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Coalition Structure Generation for Partition Function Games Utilizing a Concise Graphical Representation

    DOI： 10.1007/978-3-319-69131-2_9

  • Coalition Structure Generation for Partition Function Games by Utilizing a Concise Graphical Representation Reviewed International journal

    Aolong Zha, Kazuki Nomoto, Suguru Ueda, Miyuki Koshimura, Yuko Sakurai, Makoto Yokoo

    20th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2017)   143 - 159   2017.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences Reviewed International journal

    Tomohiro Ono, Taiki Todo, Makoto Yokoo

    20th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2017)   163 - 179   2017.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • 二値効用下でのケーキ分割問題 Reviewed

    伊原 尚正，東藤 大樹，櫻井 祐子，横尾 真

    人工知能学会論文誌   32 ( 5 )   AG16-E 1 - 9   2017.9

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Strategy-proof School Choice Mechanisms with Minimum Quotas and Initial Endowments Reviewed International journal

    Makoto Yokoo, Naoto Hamada, Chia-Ling Hsu, Ryoji Kurata, Takamasa Suzuki, Suguru Ueda

    Artificial Intelligence Journal   ( 246 )   47 - 71   2017.8

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2017.04.006

  • Strategy-proof school choice mechanisms with minimum quotas and initial endowments Reviewed

    Naoto Hamada, Chia-Ling Hsu, Ryoji Kurata, Takamasa Suzuki, Suguru Ueda, Makoto Yokoo

    ARTIFICIAL INTELLIGENCE   249   47 - 71   2017.8

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2017.04.006

  • Core Stability in Hedonic Games among Friends and Enemies: Impact of Neutrals Reviewed International journal

    Kazunori Ohta, Nathanael Barrot, Anisse Ismaili, Yuko Sakurai, Makoto Yokoo

    26th International Joint Conference on Artificial Intelligence (IJCAI-2017)   359 - 365   2017.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Designing Matching Mechanisms under General Distributional Constraints Reviewed International journal

    Makoto Yokoo, Masahiro Goto, Fuhito Kojima, Ryoji Kurata, Akihisa Tamura

    American Economic Journal   9 ( 2 )   226 - 262   2017.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1257/mic.20160124

  • Designing Matching Mechanisms under General Distributional Constraints Reviewed

    Masahiro Goto, Fuhito Kojima, Ryoji Kurata, Akihisa Tamura, Makoto Yokoo

    AMERICAN ECONOMIC JOURNAL-MICROECONOMICS   9 ( 2 )   226 - 262   2017.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1257/mic.20160124

  • Utilitarian Approach to Privacy in Distributed Constraint Optimization Problems Reviewed International journal

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    Thirtieth International Florida Artificial Intelligence Research Society Conference (FLAIRS-2017)   454 - 459   2017.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Weighted matching markets with budget constraints Reviewed International journal

    Naoto Hamada, Anisse Ismaili, Takamasa Suzuki, Makoto Yokoo

    16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017   317 - 325   2017.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Manipulation of hamming-based approval voting for multiple referenda and committee elections Reviewed International journal

    16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017   1   597 - 605   2017.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Infinite-horizon proactive dynamic DCOPs Reviewed International journal

    Khoi D. Hoang, Ping Hou, Ferdinando Fioretto, William Yeoh, Roie Zivan, Makoto Yokoo

    16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017   212 - 220   2017.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Coalition structure generation and cs-core Results on the tractability frontier for games represented by MC-nets Reviewed International journal

    Julien Lesca, Patrice Perny, Makoto Yokoo

    16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017   308 - 316   2017.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors Reviewed International journal

    Fuuki Shigenaka, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo

    Thirty-First AAAI Conference on Artificial Intelligence (AAAI-2017)   677 - 683   2017.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Controlled School Choice with Soft Bounds and Overlapping Types Invited Reviewed International journal

    Makoto Yokoo, Ryoji Kurata, Naoto Hamada, Atsushi Iwasaki

    Journal of Artificial Intelligence Research   58   153 - 184   2017.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1613/jair.5297

  • An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting Reviewed

    Oskar Skibski, Makoto Yokoo

    IEEE INTELLIGENT SYSTEMS   32 ( 1 )   32 - 39   2017.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1109/MIS.2017.3

  • An Algorithm for the Myerson Value in Probabilistic Graphs with an Application to Weighted Voting Reviewed International journal

    Makoto Yokoo, Oskar Skibski

    IEEE Intelligent Systems   32 ( 1 )   32 - 39   2017.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1109/MIS.2017.3

  • Individually rational strategy-proof social choice with exogenous indifference sets Reviewed International journal

    Mingyu Guo, Yuko Sakurai, Taiki Todo, Makoto Yokoo

    19th International Conference on Princiles and Practice of Multi-Agent Systems, PRIMA 2016   181 - 196   2016.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-319-44832-9_11

  • DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents Reviewed International journal

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI-2016)   359 - 366   2016.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategyproof matching with regional minimum and maximum quotas Reviewed

    Masahiro Goto, Atsushi Iwasaki, Yujiro Kawasaki, Ryoji Kurata, Yosuke Yasuda, Makoto Yokoo

    Artificial Intelligence   235   40 - 57   2016.6

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2016.02.002

  • Strategyproof matching with regional minimum and maximum quotas Reviewed

    Masahiro Goto, Atsushi Iwasaki, Yujiro Kawasaki, Ryoji Kurata, Yosuke Yasuda, Makoto Yokoo

    ARTIFICIAL INTELLIGENCE   235   40 - 57   2016.6

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2016.02.002

  • Attachment centrality An axiomatic approach to connectivity in networks Reviewed International journal

    Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Makoto Yokoo

    15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016   168 - 176   2016.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Proactive dynamic distributed constraint optimization Reviewed International journal

    Khoi D. Hoang, Ferdinando Fioretto, Ping Hou, Makoto Yokoo, William Yeoh, Roie Zivan

    15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016   597 - 605   2016.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Pareto efficient strategy-proof school choice mechanism with minimum quotas and initial endowments Reviewed International journal

    Ryoji Kurata, Naoto Hamada, Chia Ling Hsu, Takamasa Suzuki, Suguru Ueda, Makoto Yokoo

    15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016   59 - 67   2016.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Manipulations in two-agent sequential allocation with random sequences Reviewed International journal

    Yuto Tominaga, Taiki Todov, Makoto Yokoo

    15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016   141 - 149   2016.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • K-coalitional cooperative games Reviewed International journal

    Oskar Skibski, Szymon Matejczyk, Tomasz P. Michalak, Michael Wooldridge, Makoto Yokoo

    15th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2016   177 - 185   2016.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • False-name-proof locations of two facilities Economic and algorithmic approaches Reviewed International journal

    Akihisa Sonoda, Taiki Todo, Makoto Yokoo

    30th AAAI Conference on Artificial Intelligence, AAAI 2016   615 - 621   2016.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Bayesian network-based extension for PGP - Estimating petition support Reviewed International journal

    Marius Silaghi, Song Qui, Toshihiro Matsui, Makoto Yokoo, Katsutoshi Hirayama

    29th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2016   98 - 103   2016.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategyproof matching with minimum quotas Reviewed

    Daniel Fragiadakis, Atsushi Iwasaki, Peter Troyan, Suguru Ueda, Makoto Yokoo

    ACM Transactions on Economics and Computation   4 ( 1 )   2015.12

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1145/2841226

  • How is cooperation/collusion sustained in repeated multimarket contact with observation errors? Reviewed

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    AAAI Fall Symposium on Sequential Decision Making for Intelligent Agents   46 - 53   2015.11

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    How is cooperation/collusion sustained in repeated multimarket contact with observation errors?

  • Flexible reward plans for crowdsourced tasks Reviewed International journal

    Yuko Sakurai, Masato Shinoda, Satoshi Oyama, Makoto Yokoo

    18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015   400 - 415   2015.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-319-25524-8_25

  • Leximin Asymmetric Multiple Objective DCOP on Factor Graph Reviewed

    Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    Proceedings of the 18th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2015)   134 - 151   2015.10

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Leximin Asymmetric Multiple Objective DCOP on Factor Graph

    DOI： 10.1007/978-3-319-25524-8_9

  • Leximin Asymmetric Multiple Objective DCOP on Factor Graph Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi, Hirayama, Makoto Yokoo, Hiroshi Matsuo

    18th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2015)   134 - 151   2015.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategy-proof cake cutting mechanisms for all-or-nothing utility Reviewed International journal

    Takamasa Ihara, Shunsuke Tsuruta, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015   118 - 133   2015.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-319-25524-8_8

  • Leximin asymmetric multiple objective DCOP on factor graph Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Tenda Okimoto, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    18th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2015   134 - 151   2015.10

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-319-25524-8_9

  • A pseudo-polynomial algorithm for computing power indices in graph-restricted weighted voting games Reviewed International journal

    Oskar Skibski, Tomasz P. Michalak, Yuko Sakurai, Makoto Yokoo

    24th International Joint Conference on Artificial Intelligence, IJCAI 2015   631 - 637   2015.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Exchange of indivisible objects with asymmetry Reviewed International journal

    Zhaohong Sun, Hideaki Hata, Taiki Todo, Makoto Yokoo

    24th International Joint Conference on Artificial Intelligence, IJCAI 2015   97 - 103   2015.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences Reviewed International journal

    Etsushi Fujita, Julien Lesca, Akihisa Sonoda, Taiki Todo, Makoto Yokoo

    29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015   2   907 - 913   2015.6

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Designing matching mechanisms under general distributional constraints (extended abstract) Reviewed

    Masahiro Goto, Fuhito Kojima, Ryoji Kurata, Akihisa Tamura, Makoto Yokoo

    EC 2015 - Proceedings of the 2015 ACM Conference on Economics and Computation   259 - 260   2015.6

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    DOI： 10.1145/2764468.2764501

  • Controlled school choice with soft bounds and overlapping types Reviewed International journal

    Ryoji Kurata, Masahiro Goto, Atsushi Iwasaki, Makoto Yokoo

    29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015   951 - 957   2015.6

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • A graphical representation for games in partition function form Reviewed International journal

    Oskar Skibski, Tomasz P. Michalak, Yuko Sakurai, Michael Wooldridge, Makoto Yokoo

    29th AAAI Conference on Artificial Intelligence, AAAI 2015 and the 27th Innovative Applications of Artificial Intelligence Conference, IAAI 2015   1036 - 1042   2015.6

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Finding core for coalition structure utilizing dual solution Reviewed

    Atsushi Iwasaki, Suguru Ueda, Naoyuki Hashimoto, Makoto Yokoo

    Artificial Intelligence   222   49 - 66   2015.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2015.01.001

  • Parametric mechanism design via quantifier elimination Reviewed

    Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Hidenao Iwane, Hirokazu Anai, Mingyu Guo, Makoto Yokoo

    Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS2015)   1885 - 1886   2015.5

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Parametric mechanism design via quantifier elimination

  • Social decision with minimal efficiency loss An automated mechanism design approach Reviewed International journal

    Mingyu Guo, Hong Shen, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015   1   347 - 355   2015.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Fairness and false-name manipulations in randomized cake cutting Reviewed International journal

    Shunsuke Tsuruta, Masaaki Oka, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015   2   909 - 917   2015.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Improving fairness in nonwasteful matching with hierarchical regional minimum quotas Reviewed International journal

    Masahiro Goto, Ryoji Kurata, Naoto Hamada, Atsushi Iwasaki, Makoto Yokoo

    14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015   1887 - 1888   2015.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Can local caution restore global tacit collusion?: Repeated multimarket contact with observation Reviewed

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    AAAI Spring Symposium on Applied Computational Game Theory   ... - ...   2015.3

    　More details

    Language：English  

    Can local caution restore global tacit collusion?: Repeated multimarket contact with observation

  • How is cooperation/collusion sustained in repeated multimarket contact with observation errors? Reviewed International journal

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    AAAI 2015 Fall Symposium   46 - 53   2015.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Computing a payoff division in the least core for MC-nets coalitional games Reviewed International journal

    Katsutoshi Hirayama, Kenta Hanada, Suguru Ueda, Makoto Yokoo, Atsushi Iwasaki

    17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014   319 - 332   2014.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Leximin multiple objective optimization for preferences of agents Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    17th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2014   423 - 438   2014.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Predicting Own Action: Self-fulfilling Prophecy Induced by Proper Scoring Rules Reviewed International journal

    Masaaki Oka, Taiki Todo, Yuko Sakurai, Makoto Yokoo

    the Second AAAI Conference on Human Computation and Crowdsourcing (HCOMP-2014)   184 - 191   2014.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • 地域制約の下での戦略的操作不可能なマッチングメカニズム Reviewed

    横尾 真, 橋本　直幸, 上田　俊, 岩崎　敦, 安田　洋祐

    電子情報通信学会論文誌 D    J97-D ( 8 )   1336 - 1346   2014.8

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • False-name-proof combinatorial auction design via single-minded decomposition Reviewed International journal

    Dengji Zhao, Siqi Luo, Taiki Todo, Makoto Yokoo

    21st European Conference on Artificial Intelligence, ECAI 2014   945 - 950   2014.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.3233/978-1-61499-419-0-945

  • VCG-equivalent in Expectationメカニズム Reviewed

    横尾 真, 藤田 悦誌, 岩崎　敦, 東藤 大樹

    コンピュータソフトウェア (ソフトウェア科学会論文誌)   31 ( 3 )   156 - 167   2014.8

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Strategyproof exchange with multiple private endowments Reviewed International journal

    Taiki Todo, Haixin Sun, Makoto Yokoo

    28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014   805 - 811   2014.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Two case studies for trading multiple indivisible goods with indifferences Reviewed International journal

    Akihisa Sonoda, Etsushi Fujita, Taiki Todo, Makoto Yokoo

    28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014   791 - 797   2014.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Coexistence of utilitarian efficiency and false-name-proofness in social choice Reviewed International journal

    Julien Lesca, Taiki Todo, Makoto Yokoo

    13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014   1201 - 1208   2014.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Strategy-proof matching with regional minimum quotas

    Masahiro Goto, Naoyuki Hashimoto, Atshushi Iwasaki, Yujiro Kawasaki, Suguru Ueda, Yosuke Yasuda, Makoto Yokoo

    13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014   1225 - 1232   2014.5

    　More details

    Language：English   Publishing type：Research paper (other academic)  

  • Optimal false-name-proof single-item redistribution mechanisms Reviewed International journal

    Shunsuke Tsuruta, Masaaki Oka, Taiki Todo, Yujiro Kawasaki, Mingyu Guo, Yuko Sakurai, Makoto Yokoo

    13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014   221 - 228   2014.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Incentives in ridesharing with deficit control Reviewed International journal

    Dengji Zhao, Dongmo Zhang, Enrico H. Gerding, Yuko Sakurai, Makoto Yokoo

    13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014   1021 - 1028   2014.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • 分散制約最適化問題：擬似木に基づくハイブリッド型の解法の提案 Reviewed

    横尾 真, 沖本　天太, 山本　将, 櫻井 祐子, 井上　克巳

    電子情報通信学会論文誌   J96-D ( 12 )   2920 - 2928   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 多目的分散制約最適化問題における厳密／非厳密解法の提案 Reviewed

    沖本天太, 櫻井祐子, 横尾真, 井上克巳

    電子情報通信学会論文誌 D   J96-D(12)   2929 - 2938   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 分散制約最適化問題：擬似木に基づくハイブリッド型の解法の提案 Reviewed

    沖本天太, 山本将, 櫻井祐子, 横尾真, 井上克巳

    電子情報通信学会論文誌 D   J96-D(12)   2920 - 2928   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • エージェント間に外部性が存在する場合の戦略的操作不可能な割当 てメカニズムの提案 Reviewed

    櫻井 祐子, 沖本 天太, 横尾 真

    電子情報通信学会論文誌   J96-D ( 12 )   2960 - 2969   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Strategy-proof mechanisms for the k-winner selection problem Reviewed

    Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Makoto Yokoo

    In proceedings of the 13th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2013)   292 - 307   2013.12

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Strategy-proof mechanisms for the k-winner selection problem

    DOI： 10.1007/978-3-642-44927-7_20

  • Strategy-proof mechanisms for the k-winner selection problem Reviewed International journal

    Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Makoto Yokoo

    16th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2013   292 - 307   2013.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-44927-7_20

  • Embedding preference ordering for symmetric DCOP solvers on spanning trees Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    16th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2013   197 - 212   2013.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-44927-7_14

  • Addressing false identity attacks in action-based P2P social networks with an open census Reviewed International journal

    S. Qin, Marius C. Silaghi, T. Matsui, M. Yokoo, K. Hirayama

    2013 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology Workshops, WI-IATW 2013   50 - 57   2013.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1109/WI-IAT.2013.149

  • エージェント間に外部性が存在する場合の戦略的操作不可能な割当てメカニズムの提案 Reviewed

    横尾 真, 櫻井 祐子, 沖本　天太

    電子情報通信学会論文誌   J96-D ( 12 )   2960 - 2969   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 多目的分散制約最適化問題における厳密/非厳密解法の提案 Reviewed

    横尾 真, 沖本　天太, 櫻井 祐子, 井上　克巳

    電子情報通信学会論文誌   J96-D ( 12 )   2929 - 2938   2013.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Finding the core for coalition structure utilizing dual solution Reviewed International journal

    Atsushi Iwasaki, Suguru Ueda, Makoto Yokoo

    2013 12th IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2013   2   114 - 121   2013.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1109/WI-IAT.2013.99

  • Embedding Preference Ordering for Single-phase Self-stabilizing DCOP Solvers Reviewed

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    16th International Conference on Principles and Practice of Multi-Agent Systems(PRIMA 2013)   2013.11

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Embedding Preference Ordering for Single-phase Self-stabilizing DCOP Solvers

  • Ability grouping of crowd workers via reward discrimination Reviewed

    Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Masato Shinoda, Makoto Yokoo

    The AAAI Conference on Human Computation and Crowdsourcing (HCOMP 2013)   147 - 155   2013.11

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Ability grouping of crowd workers via reward discrimination

    DOI： 10.1609/hcomp.v1i1.13083

  • Ability Grouping of Crowd Workers via Reward Discrimination Reviewed International journal

    Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Masato Shinoda, Makoto Yokoo

    The First AAAI Conference on Human Computation and Crowdsourcing (HCOMP-2013)   147 - 155   2013.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • クラウドソーシングにおける必要ワーカ数の動的決定方法の提案

    櫻井 祐子, 岡 雅晃, 沖本 天太, 篠田 正人, 横尾 真

    第27回人工知能学会全国大会 (JSAI 2013)   2013.6

    　More details

    Language：Japanese  

  • クラウドソーシングでのタスク品質改善のための 価格設定の検討

    岡 雅晃, 沖本 天太, 櫻井 祐子, 篠田 正人, 横尾 真

    第27回人工知能学会全国大会 (JSAI 2013)   2013.6

    　More details

    Language：Japanese  

  • VCG-Equivalent in Expectation Mechanism: General Framework for Constructing Iterative Combinatorial Auction Mechanisms Reviewed International journal

    Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Miao Yao, Makoto Yokoo

    The twelfth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2013)   699 - 706   2013.5

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Pseudo-Tree Based Hybrid Algorithm for Distributed Constraint Optimization Reviewed

    Tenda Okimoto, Yuko Sakurai, Makoto Yokoo, Katsumi Inou

    Open Peer-Review Workshop on Decentralized Coordination 2013 (WDC 2013), Melbourne, Florida, USA,   2013.4

    　More details

    Language：Others  

    Pseudo-Tree Based Hybrid Algorithm for Distributed Constraint Optimization

  • DirectDemocracyP2P - Decentralized deliberative petition drives - Decentralized d Reviewed International journal

    Marius C. Silaghi, Khalid Alhamed, Osamah Dhannoon, Song Qin, Rahul Vishen, Ryan Knowles, Ihsan Hussien, Yi Yang, Toshihiro Matsui, Makoto Yokoo, Katsutoshi Hirayama

    13th IEEE International Conference on Peer-to-Peer Computing, IEEE P2P 2013   2013.1

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1109/P2P.2013.6688733

  • 限量記号付き分散制約最適化問題のための分散探索手法 Reviewed

    松井 俊浩, Marius C. Silagh, 平山 勝敏, 横尾 真, 松尾 啓志

    人工知能学会論文誌   28 ( 1 )   43 - 56   2013.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

    DOI： 10.1527/tjsai.28.43

  • 多目的制約最適化問題における対話型解法の提案 Reviewed

    沖本天太, ジョヨンジュン, 岩崎敦, 横尾真

    人工知能学会論文誌   28 ( 1 )   57 - 66   2013.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

    DOI： 10.1527/tjsai.28.57

  • Interactive algorithm for multi-objective constraint optimization Reviewed

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

    Transactions of the Japanese Society for Artificial Intelligence   28 ( 1 )   57 - 66   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1527/tjsai.28.57

  • Game Theory for Computer Scientist-Mechanism Design (Advanced). Reviewed

    Makoto Yokoo, Atsushi Iwasaki, Yuko Sakurai, Yoshio Okamoto

    Computer Software   30 ( 1 )   34 - 52   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.11309/jssst.30.1_34

  • Game Theory for Computer Scientists - Cooperative Games Reviewed

    Makoto Yokoo, Atsushi Iwasaki, Yuko Sakurai, Yoshio Okamoto

    Computer Software   30 ( 2 )   33 - 51   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.11309/jssst.30.2_33

  • Distributed search methods for Quantified Distributed Constraint Optimization Problem Reviewed

    Toshihiro Matsui, Marius C. Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    Transactions of the Japanese Society for Artificial Intelligence   28 ( 1 )   43 - 56   2013.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1527/tjsai.28.43

  • Effect of DisCSP variable-ordering heuristics in scale-free networks Reviewed International journal

    Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo

    13th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2010   166 - 180   2012.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-25920-3_12

  • Generalized partition mechanism Framework for combining multiple strategy-proof mechanisms Reviewed International journal

    Yuko Sakurai, Makoto Yokoo

    2012 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2012   502 - 509   2012.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1109/WI-IAT.2012.256

  • 部分観測可能マルコフ決定過程を用いた私的観測付き繰返しゲームにおける均衡分析プログラム Reviewed

    ジョ　ヨンジュン, 岩﨑 敦, 神取　道宏, 小原　一郎, 横尾 真

    情報処理学会論文誌   53 ( 11 )   2012.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Interactive algorithm for multi-objective constraint optimization Reviewed International journal

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo

    18th International Conference on Principles and Practice of Constraint Programming, CP 2012   561 - 576   2012.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-33558-7_41

  • 『計算機科学者のためのゲーム理論入門』シリーズ第3回 メカニズムデザイン Reviewed

    横尾 真, 岩﨑 敦, 櫻井 祐子, 岡本　吉央

    コンピュータ　ソフトウェア   29 ( 4 )   15 - 31   2012.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • A repeated game approach for analyzing the collusion on selective forwarding in multihop wireless networks Reviewed

    Dong Hao, Xiaojuan Liao, Avishek Adhikari, Kouichi Sakurai, Makoto Yokoo

    Computer Communications   35 ( 17 )   2125 - 2137   2012.10

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.comcom.2012.07.006

  • クラウドソーシングにおける品質コントロールの一考察 Reviewed

    櫻井 祐子, 沖本 天太, 岡 雅晃, 兵藤 明彦, 篠田 正人, 横尾 真

    合同エージェントワークショップ＆シンポジウム (JAWS-2012)   2012.10

    　More details

    Language：Japanese  

  • Interactive Algorithm for Multi-objective Constraint Optimization Reviewed

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo

    In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP-2012)   561 - 576   2012.10

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Interactive Algorithm for Multi-objective Constraint Optimization

    DOI： 10.1007/978-3-642-33558-7_41

  • BnB-ADOPT-p：分散制約最適化問題におけるハイブリッド型の解法の提案 Reviewed

    沖本 天太, 山本 将, 櫻井 祐子, 横尾 真, 井上 克巳

    合同エージェントワークショップ＆シンポジウム (JAWS-2012)   2012.10

    　More details

    Language：Japanese  

  • A repeated game approach for analyzing the collusion on selective forwarding in multihop wireless networks Reviewed

    Dong Hao, Xiaojuan Liao, Avishek Adhikari, Kouichi Sakurai, Makoto Yokoo

    Computer Communications   35 ( 17 )   2125 - 2137   2012.10

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.comcom.2012.07.006

  • Distributed problem solving Reviewed

    William Yeoh, Makoto Yokoo

    AI Magazine   33 ( 3 )   53 - 65   2012.9

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • 多目的制約最適化問題：ユーザとの対話型解法の提案 Reviewed

    沖本 天太, ジョ ヨンジュン, 岩崎 敦, 横尾 真

    第11回情報科学技術フォーラム (FIT-2012)   1   23 - 30   2012.9

    　More details

    Language：Japanese  

  • Distributed search method with bounded cost vectors on multiple objective DCOPs Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    15th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2012   7455 LNAI   137 - 152   2012.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-32729-2_10

  • 『計算機科学者のためのゲーム理論入門』シリーズ第2回 非協力ゲーム(発展編) Reviewed

    横尾 真, 岩﨑 敦, 櫻井 祐子, 岡本　吉央

    コンピュータ　ソフトウェア   29 ( 3 )   39 - 53   2012.7

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Effect of DisCSP variable-ordering heuristics in scale-free networks Reviewed

    Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo

    Multiagent and Grid Systems   8 ( 2 )   127 - 141   2012.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.3233/MGS-2012-0189

  • Effect of DisCSP Variable-Ordering Heuristics in Scale-free Networks Reviewed

    Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo

    Multiagent and Grid Systems - An International Journal 8   8 ( 2 )   127 - 141   2012.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Effect of DisCSP Variable-Ordering Heuristics in Scale-free Networks

    DOI： 10.3233/MGS-2012-0189

  • 『計算機科学者のためのゲーム理論入門』シリーズについて Reviewed

    横尾 真, 岩﨑 敦, 櫻井 祐子, 岡本　吉央

    コンピュータ　ソフトウェア   29 ( 2 )   65 - 68   2012.4

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 『計算機科学者のためのゲーム理論入門』シリーズについて

    横尾 真, 岩崎 敦, 櫻井 祐子, 岡本 吉央

    コンピュータソフトウェア   29 ( 2 )   65 - 68   2012.4

    　More details

    Language：Japanese  

    DOI： 10.11309/jssst.29.2_65

  • 『計算機科学者のためのゲーム理論入門』シリーズ第1回 非協力ゲーム(基礎編) Reviewed

    横尾 真, 岩﨑 敦, 櫻井 祐子, 岡本　吉央

    コンピュータ　ソフトウェア   29 ( 2 )   69 - 84   2012.4

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 擬似木に基づく分散制約最適化問題の精度保証付き非厳密解法の提案 Reviewed

    沖本 天太, ジョヨンジュン, 岩崎 敦, 横尾 真

    情報処理学会論文誌   52 ( 12 )   2011.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 擬似木に基づく分散制約最適化問題の精度保証付き非厳密解法の提案 Reviewed

    沖本 天太, ジョ ヨンジュン, 岩崎 敦, 横尾 真

    情報処理学会論文誌   52(12)   3786 - 3795   2011.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Real-time solving of quantified CSPs based on Monte-Carlo game tree search Reviewed International journal

    Baba Satomi, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

    22nd International Joint Conference on Artificial Intelligence, IJCAI 2011   655 - 661   2011.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.5591/978-1-57735-516-8/IJCAI11-116

  • Generalizing envy-freeness toward group of agents Reviewed International journal

    Taiki Todo, Runcong Li, Xuemei Hu, Takayuki Mouri, Atsushi Iwasaki, Makoto Yokoo

    22nd International Joint Conference on Artificial Intelligence, IJCAI 2011   386 - 392   2011.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.5591/978-1-57735-516-8/IJCAI11-073

  • Concise characteristic function representations in coalitional games based on agent types Reviewed International journal

    Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makoto Yokoo

    22nd International Joint Conference on Artificial Intelligence, IJCAI 2011   393 - 399   2011.12

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.5591/978-1-57735-516-8/IJCAI11-074

  • 分散制約充足問題:特定の制約網に特化した変数順序付けヒューリスティックの提案 Reviewed

    沖本 天太 , 岩崎 敦 , 横尾 真

    情報処理学会論文誌   52 ( 11 )   2011.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 分散制約充足問題：特定の制約網に特化した変数順序付けヒューリスティックの提案 Reviewed

    沖本 天太, 岩崎 敦, 横尾 真

    情報処理学会論文誌   52(11)   3018 - 3029   2011.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • A compact representation scheme of coalitional games based on multi-terminal zero-suppressed binary decision diagrams Reviewed International journal

    Yuko Sakurai, Suguru Ueda, Atsushi Iwasaki, Shin Ichi Minato, Makoto Yokoo

    14th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2011)   4 - 18   2011.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-25044-6_4

  • MC-netsを用いた提携構造形成アルゴリズムの拡張：負の利得と外部性の導入 Reviewed

    一村　良，長谷川　隆人，上田　俊，岩崎　敦　横尾　真

    電子情報通信学会論文誌   J94-D ( 11 )   2011.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 協力ゲームにおける特性関数のエージェントのタイプに基づく簡略表記法 Reviewed

    上田　俊，北木　真，岩崎　敦,　横尾　真

    電子情報通信学会論文誌   J94-D ( 11 )   2011.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • モンテカルロゲーム木探索に基づく限量記号付き制約充足問題の実時間解決 Reviewed

    馬場　里美，岩崎　敦，横尾　真

    電子情報通信学会論文誌   J94-D ( 11 )   2011.11

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Pseudo-tree-based incomplete algorithm for distributed constraint optimization with quality bounds Reviewed International journal

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings

    17th International Conference on Principles and Practice of Constraint Programming, CP 2011   660 - 674   2011.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-23786-7_50

  • Reducing the Search Space of Resource Constrained DCOPs Reviewed

    17th International Conference on Principles and Practice of Constraint Programming (CP-2011)   576 - 590   2011.9

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Reducing the Search Space of Resource Constrained DCOPs

    DOI： 10.1007/978-3-642-23786-7_44

  • Pseudo-tree-based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds Reviewed

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo, Boi Faltings

    In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP-2011)   660 - 674   2011.9

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Pseudo-tree-based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds

    DOI： 10.1007/978-3-642-23786-7_50

  • The design of cryptographic S-boxes using CSPs Reviewed International journal

    Venkatesh Ramamoorthy, Marius C. Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo

    17th International Conference on Principles and Practice of Constraint Programming, CP 2011   54 - 68   2011.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-23786-7_7

  • Reducing the search space of resource constrained DCOPs Reviewed International journal

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Boi Faltings, Hiroshi Matsuo

    17th International Conference on Principles and Practice of Constraint Programming, CP 2011   576 - 590   2011.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-642-23786-7_44

  • Distributed on-line multi-agent optimization under uncertainty Balancing exploration and exploitation Reviewed

    Matthew E. Taylor, Manish Jain, Prateek Tandon, Makoto Yokoo, Milind Tambe

    Advances in Complex Systems   14 ( 3 )   471 - 528   2011.6

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1142/S0219525911003104

  • Distributed on-line multi-agent optimization under uncertainty: Balancing exploration and exploitation Reviewed

    Matthew E. Taylor, Manish Jain, Prateek Tandon, Makoto Yokoo, Milind Tambe

    Advances in Complex Systems   14 ( 3 )   471 - 528   2011.6

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1142/S0219525911003104

  • Coalition structure generation utilizing compact characteristic function representations Reviewed

    Ohta Naoki, Conitzer Vincent, Ichimura Ryo, Sakurai Yuko, Iwasaki Atsushi, Yokoo Makoto

    Transactions of the Japanese Society for Artificial Intelligence   26 ( 3 )   451 - 460   2011.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1527/tjsai.26.451

  • Pseudo-tree-based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds Reviewed

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

    The 4th International Workshop on Optimisation in Multi-agent Systems (OPTMAS 2011) (held in conjunction with AAMAS 2011)   52 - 67   2011.5

    　More details

    Language：English  

  • 架空名義操作不可能な施設配置メカニズムの特徴付け（情報処理学会論文賞） Reviewed

    東藤 大樹 , 岩崎 敦 , 横尾 真

    情報処理学会論文誌   52 ( 4 )   2011.4

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

    施設配置問題は，施設の配置場所を適切に決定する問題であり，経済学を始めとして様々な分野で広く研究が行われてきた．特に戦略的操作不可能（各参加者にとって正直が最良の策）な配置メカニズムの設計が重要な課題として認知されている．一方，インターネットを介してこのような施設配置を実現する場合には，一人の参加者が複数の参加者であるかのように振る舞う架空名義操作と呼ばれる不正行為が可能となる．本研究では，施設配置メカニズムの架空名義操作不可能性（参加者が架空名義を行っても得をしない性質）を定式化し，この性質を満たす配置メカニズムの特徴付けを与える．

  • Distributed on-Line Multi-Agent Optimization under Uncertainty: Balancing Exploration and Exploitation Reviewed International journal

    Matthew E. Taylor, Manish Jain, Prateek Tandon, Makoto Yokoo, Milind Tambe

    Advances in Complex Systems   14 ( 3 )   2011.3

    　More details

    Language：English  

  • 分散ラグランジュ緩和プロトコルにおける適応的な価格更新 Reviewed

    平山 勝敏, 松井 俊浩, 横尾 真

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 予算制約を持つ入札者を対象とした再配分メカニズムの提案 Reviewed

    櫻井 祐子, 横尾 真

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 第一価格入札における架空名義入札の影響の解析 Reviewed

    桂木 敦史, 櫻井 祐子, 岩崎 敦, 横尾 真

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 分散制約最適化問題に基づく提携構造形成問題 Reviewed

    上田 俊, 岩崎 敦, 横尾 真, Marius C. Silaghi, 平山 勝敏, 松井 俊浩

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 敵対者に対応する協調問題解決：限量記号付き分散制約充足問題 Reviewed

    馬場 里美, 岩崎 敦, 横尾 真, Marius C. Silaghi, 平山 勝敏, 松井 俊浩,

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 収入単調性を満たすオークションメカニズムの特性及びその架空名義操作不可能性との関係 Reviewed

    東藤 大樹, 岩崎 敦, 横尾 真

    人工知能学会論文誌   26 ( 1 )   2011.1

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Effect of DisCSP Variable-Ordering Heuristics in Scale-free Networks Reviewed

    Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo

    In proceedings of the 13th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2010)   168 - 180   2010.11

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Effect of DisCSP Variable-Ordering Heuristics in Scale-free Networks

    DOI： 10.1007/978-3-642-25920-3_12

  • 誘導幅に基づく分散制約最適化問題の精度保 証付き近似解法の提案 Reviewed

    沖本天太, 岩崎敦, 横尾真

    合同エージェントワークショップ＆シンンポジウム (JAWS 2010)   2010.10

    　More details

    Language：Japanese  

  • スケールフリーネットワーク上での非同期バックトラッキングの評価

    沖本 天太, 岩崎 敦, 横尾 真

    第24回人工知能学会全国大会 (JSAI 2010)   2010.6

    　More details

    Language：Japanese  

  • 分散制約最適化問題へのソフトアーク整合の適用 Reviewed

    松井 俊浩, Marius C. Silaghi, 平山 勝敏, 横尾 真, 松尾 啓志

    人工知能学会論文誌   25 ( 3 )   2010.5

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • A Quantified Distributed Constraint Optimization Problems Reviewed

    Toshihiro MATSUI, Marius C. Silaghi, Katsutoshi HIRAYAMA, Makoto YOKOO, Hiroshi MATSUO, Satomi BABA

    Proc. 9th Int'l. Conf. on Autonomous Agents and Multiagent Systems (AAMAS2010)   1023 - 1030   2010.5

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    A Quantified Distributed Constraint Optimization Problems

  • Keyword Auction Protocol for Dynamically Adjusting the Number of Advertisements Reviewed International journal

    Yuko Sakurai, Atsushi Iwasaki, and Makoto Yokoo

    Web Intelligence and Agent Systems (WIAS),   8 ( 3 )   2010.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Balancing local resources and global goals in multiply-constrained DCOP Reviewed International journal

    Emma Bowring, Milind Tambe, Makoto Yokoo

    Journal of Multiagent and Grid Systems (MAGS)   6 ( 4 )   2010.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Introducing Communication in Dis-POMDPs with Locality of Interaction Reviewed International journal

    Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Yokoo, Janusz Marecki, Pradeep Varakantham, Milind Tambe

    Web Intelligence and Agent Systems (WIAS)   8 ( 3 )   2010.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • 分散制約最適化問題へのソフトアーク整合の適用 Reviewed

    松井 俊浩, Marius C. Silaghi, 平山 勝敏, 横尾 真, 松尾 啓志

    人工知能学会誌   25 ( 3 )   410 - 422   2010.3

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • ``開環境での協力ゲームにおける解の簡略記述法''

    大田 直樹 , 岩崎 敦 , 横尾 真, Vincent Conitzer, Tuomas Sandholm

    情報処理学会論文誌   2009.12

  • ``匿名操作不可能シャプレイ値：開環境での協力ゲームへのシャプレイ値の拡張''

    大田 直樹，佐藤 恭史，岩崎 敦，横尾 真，Vincent Conitzer,

    コンピュータソフトウェア   2009.11

  • ``Take-it-or-Leave-it方式の再配分オークションメカニズムの提案''

    櫻井祐子、斎藤恭昌、岩崎　敦、横尾　真

    電子情報通信学会論文誌   2009.11

  • ``セキュアキーワード広告オークションプロトコルの提案''

    櫻井 祐子，横尾 真，岩崎 敦，鈴木 幸太郎,

    電子情報通信学会論文誌   2009.11

  • ``架空名義操作不可能な組合せオークションの割当規則の特性''

    東藤 大樹，岩崎 敦，横尾　真，櫻井 祐子

    電子情報通信学会論文誌   2009.11

  • ADOPT-ing: Unifying asynchronous distributed optimization with asynchronous backtracking Reviewed

    Marius C. Silaghi, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   19 ( 2 )   89 - 123   2009.10

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s10458-008-9069-2

  • ``資源制約に束縛されないpseudo-treeを用いた資源制約付き分散制約最適化問題の解法''

    松井 俊浩, Marius C. Silaghi, 平山 勝敏, 横尾 真, 松尾 啓志

    人工知能学会論文誌   2009.7

  • 資源制約に束縛されないpseudo-treeを用いた資源制約付き分散制約最適化問題の解法 Reviewed

    松井 俊浩, Marius Silaghi, 平山 勝敏, 横尾 真, 松尾 啓志

    人工知能学会論文誌   24 ( 6 )   417 - 427   2009.7

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Coordination Planning:Applying Control Synthesis Methods for a Class of Distributed Agents Reviewed International journal

    Kiam Tian Seow, Chuan Ma, and Makoto Yokoo

    IEEE Transactions on Control Systems Technology   2009.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Directed Soft Arc Consistency in Pseudo-trees Reviewed

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    Proc. 8th Intl. Conf. on Autonomous Agents and Multiagent Systems (AAMAS2009)   1 ( 1 )   120 - 125   2009.3

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Directed Soft Arc Consistency in Pseudo-trees

  • チーム選択問題のための架空名義操作不可能なオークションメカニズムの提案 Reviewed

    斎藤 恭昌, 岩崎 敦, 横尾 真, David Kempe, Mahyar Salek,

    コンピュータソフトウェア (ソフトウェア科学会論文誌)   2008.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • 適切な掲載数を決定するキーワード広告オークションプロトコルの提案 Reviewed

    櫻井 祐子，岩崎 敦，横尾 真

    コンピュータソフトウェア (ソフトウェア科学会論文誌)   2008.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • マルチエージェント部分観測可能マルコフ決定過程のプラン構築への通信の導入 Reviewed

    田崎 誠, 籔 悠一, 横尾 真, Pradeep Varakantham, Janusz Marecki, Milind Tambe

    コンピュータソフトウェア (ソフトウェア科学会論文誌)   2008.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking Reviewed International journal

    Marius C. Silaghi, Makoto Yokoo

    Journal of Autonomous Agents and Multi-Agent Systems   2008.11

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Resource constrained distributed constraint optimization with virtual variables Reviewed

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-08)   1 ( 1 )   120 - 125   2008.7

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Resource constrained distributed constraint optimization with virtual variables

  • Resource constrained distributed constraint optimization using resource constraint free pseudo-tree Reviewed

    Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Hiroshi Matsuo

    The Seventh International Conference on Autonomous Agents and Multi-agent Systems (AAMAS2008)   1 ( 1 )   1405 - 1408   2008.5

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    Resource constrained distributed constraint optimization using resource constraint free pseudo-tree

  • ``摂動完全均衡に基づくマルチエージェント部分観測可能マルコフ決定過程 のプラン構築'', Reviewed

    籔 悠一, 横尾真, 岩崎敦,

    電子情報通信学会論文誌   2007.12

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Implementing a strategyproof greedy-allocation combinatorial auction and extending to ascending auction Reviewed International journal

    Takayuki Ito, Makoto Yokoo, Shigeo Matsubara, and Atsushi Iwasaki

    Systems and Computers in Japan   2007.8

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Determining bidding strategies in sequential auctions: Quasi-linear utility and budget constraints Reviewed International journal

    Hiromitsu Hattori, Makoto Yokoo, Yuko Sakurai, and Toramatsu Shintani

    Systems and Computers in Japan   2007.7

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • Determining bidding strategies in sequential auctions: Quasi-linear utility and budget constraints Reviewed

    Hiromitsu Hattori, Makoto Yokoo, Yuko Sakurai, Toramatsu Shintani

    Systems and Computers in Japan   38 ( 8 )   72 - 83   2007.7

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1002/scj.10465

  • False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values Reviewed International journal

    Kenji Terada and Makoto Yokoo

    Systems and Computers in Japan   2006.11

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • False-name-proof multi-unit auction protocol utilizing greedy allocation based on approximate evaluation values Reviewed

    Kenji Terada, Makoto Yokoo

    Systems and Computers in Japan   37 ( 13 )   89 - 98   2006.11

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1002/scj.10664

  • ``架空名義入札に頑健な組合せオークションプロトコルの提案と評価：バンドルサイズ優先プロトコル'', Reviewed

    松谷 俊宏，横尾 真, 岩崎 敦

    情報処理学会論文誌   2006.5

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • ``Greedyな割当て手法に基づくStrategy-proofな組合せオークションプロトコルと公開競上げ式プロトコルへの拡張'' Reviewed

    伊藤孝行, 横尾真, 松原繁夫, 岩崎敦,

    電子情報通信学会論文誌   2006.5

    　More details

    Publishing type：Research paper (scientific journal)  

  • ``匿名の開環境下における協力ゲームについて'', Reviewed

    横尾 真, Vincent Conitzer, Tuomas Sandholm, 大田 直樹，岩崎 敦

    情報処理学会論文誌   2006.5

    　More details

    Language：Japanese   Publishing type：Research paper (scientific journal)  

  • Implementing A Strategyproof Greedy-Allocation Combinatorial Auction and Extending to Ascending Auction Reviewed

    Takayuki It, Makoto Yokoo, Shigeo Matsubara, Atsushi Iwasaki

    Systems and Computers in Japan(John Wiley & Sons, Inc.)   38 ( 9 )   44 - 51   2006.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Implementing A Strategyproof Greedy-Allocation Combinatorial Auction and Extending to Ascending Auction

    DOI： 10.1002/scj.20748

  • A combinatorial auction among experts and amateurs: The case of single-skilled experts Reviewed

    Takayuki Ito, Makoto Yokoo, Shigeo Matsubara

    Systems and Computers in Japan   36 ( 12 )   11 - 21   2005.11

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1002/scj.20390

  • Strategy/False-name Proof Protocols for Combinatorial Multi-Attribute Procurement Auction

    Takayuki Suyama, Makoto Yokoo

    Autonomous Agents and Multi-Agent Systems   11 ( 1 )   7 - 21   2005.7

    　More details

    Language：English  

    DOI： 10.1007/s10458-005-0983-2

  • A double auction protocol robust to false-name bids Reviewed

    Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)   88 ( 5 )   50 - 59   2005.5

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1002/ecjb.20180

  • Robust double auction protocol against false-name bids Reviewed

    Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    Decision Support Systems   39 ( 2 )   241 - 252   2005.4

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.dss.2003.10.009

  • A Roubust Open Ascending-price Multi-unit Auction Protocol against False-name Bids Reviewed International journal

    Atsushi Iwasaki, Makoto Yokoo, Kenji Terada

    Decision Support Systems   2005.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

  • A robust open ascending-price multi-unit auction protocol against false-name bids Reviewed

    Atsushi Iwasaki, Makoto Yokoo, Kenji Terada

    Decision Support Systems   39 ( 1 )   23 - 39   2005.3

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    DOI： 10.1016/j.dss.2004.08.005

  • Generalized Vickrey Auction and Suppression of Active Adversary Using Incentive-Compatible Implementation

    Makoto Yokoo, Koutarou Suzuki

    Transactions of the Institute of Electronics, Information and Communication Engineers(IEICE)   E88A ( 1 )   255 - 261   2005.1

    　More details

    Language：English  

    DOI： 10.1093/ietfec/E88-A.1.255

  • The distributed breakout algorithms Reviewed

    Katsutoshi Hirayama, Makoto Yokoo

    Artificial Intelligence   161 ( 1-2 )   89 - 115   2005.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2004.08.004

  • Adopt: Asynchronous distributed constraint optimization with quality guarantees Reviewed

    Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo

    Artificial Intelligence   161 ( 1-2 )   149 - 180   2005.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.artint.2004.09.003

  • The Distributed Breakout Algorithms

    Katsutoshi Hirayama, Makoto Yokoo

    Artificial Intelligence Journal}   161 ( 1-2 )   89 - 115   2005.1

    　More details

    Language：English  

    DOI： 10.1016/j.artint.2004.08.004

  • Secure Distributed Constraint Satisfaction: Reaching Agreement without Revealing Private Information

    Makoto Yokoo, Koutarou Suzuki, Katsutoshi Hirayama

    Artificial Intelligence Journal   161 ( 1-2 )   229 - 245   2005.1

    　More details

    Language：English  

    DOI： 10.1016/j.artint.2004.10.007

  • Asynchronous Distributed Constraint Optimization with Quality Guarantees

    Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo

    Artificial Intelligence Journal   2005.1

    　More details

    Language：English  

  • An Easy-Hard-Easy Cost Profile in Distributed Constraint Satisfaction

    Katsutoshi Hirayama, Makoto Yokoo, Katia Sycara

    IPSJ Journal   2004.9

    　More details

    Language：English  

  • The Effect of False-name Bids in Combinatorial Auctions: New Fraud in Internet Auctions

    Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    Games and Economic Behavior   2004.1

    　More details

    Language：English  

  • On market-inspired approaches to propositional satisfiability Reviewed

    William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama, Michael P. Wellman

    Artificial Intelligence   144 ( 1-2 )   125 - 156   2003.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/S0004-3702(02)00386-7

  • Solving satisfiability problems by using reconfigurable hardware Reviewed

    Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, Akira Nagoya

    Electronics and Communications in Japan, Part II: Electronics (English translation of Denshi Tsushin Gakkai Ronbunshi)   86 ( 3 )   35 - 46   2003.3

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1002/ecjb.10134

  • 架空名義入札に頑健な組合せオークションプロトコルにおけるバンドルの設計方法

    横尾　真、櫻井　裕子、松原　繁夫

    コンピュータソフトウェア（ソフトウェア科学会論文誌）   2003.1

    　More details

    Language：Japanese  

  • 自然の選択の情報に非対称性が存在する場合のオークションプロトコルの設計

    伊藤孝行、横尾真、松原繁夫

    コンピュータソフトウェア（ソフトウェア科学会論文誌）   2003.1

    　More details

    Language：Japanese  

  • 平均的に予算非負なダブルオークションプロトコル

    櫻井　裕子、横尾　真

    人工知能学会論文誌   2003.1

    　More details

    Language：Japanese  

  • On Market-Inspired Approaches to Propositional Satisfiability

    William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama, Michael P. Wellman

    Artificial Intelligence Journal   2003.1

    　More details

    Language：English  

  • Believing others: Pros and cons Reviewed

    Shigeo Matsubara, Makoto Yokoo

    Artificial Intelligence   142 ( 2 )   179 - 203   2002.12

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    DOI： 10.1016/S0004-3702(02)00289-8

  • Defection-free exchange mechanisms based on an entry fee imposition Reviewed

    Shigeo Matsubara, Makoto Yokoo, Hideyuki Nakashima, Milind Tambe

    Artificial Intelligence   142 ( 2 )   265 - 286   2002.12

    　More details

    Language：English   Publishing type：Research paper (other academic)  

    DOI： 10.1016/S0004-3702(02)00276-X

  • Defection-Free Exchange Mechanisms based on an Entry Fee Imposition

    Shigeo Matsubara, Makoto Yokoo

    Artificial Intelligence Journal   2002.1

    　More details

    Language：English  

  • 架空名義入札に頑健な複数ユニットオークションプロトコル

    横尾　真、櫻井　裕子、松原　繁夫

    人工知能学会論文誌   2002.1

    　More details

    Language：Japanese  

  • 架空名義入札に頑健な組合せオークションプロトコル

    横尾　真、櫻井　裕子、松原　繁夫

    情報処理学会論文誌   2002.1

    　More details

    Language：Japanese  

  • 逐次型オークションの入札戦略決定手法：　準線形効用と予算節約の導入

    服部　宏充、横尾　真、櫻井　裕子、新谷　虎松

    電子情報通信学会論文誌   2002.1

    　More details

    Language：Japanese  

  • Robust combinatorial auction protocol against false-name bids Reviewed

    Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    Artificial Intelligence   130 ( 2 )   167 - 181   2001.8

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/S0004-3702(01)00077-7

  • Solving satisfiability problems using reconfigurable computing Reviewed

    Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, Akira Nagoya

    IEEE Transactions on Very Large Scale Integration (VLSI) Systems   9 ( 1 )   109 - 116   2001.2

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1109/92.920826

  • Robust Combinatorial Auction Protocol against False-name Bids

    Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    Artificial Intelligence Journal   2001.1

    　More details

    Language：English  

  • Solving Satisfiability Problems using Reconfigurable Computing

    Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, Akira Nagoya

    IEEE Transactions on VLSI   2001.1

    　More details

    Language：English  

  • 再構成可能なハードウェアを用いた充足可能性問題の解法

    須山　敬之、横尾　真、澤田　宏、名古屋　彰

    電子情報通信学会論文誌   2001.1

    　More details

    Language：Japanese  

  • 組合わせオークションの高速な準最適勝者決定アルゴリズム

    櫻井　裕子、横尾　真、亀井　剛次

    人工知能学会論文誌   2001.1

    　More details

    Language：Japanese  

  • 架空名義入札に頑健なダブルオークションプロトコル

    横尾　真、櫻井　裕子、松原　繁夫

    電子情報通信学会論文誌   2001.1

    　More details

    Language：Japanese  

  • 架空名義表明のメカニズムデザインに対する影響 : インターネットでの集団意思決定に向けて(特集●社会・経済におけるマルチエージェント)

    横尾 真, 櫻井 祐子, 松原 繁夫, Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara

    コンピュータソフトウェア = Computer software   17 ( 5 )   445 - 454   2000.9

    　More details

    Language：Japanese   Publishing type：Research paper (other academic)  

    DOI： 10.11309/jssst.17.445

  • 電子商取引における一般化Vickreyオークションの問題点 : 架空名義入札に対する頑健性

    櫻井 祐子, 横尾 真, 松原 繁夫, Yuko Sakurai, Makoto Yokoo, Shigeo Matsubara

    コンピュータソフトウェア = Computer software   17 ( 2 )   109 - 117   2000.3

    　More details

    Language：Japanese  

    DOI： 10.11309/jssst.17.109

  • 架空名義表明のメカニズムデザインに対する影響：　インターネットでの集団意思決定に向けて

    横尾　真、櫻井　裕子、松原　繁夫

    コンピュータソフトウェア（ソフトウェア科学会論文誌）   2000.1

    　More details

    Language：Japanese  

  • 電子商取引における一般化　Vickrey オークションの問題点：　架空名義入札に対する頑健性

    櫻井　裕子、横尾　真、松原　繁夫

    コンピュータソフトウェア（ソフトウェア科学会論文誌）   2000.1

    　More details

    Language：Japanese  

  • 分散制約充足における nogood 学習の効果

    平山　勝敏、横尾　真

    人工知能学会論文誌   2000.1

    　More details

    Language：Japanese  

  • 複雑な局所問題に対応する分散制約充足アルゴリズム

    横尾　真、平山　勝敏

    人工知能学会論文誌   2000.1

    　More details

    Language：Japanese  

  • Algorithms for Distributed Constraint Satisfaction: A Review

    Makoto Yokoo, Katsutoshi Hirayama

    Autonomous Agents and Multi-Agent Systems   2000.1

    　More details

    Language：English  

  • 制約充足テクニックを用いた移動体通信の周波数割当問題の解法

    横尾　真、平山　勝敏

    情報処理学会論文誌   2000.1

    　More details

    Language：Japanese  

  • 不正行為を防ぐ電子商取引メカニズム

    松原　繁夫、横尾　真

    人工知能学会論文誌   2000.1

    　More details

    Language：Japanese  

  • Socialware: Multiagent Systems for Supporting Network Communities

    Fumio Hattori, Takeshi Ohguro, Makoto Yokoo, Shigeo Matsubara, Sen Yoshida

    Communications of the ACM   1999.3

    　More details

    Language：English  

  • 多状態コミットメント探索とその評価

    北村　泰彦、横尾　真、宮地　智久、辰巳　昭治

    人工知能学会論文誌   1999.1

    　More details

    Language：Japanese  

  • 制約充足問題の地形の解析

    横尾　真

    コンピュータソフトウェア（ソフトウェア科学会論文誌）   1999.1

    　More details

    Language：Japanese  

  • 分散不完全制約充足問題

    平山　勝敏, 横尾　真

    人工知能学会論文誌   1999.1

    　More details

    Language：Japanese  

  • The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

    Makoto Yokoo, Edmund H. Durfee, Toru Ishida, Kazuhiro Kuwabara

    IEEE Transactions on Knowledge and Data Engineering   1998.1

    　More details

    Language：English  

  • 反復改善型分散制約充足アルゴリズム

    横尾　真、平山　勝敏

    情報処理学会論文誌   1998.1

    　More details

    Language：Japanese  

▼display all

Books

  • Combinatorial Auctions

    （ Role： Joint author）

    2006.4 

    　More details

    Language：English   Book type：Scholarly book

  • AI辞典第3版

    横尾 真（中島秀之，浅田稔，橋田浩一，松原仁，山川宏，栗原聡，松尾豊編）（ Role： Joint author）

    近代科学社  2019.11 

    　More details

    Responsible for pages：第1章「自律エージェントとマルチエージェント」, 8-9．第１１章「検索連動型広告」, 295-296．   Language：Japanese   Book type：Scholarly book

  • Encyclopedia of Algorithms 2016

    Springer 2016  2016.4 

    　More details

    Responsible for pages：総ページ数：2389, 担当ページ数：728-731,821-824   Language：English  

    Encyclopedia of Algorithms 2016

  • Encyclopedia of Algorithms

    Makoto Yokoo/Editor: Ming-Yang Kao（ Role： Joint author）

    Springer  2016.4 

    　More details

    Responsible for pages：Chapter title：False-Name-Proof Auction,728-731(2389)   Language：English   Book type：Scholarly book

  • Encyclopedia of Algorithms

    Makoto Yokoo/Editor: Ming-Yang Kao（ Role： Joint author）

    Springer  2016.4 

    　More details

    Responsible for pages：Chapter title:Generalized Vickrey Auction,821-824(2389)   Language：English   Book type：Scholarly book

  • Principles of Practice in Multi-Agent Systems: 12th International Conference, PRIMA 2009, Nagoya, Japan, December 14-16, 2009, Proceedings (Lecture Notes in Computer Science)

    （ Role： Edit）

    Springer  2009.12 

    　More details

    Responsible for pages：総ページ数：676   Language：English  

    Principles of Practice in Multi-Agent Systems: 12th International Conference, PRIMA 2009, Nagoya, Japan, December 14-16, 2009, Proceedings (Lecture Notes in Computer Science)

  • New Frontiers in Artificial Intelligence, Joint JSAI 2005 Workshop Post-Proceedings (Lecture Notes in Computer Science)

    （ Role： Edit）

    Springer Berlin Heidelberg  2006.7 

    　More details

    Responsible for pages：総ページ数：486, 担当ページ数：53-64   Language：English  

    New Frontiers in Artificial Intelligence, Joint JSAI 2005 Workshop Post-Proceedings (Lecture Notes in Computer Science)

  • オークション理論の基礎―ゲーム理論と情報科学の先端領域

    横尾 真（ Role： Sole author）

    東京電機大学出版局  2006.6 

    　More details

    Responsible for pages：総ページ数：147   Language：Others  

  • オークション理論の基礎：ゲーム理論と情報科学の先端領域

    横尾　真（ Role： Sole author）

    東京電機大学出版局  2006.6 

    　More details

    Language：Japanese   Book type：Scholarly book

  • eビジネスの理論と応用 (インターネットの知的情報技術)

    菅坂 玉美, 寺野 隆雄, 横尾 真, 山口 高平, 北村 泰彦, 山田 誠二（ Role： Joint author）

    東京電機大学出版局  2003.1 

    　More details

    Responsible for pages：総ページ数：138   Language：Others  

  • Game theory and decision theory in agent-based systems

    chapter: Makoto Yokoo, Yuko Sakurai, and Shigeo Matsubara / Editors:Parsons S., Gmytrasiewicz, P. and Wooldridge, M. J.（ Role： Joint author）

    Kluwer  2002.1 

    　More details

    Responsible for pages：Chapter "Robust Combinatorial Auction Protocol against False-name Bids"   Language：English   Book type：Scholarly book

  • Intelligent Agents: Specification, Modeling, and Applications, 4th Pacific Rim International Workshop on Multi-Agents, PRIMA 2001, Taipei, Taiwan, July 28-29, 2001, Proceedings (Lecture Notes in Computer Science)

    （ Role： Edit）

    Springer  2001.7 

    　More details

    Responsible for pages：総ページ数：236   Language：English  

    Intelligent Agents: Specification, Modeling, and Applications, 4th Pacific Rim International Workshop on Multi-Agents, PRIMA 2001, Taipei, Taiwan, July 28-29, 2001, Proceedings (Lecture Notes in Computer Science)

  • Distributed Constraint Satisfaction:Foundation of Cooperation in Multi-agent Systems

    Makoto Yokoo（ Role： Sole author）

    Springer  2000.12 

    　More details

    Language：English   Book type：Scholarly book

  • Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence

    Chapter: Makoto Yokoo/Editor: Gerhard Weiss（ Role： Joint author）

    MIT Press  1999.1 

    　More details

    Responsible for pages：Chapter Title "Search Algorithms for Agents"   Language：English   Book type：Scholarly book

▼display all

Presentations

  • R-MaxSAT : 敵対者が存在するMaxSAT

    山下 魁人，菅原 知也，越村 三幸，横尾 真

    2022年度人工知能学会全国大会（第36回）  2022.6 

    　More details

    Event date： 2022.6

    Language：Japanese  

    Venue：京都国際会館（京都府京都市），  

  • マルチエージェント経路探索のための厳密アルゴリズムの改良

    柴田 航志，木村 慧，東藤 大樹，横尾 真

    2022年度人工知能学会全国大会（第36回）  2022.6 

    　More details

    Event date： 2022.6

    Language：Japanese  

    Venue：京都国際会館（京都府京都市），  

  • ソーシャルネットワーク上での両方向マッチング

    チョ ソンホ，東藤 大樹，横尾 真

    2022年度人工知能学会全国大会（第36回）  2022.6 

    　More details

    Event date： 2022.6

    Language：Japanese  

    Venue：京都国際会館（京都府京都市），  

  • Strategy-Proof House Allocation with Existing Tenants over Social Networks

    2022.3 

    　More details

    Event date： 2022.3

  • ソーシャルネットワーク上での両方向マッチング

    チョ ソンホ，東藤 大樹，横尾 真

    2022.2 

    　More details

    Event date： 2022.2

    Language：Japanese  

    Venue：金沢勤労者プラザ(石川県金沢市), ハイブリッド開催  

  • マルチエージェント経路探索アルゴリズムの改良のための一検討

    柴田 航志，木村 慧，東 藤大樹，横尾 真

    2022.2 

    　More details

    Event date： 2022.2

    Language：Japanese  

    Venue：金沢勤労者プラザ(石川県金沢市), ハイブリッド開催  

  • 敵対者が存在する重み付き MaxSAT の定式化と厳密アルゴリズムの提案

    山下 魁人，菅原 知也，越村 三幸，横尾 真

    2022.2 

    　More details

    Event date： 2022.2

    Language：Japanese  

    Venue：金沢勤労者プラザ(石川県金沢市), ハイブリッド開催  

  • ADSAT : 敵対者が存在するMaxSAT

    菅原 知也，越村 三幸，横尾 真

    2021.9 

    　More details

    Event date： 2021.9

    Language：Japanese  

    Venue：オンライン  

  • グリッド上の公害財配置問題におけるメカニズムデザイン

    小副川 貢司，東藤 大樹，横尾 真

    2021.9 

    　More details

    Event date： 2021.9

    Language：Japanese  

    Venue：オンライン  

  • 木構造ソーシャルネットワークモデルにおける 戦略的操作不可能な部屋配分のメカニズムの設計

    尤 博, 東藤 大樹,横尾 真

    2021.9 

    　More details

    Event date： 2021.9

    Language：Japanese  

    Venue：オンライン  

  • ネットワーク上のテナント付き住宅割当問題のための耐戦略的アルゴリズム

    尤 博, 東藤 大樹, 横尾 真

    第20回情報科学技術フォーラム（FIT2021）  2021.8 

    　More details

    Event date： 2021.8

    Language：Japanese  

    Venue：オンライン  

  • Coalition Structure Generation Using Concise Characteristic Function Prepresentation Invited International conference

    Makoto Yokoo

    Dagstuhl Seminer 21331: Coalition Formation Games  2021.8 

    　More details

    Event date： 2021.8

    Language：English  

    Country：Germany  

  • Housing Markets over Social Networks Invited International conference

    Makoto Yokoo

    Dagstuhl Seminer 21331: Coalition Formation Games  2021.8 

    　More details

    Event date： 2021.8

    Language：English  

    Country：Germany  

  • Matching under constraints Invited International conference

    Makoto Yokoo

    Dagstuhl Seminer 21301: Matching Under Preferences/Theory and Practice  2021.7 

    　More details

    Event date： 2021.7

    Language：English  

    Country：Germany  

  • Mechanism Design for Constrained Matching Invited

    Makoto Yokoo

    Summer School on Game Theory and Social Choice  2021.6 

    　More details

    Event date： 2021.6

  • グリッド上の公害財配置のためのメカニズムデザイン

    小副川 貢司, 東藤 大樹, 横尾 真

    2021年度人工知能学会全国大会 (第35回)  2021.6 

    　More details

    Event date： 2021.6

    Language：Japanese  

    Venue：オンライン  

  • 敵対者が存在するMaxSAT

    菅原 知也, 越村 三幸, 横尾 真

    2021年度人工知能学会全国大会 (第35回)  2021.6 

    　More details

    Event date： 2021.6

    Language：Japanese  

    Venue：オンライン  

  • Mechanism Design for Housing Markets over Social Networks

    2021.3 

    　More details

    Event date： 2021.3

    Language：Japanese  

    Country：Japan  

  • Lazy Gale-Shapley for Many-to-One Matching with Partial Information

    2021.3 

    　More details

    Event date： 2021.3

    Language：Japanese  

    Country：Japan  

  • 部分的選好下における学校選択メカニズム

    和田 凌司, 八尋 健太郎, 東藤 大樹, 横尾 真

    2020.9 

    　More details

    Event date： 2020.9

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • マッチング計算Webアプリケーションの開発

    中原 啓, 八尋 健太郎, 和田 凌司, 東藤 大樹, 横尾 真

    2020.9 

    　More details

    Event date： 2020.9

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • ネットワークオークションにおける戦略的操作不可能性と非浪費性を満たすメカニズムの設計

    川﨑 岳洋, 高梨 誠之, 東藤 大樹, 横尾 真

    2020.9 

    　More details

    Event date： 2020.9

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • マッチング計算Webアプリケーションの開発

    中原 啓, 八尋 健太郎, 和田 凌司, 東藤 大樹, 横尾 真

    2020年度人工知能学会全国大会（第34回)  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • 制約付きマッチングの理論 Invited

    横尾 真

    2020年度人工知能学会全国大会（第34回)  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：オンライン   Country：Japan  

  • ネットワークオークションにおける戦略的操作不可能性かつ非浪費性を満たすメカニズムの設計

    川﨑 岳洋, 高梨 誠之, 東藤 大樹, 横尾 真

    2020年度人工知能学会全国大会（第34回)  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • 推移関係を表すSAT節の削減

    越村 三幸, 廖 暁鵑, 渡部 恵海, 櫻井 祐子, 横尾 真

    2020年度人工知能学会全国大会（第34回)  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • 部分的選好下における学校選択問題のスケジューリング

    和田 凌司, 八尋 健太郎, 東藤 大樹, 横尾 真

    2020年度人工知能学会全国大会（第34回)  2020.6 

    　More details

    Event date： 2020.6

    Language：Japanese  

    Venue：オンライン   Country：Japan  

  • Two-sided Matching with Type-specific Maximal and Minimal Quotas in a Student-Supervisor Assignment Invited

    2020.5 

    　More details

    Event date： 2020.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Country：Japan  

  • Multiple Levels of Importance in Matching with Distributional Constraints International conference

    Haris Aziz, Serge Gaspers, Zhaohong Sun, Makoto Yokoo

    The 19th International Conference on Aoutonomous Agents and Multi-Agent Systems (AAMAS-2020)  2020.5 

    　More details

    Event date： 2020.5

    Language：English  

    Country：New Zealand  

  • Student-Project-Resource Matching-Allocation Problems: Two-Sided Matching Meets Resource Allocation

    Kentaro Yahiro, Makoto Yokoo

    2020.3 

    　More details

    Event date： 2020.3

    Language：Japanese  

    Country：Japan  

  • Fighting against an adversary with NP oracle: Challenge to Σ2p-complete Problems

    ゲーム理論ワークショップ2020  2020.3 

    　More details

    Event date： 2020.3

    Language：Japanese  

    Venue：駒澤大学 (東京都)   Country：Japan  

  • SATソルバーを利用した施設配置のメカニズムデザイン

    岡田 和夏, 東藤 大樹, 横尾 真

    ゲーム理論ワークショップ2020  2020.3 

    　More details

    Event date： 2020.3

    Language：Japanese  

    Venue：駒澤大学 (東京都)   Country：Japan  

  • SATソルバーを利用した施設配置のメカニズムデザイン

    岡田 和夏, 東藤 大樹, 横尾 真

    2020.2 

    　More details

    Event date： 2020.2

    Language：Japanese  

    Venue：沖縄県青年会館（沖縄県那覇市)   Country：Japan  

  • 待機児童問題へ応用可能なマッチング問題と資源配分問題の融合問題

    八尋 健太郎，横尾 真

    2020.2 

    　More details

    Event date： 2020.2

    Language：Japanese  

    Venue：沖縄県青年会館（沖縄県那覇市)   Country：Japan  

  • 協力グラフゲームにおけるk提携構造形成問題

    渡部 恵海, 横尾 真

    2020.2 

    　More details

    Event date： 2020.2

    Language：Japanese  

    Venue：沖縄県青年会館（沖縄県那覇市)   Country：Japan  

  • Deep false-name-proof auction mechanisms International conference

    Yuko Sakurai, Satoshi Oyama, Mingyu Guo, Makoto Yokoo

    The 22nd International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2019)  2019.10 

    　More details

    Event date： 2019.10

    Language：English  

    Country：Italy  

  • Deep false-name-proof auction mechanisms International conference

    Yuko Sakurai, Satoshi Oyama, Mingyu Guo, Makoto Yokoo

    2019.10 

    　More details

    Event date： 2019.10

    Language：English  

    Country：Italy  

  • SATソルバーを利用した施設配置のメカニズムデザイン

    岡田 和夏, 東藤 大樹, 横尾 真

    合同エージェントワークショップ＆シンポジウム（JAWS-2019）  2019.9 

    　More details

    Event date： 2019.9

    Language：Japanese  

    Venue：別府温泉 杉乃井ホテル（大分県別府市）   Country：Japan  

  • 部分的選好下における学校選択メカニズム

    和田 凌司, 八尋 健太郎, 東藤 大樹, 横尾 真

    合同エージェントワークショップ＆シンポジウム（JAWS-2019）  2019.9 

    　More details

    Event date： 2019.9

    Language：Japanese  

    Venue：別府温泉 杉乃井ホテル（大分県別府市）   Country：Japan  

  • 敵対者が存在する場合のk携構造形成問題

    渡部 恵海, 横尾 真

    合同エージェントワークショップ＆シンポジウム（JAWS-2019）  2019.9 

    　More details

    Event date： 2019.9

    Language：Japanese  

    Venue：別府温泉 杉乃井ホテル（大分県別府市）   Country：Japan  

  • ネットワークオークションにおける戦略的操作不可性かつ非浪費性を満たすメカニズムの設計

    川﨑 岳洋, 高梨 誠之, 東藤 大樹, 横尾 真

    合同エージェントワークショップ＆シンポジウム（JAWS-2019）  2019.9 

    　More details

    Event date： 2019.9

    Language：Japanese  

    Venue：別府温泉 杉乃井ホテル（大分県別府市）   Country：Japan  

  • 部分的選好下における学校選択メカニズム

    和田 凌司，八尋 健太郎，東藤 大樹，横尾 真

    第18回情報科学技術フォーラム（FIT2019）  2019.9 

    　More details

    Event date： 2019.9

    Language：Japanese  

    Venue：岡山大学   Country：Japan  

  • SATソルバーを利用した施設配置のメカニズムデザイン

    岡田 和夏、和田 勇歩、東藤 大樹、横尾 真

    2019年度人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese  

    Venue：朱鷺メッセ新潟コンベンションセンター（新潟県新潟市）   Country：Japan  

  • マーケットデザイン：ゲーム理論による社会制度の設計 Invited

    横尾真

    2019年度人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：朱鷺メッセ新潟コンベンションセンター（新潟県新潟市）   Country：Japan  

  • 待機児童問題へ応用可能なマッチング問題と資源配分問題の融合問題

    八尋 健太郎、山口 知晃、Ismaili Anisse、横尾 真

    2019年度人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese  

    Venue：朱鷺メッセ新潟コンベンションセンター（新潟県新潟市）   Country：Japan  

  • 協力グラフゲームにおける提携構造形成問題

    渡部 恵海、越村 三幸、櫻井 祐子、横尾 真

    2019年度人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese  

    Venue：朱鷺メッセ新潟コンベンションセンター（新潟県新潟市）   Country：Japan  

  • 部分的選好下における学校選択メカニズム

    和田 凌司、八尋 健太郎、山口 知晃、東藤 大樹、横尾 真

    2019年度人工知能学会全国大会（第33回）  2019.6 

    　More details

    Event date： 2019.6

    Language：Japanese  

    Venue：朱鷺メッセ新潟コンベンションセンター（新潟県新潟市）   Country：Japan  

  • Two-stage n-person prisoner's dilemma with social preferences International conference

    Seji Takanashi, Makoto Yokoo

    The 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2019)  2019.5 

    　More details

    Event date： 2019.5

    Language：English  

    Country：Canada  

  • Student-Project-Resource Matching-Allocation Problems: Two-Sided Matching Meets Resource Allocation International conference

    Anisse Ismaili, Kentaro Yahiro, Makoto Yokoo, Tomoaki Yamaguchi

    The 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2019)  2019.5 

    　More details

    Event date： 2019.5

    Language：English  

    Country：Canada  

  • Complexity and Approximations in Robust Coalition Formation via Max-Min k-Partitioning International conference

    Anisse Ismaili, Makoto Yokoo, Noam Hazon, Sarit Kraus, Emi Watanabe

    The 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2019)  2019.5 

    　More details

    Event date： 2019.5

    Language：English  

    Country：Canada  

  • Robustness against Agent Failure in Hedonic Games International conference

    Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo

    The 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2019)  2019.5 

    　More details

    Event date： 2019.5

    Language：English  

    Country：Canada  

  • 人工知能とゲーム理論 Invited

    横尾真

    情報処理学会　第８１回全国大会  2019.3 

    　More details

    Event date： 2019.3

    Language：Japanese   Presentation type：Oral presentation (invited, special)  

    Venue：福岡大学（福岡県福岡市）   Country：Japan  

  • Manipulations-resistant facility location mechanisms for ZV-line graphs International conference

    Ilan Nehama, Taiki Todo, Makoto Yokoo

    The 14th Conference on Web and Internet Economics (WINE-2018)  2018.12 

    　More details

    Event date： 2018.12

    Language：English  

    Country：United Kingdom  

  • The Complexity of Sequential Routing Games International conference

    Anisse Ismaili, Makoto Yokoo

    The 14th Conference on Web and Internet Economics (WINE-2018)  2018.12 

    　More details

    Event date： 2018.12

    Language：English  

    Country：United Kingdom  

  • 離散空間における施設配置問題の考察

    和田勇歩, 東藤大樹, 横尾真

    合同エージェントワークショップ＆シンポジウム2018（JAWS2018)  2018.9 

    　More details

    Event date： 2018.9

    Language：Japanese  

    Venue：安芸グランドホテル（広島県廿日市市）   Country：Japan  

  • エージェントの社会性を考慮した友達優先ヘドニックゲーム

    大田一徳, Nathanael Barrot, 櫻井祐子, 横尾真

    合同エージェントワークショップ＆シンポジウム2018（JAWS2018)  2018.9 

    　More details

    Event date： 2018.9

    Language：Japanese  

    Venue：安芸グランドホテル（広島県廿日市市）   Country：Japan  

  • Impact of the Number of Neutrals on Stability Concepts in Friends Oriented Hedonic Games International conference

    THE AAMAS-IJCAI Workshop on Agents and Incentives in Artificial Intelligence  2018.7 

    　More details

    Event date： 2018.7 - 2019.7

    Language：English  

    Country：Sweden  

  • Manipulation-resistant facility location mechanisms for ZV-line graphs. International conference

    Ilan Nehama, Taiki Todo, Makoto Yokoo.

    Seventh International Workshop on Computational Social Choice (COMSOC-2018)  2018.6 

    　More details

    Event date： 2018.6

    Language：English   Presentation type：Symposium, workshop panel (public)  

    Country：United States  

  • Impact of the Number of Neutrals on Stability Concepts in Friends Oriented Hedonic Games. International conference

    Seventh International Workshop on Computational Social Choice (COMSOC-2018)  2018.6 

    　More details

    Event date： 2018.6

    Language：English   Presentation type：Symposium, workshop panel (public)  

    Country：United States  

  • Manipulation-resistant facility location mechanisms for ZV-line graphs. International conference

    Ilan Nehama, Taiki Todo, Makoto Yokoo

    The 14th Meeting of the Society for Social Choice and Welfare  2018.6 

    　More details

    Event date： 2018.6

    Language：English  

    Country：Korea, Republic of  

  • エージェントの参加が不確実な場合のk分割問題

    野本一貴, 櫻井祐子, 岡本吉央, 横尾真

    2018年度人工知能学会全国大会（第32回）  2018.6 

    　More details

    Event date： 2018.6

    Language：Japanese  

    Venue：城山観光ホテル（鹿児島県鹿児島市）   Country：Japan  

  • エージェントの社会性を考慮したヘドニックゲーム

    大田一徳, Barrot Nathanael, 櫻井祐子, 横尾真

    2018年度人工知能学会全国大会（第32回）  2018.6 

    　More details

    Event date： 2018.6

    Language：Japanese  

    Venue：城山観光ホテル（鹿児島県鹿児島市）   Country：Japan  

  • 人非対称情報オールペイオークションにおける均衡と逆転現象の解析

    赤木亨, 東藤大樹, 横尾真

    2018年度人工知能学会全国大会（第32回）  2018.6 

    　More details

    Event date： 2018.6

    Language：Japanese  

    Venue：城山観光ホテル（鹿児島県鹿児島市）   Country：Japan  

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

    張語哲, 八尋健太郎, Barrot Nathanael, 横尾真

    2018年度人工知能学会全国大会（第32回）  2018.6 

    　More details

    Event date： 2018.6

    Language：Japanese  

    Venue：城山観光ホテル（鹿児島県鹿児島市）   Country：Japan  

  • Facility Location with Variable and Dynamic Populations International conference

    Yuho Wada, Tomohiro Ono, Taiki Todo, Makoto Yokoo

    2018.2 

    　More details

    Event date： 2018.2

    Language：English   Presentation type：Symposium, workshop panel (public)  

    Country：United States  

  • Stochastic Game Modelling for Distributed Constraint Reasoning with Privacy International conference

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    The International Symposium on Artificial Intelligence and Mathematics 2018 (ISAIM-2018) 

    　More details

    Event date： 2018.1

    Language：English  

  • マーケットデザイン：ゲーム理論による社会制度の設計 Invited

    横尾真

    第22回日本糖尿病教育・看護学会学術集会  2017.9 

    　More details

    Event date： 2017.9

    Language：Japanese   Presentation type：Oral presentation (invited, special)  

    Venue：福岡国際会議場（福岡県福岡市）   Country：Japan  

  • ヘドニックゲームの新たな選好モデルにおけるコア安定性の一考察

    大田一徳，Nathanael Barrot，Anisse Ismaili，櫻井祐子，横尾真

    合同エージェントワークショップ&シンポジウム２０１７（JAWS-2017)  2017.9 

    　More details

    Event date： 2017.9

    Language：Japanese  

    Venue：鴨川ホテル三日月（千葉県鴨川市）   Country：Japan  

  • 変動的人口モデルにおける耐戦略的な施設配置メカニズム

    和田勇歩，小野友寛，東藤大樹，横尾真

    第16回情報科学技術フォーラム（FIT2017）  2017.9 

    　More details

    Event date： 2017.9

    Language：Japanese  

    Venue：東京大学本郷キャンパス（東京都文京区）   Country：Japan  

  • Sustaining Circular Cooperation with Observation Errors International conference

    Kota Shigedomi, Fuuki Shigenaka, Tadashi Sekiguchi, Atsushi Iwasaki, Makoto Yokoo

    2017.8 

    　More details

    Event date： 2017.8

    Language：English  

    Country：Australia  

  • 下限制約と初期保有財を考慮した学校選択メカニズムの特徴付け

    山口 知晃, 張 語哲, 濵田 直斗, 鈴木 貴晶, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • 分割関数ゲームを対象とした提携構造形成問題のMaxSAT符号化

    越村 三幸, 査 澳龍, 野本 一貴, 櫻井 祐子, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • 私的観測付き繰り返しゲームの三角取引モデルにおける均衡解析

    重冨 孝太, 重中 風奎, 岩崎 敦, 関口 格, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • 2次元格子空間上の施設配置問題におけるパレート効率性の考察

    和田 勇歩, 小野 友寛, 富永 優仁, 東藤 大樹, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • ヘドニックゲームにおける新たな選好モデルの提案とコア安定性の解析

    大田 一徳, 櫻井 祐子, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • 相対的制約を扱うマッチングメカニズムの提案と評価

    八尋 健太郎, 濵田 直斗, 鈴木 貴晶, 櫻井 祐子, 横尾 真

    2017年度人工知能学会全国大会（第31回）  2017.5 

    　More details

    Event date： 2017.5

    Language：Japanese  

    Venue：ウインクあいち（愛知県名古屋市）   Country：Japan  

  • Coalition Structure Generation Utilizing Graphical Representation of Partition Function Games International conference

    Kazuki Nomoto, Yuko Sakurai, Makoto Yokoo

    The Thirty-First AAAI Conference on Artificial Intelligence (AAAI-2017)  2017.2 

    　More details

    Event date： 2017.2

    Language：English  

    Country：Japan  

  • Two-sided matching: optimization under incentive, stability, and distributional constraints Invited

    10th CSPSAT Seminar  2016.11 

    　More details

    Event date： 2016.11

    Language：Japanese   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

    Country：Japan  

  • DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents International conference

    Julien Savaux, Julien Vion, Sylvain Piechowiak, Rene Mandiau, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo, Shakre Elmane, Marius Silaghi

    2016 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2016  2016.10 

    　More details

    Event date： 2016.10

    Language：English  

    Country：United States  

  • 分割関数ゲームの提携構造形成アルゴリズム

    野本 一貴, 大田 一徳, 上田 俊, 櫻井 祐子, 横尾 真

    合同エージェントワークショップ＆シンポジウム2016（JAWS2016)  2016.9 

    　More details

    Event date： 2016.9

    Language：Japanese  

    Venue：かんぽの宿 岐阜羽島（岐阜県羽島市）   Country：Japan  

  • Market Design: Designing Social System by Game Theory Invited International conference

    Makoto Yokoo

    The 19th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA2016)  2016.8 

    　More details

    Event date： 2016.8

    Language：English   Presentation type：Oral presentation (general)  

    Country：Thailand  

  • The Belief-Based Approach to Private Monitoring International conference

    Michihiro Kandori, Ichiro Obara, Atsushi Iwasaki, Makoto Yokoo

    2016 Asian Meeting of the Econometric Society (AMES-2016)  2016.8 

    　More details

    Event date： 2016.8

    Language：English  

    Country：Japan  

  • Pareto efficient school choice mechanism under distributional constraints with initial endowments International conference

    The 12th European Meeting on Game Theory (SING12)  2016.7 

    　More details

    Event date： 2016.7

    Language：English  

    Country：Denmark  

  • 外部性が存在する提携ゲームのための提携構造形成アルゴリズムの提案

    野本 一貴, 伊原 尚正, 櫻井 祐子, 横尾 真

    2016年度人工知能学会全国大会（第30回）  2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese  

    Venue：北九州国際会議場（福岡県北九州市）   Country：Japan  

  • 人工知能とゲーム理論 Invited

    横尾 真

    2016年度人工知能学会全国大会（第30回）（JSAI-2016)  2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese   Presentation type：Symposium, workshop panel (public)  

    Venue：北九州国際会議場（福岡県北九州市）   Country：Japan  

  • 異なる性質を有する二施設配置のための架空名義操作不可能なメカニズム

    小野 友寛, 横尾 真, 東藤 大樹, 苑田 尭久, 富永 優仁

    2016年度人工知能学会全国大会（第30回）  2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese  

    Venue：北九州国際会議場（福岡県北九州市）   Country：Japan  

  • 学校選択制におけるパレート効率的かつ耐戦略的なメカニズム

    濵田 直斗, 倉田 涼史, Hsu Chia Ling, 鈴木 貴晶, 上田 俊, 横尾 真

    2016年度人工知能学会全国大会（第30回）  2016.6 

    　More details

    Event date： 2016.6

    Language：Japanese  

    Venue：北九州国際会議場（福岡県北九州市）   Country：Japan  

  • How is cooperation/collusion sustained in repeated multimarket contact with observation errors? International conference

    Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto, Makoto Yokoo

    The 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2016)  2016.5 

    　More details

    Event date： 2016.5

    Language：English  

    Country：Singapore  

  • Strategyproof Matching with Minimum Quotas and Initial Endowments International conference

    The seventh Workshop on Cooperative Game in Multiagent Systems (CoopMAS-2016)  2016.5 

    　More details

    Event date： 2016.5

    Language：English   Presentation type：Symposium, workshop panel (public)  

    Country：Singapore  

  • Two-sided Matching: Optimization under Incentive, Stability, and Distributional Constraints Invited International conference

    Makoto Yokoo

    International Workshop on Optimisation in Multi-Agent Systems (OptMAS-2016)  2016.5 

    　More details

    Event date： 2016.5

    Language：English   Presentation type：Oral presentation (general)  

    Country：Singapore  

  • Achieving Sustainable Cooperation in Generalized Prisoner's Dilemma with Observation Errors International conference

    Makoto Yokoo, Fuuki Shigenaka, Shun Yamamoto, Motohide Seki, Tadashi Sekiguchi, Atsushi Iwasaki

    The 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2016)  2016.5 

    　More details

    Event date： 2016.5

    Language：English  

    Country：Singapore  

  • 外部性が存在する提携ゲームのための提携構造形成アルゴリズムの提案

    横尾 真, 野本 一貴, 伊原 尚正, 鶴田 俊祐, 櫻井 祐子

    2016年電子情報通信学会総合大会  2016.3 

    　More details

    Event date： 2016.3

    Language：Japanese  

    Venue：九州大学　伊都キャンパス（福岡市西区）   Country：Japan  

  • ケーキ分割問題のためのメカニズムデザイン

    横尾 真, 鶴田 俊佑, 東藤 大樹, 櫻井 祐子

    2015年度電子情報通信学会　人工知能と知識処理研究会(AI)  2015.12 

    　More details

    Event date： 2015.12

    Language：Japanese  

    Venue：那覇市ぶんかテンブス館（沖縄県那覇市）   Country：Japan  

  • An integrated model on the evolution of life history with material and cultural parental contribution on the offspring fitness

    2015.12 

    　More details

    Event date： 2015.12

    Language：Japanese   Presentation type：Oral presentation (general)  

    Country：Japan  

  • Market　Design/研修医マッチング Invited

    横尾 真

    行動経済学会第9回大会  2015.11 

    　More details

    Event date： 2015.11

    Language：Japanese   Presentation type：Oral presentation (invited, special)  

    Venue：近畿大学　東大阪キャンパス（大阪府東大阪市）   Country：Japan  

  • How is cooperation/collusion sustained in repeated multimarket contact with observation errors? International conference

    Makoto Yokoo, Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto

    AAAI Fall Symposium 2015, Sequential Decision Making for Intelligent Agents Symposium(SDMIA)  2015.11 

    　More details

    Event date： 2015.11

    Language：English  

    Country：United States  

  • Flexible Reward Plans to Elicit Truthful Predictions in Crowdsourcing International conference

    Makoto Yokoo, Yuko Sakurai, Satoshi Oyama, Masato Shinoda

    Conference on Human Computation & Crowdsourcing(HCOMP2015)  2015.11 

    　More details

    Event date： 2015.11

    Language：English   Presentation type：Oral presentation (general)  

    Country：United States  

  • 私的観測付無限回繰り返しチーム生産ゲームのサボタージュ行動

    横尾 真, 重中 風奎, 山本 駿, 岩崎 敦, 関口　格

    合同エージェントワークショップ＆シンポジウム2015（JAWS2015)  2015.10 

    　More details

    Event date： 2015.9 - 2015.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：山中温泉河鹿荘ロイヤルホテル(石川県加賀市）   Country：Japan  

  • クラウドソーシングのための一般化スコアリングルールの提案

    横尾 真, 櫻井 祐子

    合同エージェントワークショップ＆シンポジウム2015（JAWS2015)  2015.9 

    　More details

    Event date： 2015.9 - 2015.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：山中温泉河鹿荘ロイヤルホテル(石川県加賀市）   Country：Japan  

  • 日本の学校選択制に適用可能なマッチングメカニズムの提案

    横尾 真, 濱田 直斗, 倉田 涼史, 上田 俊

    合同エージェントワークショップ＆シンポジウム2015（JAWS2015)  2015.9 

    　More details

    Event date： 2015.9 - 2015.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：山中温泉河鹿荘ロイヤルホテル(石川県加賀市）   Country：Japan  

  • 二値効用下での戦略的操作不可能なケーキ分割メカニズムの提案

    横尾 真, 伊原尚正, 鶴田俊祐, 東藤 大樹, 櫻井 祐子

    日本ソフトとウェア科学会第32回大会  2015.9 

    　More details

    Event date： 2015.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：早稲田大学　西早稲田キャンパス（東京都）   Country：Japan  

  • 計算機科学者のためのゲーム理論入門 Invited

    横尾 真

    日本ソフトウェア科学会第３２回大会  2015.9 

    　More details

    Event date： 2015.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：早稲田大学　西早稲田キャンパス（東京都）   Country：Japan  

  • Designing Matching Mechanisms under General Distributional Constraints

    Summer Workshop on Economic Theory(SWET2015)  2015.8 

    　More details

    Event date： 2015.8

    Language：Japanese   Presentation type：Oral presentation (general)  

    Country：Japan  

  • Designing Matching Mechanisms under General Distributional Constraints International conference

    Makoto Yokoo, Masahiro Goto, Fuhito Kojima, Ryoji Kurata, Akihisa Tamura

    The Sixteenth ACM Conference on Economics and Computation (EC'15)  2015.6 

    　More details

    Event date： 2015.6

    Language：English   Presentation type：Oral presentation (general)  

    Country：United States  

  • 不完全観測繰り返しゲームのチーム生産モデルにおける均衡解析

    横尾 真, 重中 風奎, 山本 駿, 岩崎　敦, 関口　格

    2015年度人工知能学会全国大会（第29回）  2015.6 

    　More details

    Event date： 2015.5 - 2015.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：公立はこだて未来大学（北海道函館市）   Country：Japan  

  • 2人ラウンド制 Item Picking Game の解析

    横尾 真, 富永 優仁, 苑田 尭久, 東藤 大樹

    2015年度人工知能学会全国大会（第29回）  2015.5 

    　More details

    Event date： 2015.5 - 2015.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：公立はこだて未来大学（北海道函館市）   Country：Japan  

  • 戦略的操作不可能なケーキ分割メカニズムの提案

    横尾 真, 伊原 尚正, 鶴田 俊祐, 東藤 大樹, 櫻井 祐子

    2015年度人工知能学会全国大会（第29回）  2015.5 

    　More details

    Event date： 2015.5 - 2015.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：公立はこだて未来大学（北海道函館市）   Country：Japan  

  • 物々交換モデルにおける財の非対称性

    横尾 真, 孫 兆鴻, 東藤 大樹

    2015年度人工知能学会全国大会（第29回）  2015.5 

    　More details

    Event date： 2015.5 - 2015.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：公立はこだて未来大学（北海道函館市）   Country：Japan  

  • 個別下限制約付きタイプ優先マッチング問題

    横尾 真, 濱田　直斗, 倉田　涼史, 後藤　誠大

    2015年度人工知能学会全国大会（第29回）  2015.6 

    　More details

    Event date： 2015.5 - 2015.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：公立はこだて未来大学（北海道函館市）   Country：Japan  

  • Parametric Mechanism Design via Quantifier Elimination International conference

    Makoto Yokoo, Atsushi Iwasaki, Etsushi Fujita, Taiki Todo, Hidenao Iwane, Hirokazu Anai, Mingyu Guo

    The International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2015)  2015.5 

    　More details

    Event date： 2015.5

    Language：English   Presentation type：Oral presentation (general)  

    Country：Turkey  

  • Improving fairness in nonwasteful matching with hierarchical regional minimum quotas International conference

    Masahiro Goto, Ryoji Kurata, Naoto Hamada, Atsushi Iwasaki,Makoto Yokoo

    The International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2015)  2015.5 

    　More details

    Event date： 2015.5

    Language：English  

    Country：Turkey  

  • Mechanism Design for Constrained Matching Invited International conference

    Makoto Yokoo

    The Sixth Workshop on Cooperative Games in Multiagent Systems (CoopMAS-2015)/AAMAS-2015  2015.5 

    　More details

    Event date： 2015.5

    Language：English   Presentation type：Oral presentation (invited, special)  

    Country：Turkey  

  • k-Coalitional Cooperative Games International conference

    Makoto Yokoo, SKIBSKI OSKAR

    The Sixth International Workshop on Cooperative Games and Multiagent Systems (CoopMAS/AAMAS-2015)  2015.5 

    　More details

    Event date： 2015.5

    Language：English   Presentation type：Oral presentation (general)  

    Country：Turkey  

  • 知のコミュニティワークショップのねらいと報告 Invited

    横尾 真

    情報処理学会　第７６回全国大会  2015.3 

    　More details

    Event date： 2015.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：東京電機大学　東京千住キャンパス（東京都）   Country：Japan  

  • 私的観測付き繰り返しゲームの均衡解析

    横尾 真

    2014年度確率モデルシンポジウム  2015.1 

    　More details

    Event date： 2015.1

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：東北大学   Country：Japan  

  • Theoretical Foundations of Multi-agent Systems: Distributed Constraint Reasoning and Game Theory Invited International conference

    Makoto Yokoo

    KAIST SPECIAL INVITED LECTURES  2014.12 

    　More details

    Event date： 2014.12

    Language：English   Presentation type：Oral presentation (invited, special)  

    Country：Korea, Republic of  

  • 複数タイプ付きマッチングメカニズムの理論設計

    横尾 真, 倉田　涼史, 後藤　誠大, 岩崎　敦

    合同エージェントワークショップ＆シンポジウム2014（JAWS2014)  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ANAホリデイ・イン・リゾート（宮崎市）   Country：Japan  

  • 最小費用全域木ゲームにおける名義分割に対する一考察

    横尾 真, 藤田　悦誌, 東藤 大樹

    合同エージェントワークショップ＆シンポジウム2014（JAWS2014)  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ANAホリデイ・イン・リゾート（宮崎市）   Country：Japan  

  • 私的観測状況下における多市場接触

    横尾 真, 山本　駿, 岩崎　敦

    合同エージェントワークショップ＆シンポジウム2014（JAWS2014)  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ANAホリデイ・イン・リゾート（宮崎市）   Country：Japan  

  • ケーキ分割問題における架空名義操作

    横尾 真, 鶴田　俊佑, 岡　雅晃, 東藤 大樹, 櫻井 祐子

    合同エージェントワークショップ＆シンポジウム2014（JAWS2014)  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ANAホリデイ・イン・リゾート（宮崎市）   Country：Japan  

  • Adaptive Two-stage Deferred Acceptance Mechanism

    2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Country：Japan  

  • 架空名義操作不可能な二施設配置メカニズム

    横尾 真, 苑田　尭久, 東藤 大樹

    合同エージェントワークショップ＆シンポジウム2014（JAWS2014)  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ANAホリデイ・イン・リゾート（宮崎市）   Country：Japan  

  • 制約付きマッチングのメカニズムデザイン Invited

    横尾 真

    日本経済学会2014年度秋季大会  2014.10 

    　More details

    Event date： 2014.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：西南学院大学（福岡市）   Country：Japan  

  • Designing Matching Mechanisms under Constraints: An Approach from Discrete Convex Analysis International conference

    Makoto Yokoo, Fuhito Kojima, Akihisa Tamura

    The 7th International Symposium on Algorithmic Game Theory  2014.9 

    　More details

    Event date： 2014.9 - 2014.10

    Language：English   Presentation type：Oral presentation (general)  

    Country：Greece  

  • 架空名義操作不可能な再配分メカニズムの特徴付け

    横尾 真, 鶴田　俊佑, 岡　雅晃, 東藤 大樹, 櫻井 祐子

    第13回情報科学技術フォーラム（FIT2014）  2014.9 

    　More details

    Event date： 2014.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：筑波大学   Country：Japan  

  • 計算複雑性に基づいたパレート効率的な複数財交換ルール

    横尾 真, 藤田　悦誌, Julien Lesca, 苑田 尭久, 東藤 大樹

    第13回情報科学技術フォーラム（FIT2014）  2014.9 

    　More details

    Event date： 2014.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：筑波大学   Country：Japan  

  • False-name-proof Combinatorial Auction Design via Single-minded Decomposition International conference

    Makoto Yokoo, Dengji Zhao, Siqi Luo, Taiki Todo

    21st European Conference on Artificial Intelligence  2014.8 

    　More details

    Event date： 2014.8

    Language：English   Presentation type：Oral presentation (general)  

    Country：Czech Republic  

  • 自己充足性を満たすための報酬設定の検討

    横尾 真, 岡　雅晃, 東藤 大樹, 櫻井 祐子

    2014年度電子情報通信学会　人工知能と知識処理研究会(AI)  2014.6 

    　More details

    Event date： 2014.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：早稲田大学   Country：Japan  

  • マーケットデザイン：ゲーム理論による社会制度の設計 Invited

    横尾 真

    電子情報通信学会　九州支部　特別講演会  2014.6 

    　More details

    Event date： 2014.6

    Language：Japanese   Presentation type：Oral presentation (invited, special)  

    Venue：福岡大学（福岡市）   Country：Japan  

  • 効率性と誘因制約を両立可能な物々交換モデルの特徴付け

    横尾 真, 苑田 尭久, 東藤 大樹

    2014年度人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール（愛媛県松山市）   Country：Japan  

  • 地域上下限制約付きマッチングメカニズムの理論設計と評価

    横尾 真, 倉田　涼史, 後藤　誠大, 橋本　直幸, 岩崎　敦, 川崎　雄二郎, 上田　俊

    2014年度人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール（愛媛県松山市）   Country：Japan  

  • 不完全私的観測付き繰り返しゲームにおける均衡発見プログラム

    横尾 真, 山本　駿, 岩崎　敦, 趙 登吉

    2014年度人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール（愛媛県松山市）   Country：Japan  

  • 効率的な資源利用のための利用予測申告と実行動に関する一考察

    横尾 真, 不動　顕, 岡　雅晃, 東藤 大樹, 櫻井 祐子

    2014年度人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール（愛媛県松山市）   Country：Japan  

  • 架空名義操作不可能な再配分メカニズムの特徴付け

    横尾 真, 鶴田　俊佑, 岡　雅晃, 東藤 大樹, 櫻井 祐子

    2014年度人工知能学会全国大会（第28回）  2014.5 

    　More details

    Event date： 2014.5

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：ひめぎんホール（愛媛県松山市）   Country：Japan  

  • Trading Multiple Indivisible Goods with Indifferences: Beyond Sonmez's Result International conference

    Makoto Yokoo, Akihisa Sonoda, Etsushi Fujita, Taiki Todo

    The Sixth International Workshop on Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis (AMEC/TADA-14).  2014.5 

    　More details

    Event date： 2014.5

    Language：English   Presentation type：Oral presentation (general)  

    Country：France  

  • マーケットデザイン：ゲーム理論による社会制度の設計 Invited

    横尾 真

    第２回STI政策シンポジウム  2014.3 

    　More details

    Event date： 2014.3

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：博多都ホテル   Country：Japan  

  • メカニズムデザインと最適化 Invited

    横尾 真

    第15回情報学シンポジウム「最適化と情報学」  2013.12 

    　More details

    Event date： 2013.12

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：京都大学吉田キャンパス   Country：Japan  

  • 制約付きマッチングのメカニズムデザイン Invited

    横尾 真

    第17回　実験社会科学カンファレンス  2013.12 

    　More details

    Event date： 2013.12

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：高知技工科大学   Country：Japan  

  • 戦略的操作不可能な下限制約付きマッチング Invited

    横尾 真

    第25回RAMPシンポジウム  2013.10 

    　More details

    Event date： 2013.10

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：鹿児島大学稲盛会館   Country：Japan  

  • 制約付きマッチングのメカニズムデザイン Invited

    横尾 真

    日本ソフトウェア科学会第30回大会  2013.9 

    　More details

    Event date： 2013.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：東京大学本郷キャンパス   Country：Japan  

  • 地域制約の下での戦略的操作不可能なマッチングメカニズム

    横尾 真, 橋本　直幸, 上田　俊, 岩﨑　敦, 安田　洋祐

    第12回情報科学技術フォーラム（FIT2013)  2013.9 

    　More details

    Event date： 2013.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：鳥取大学   Country：Japan  

  • 双対解を用いた提携構造付きコアの非空判定阿ｱﾙｺﾞﾘｽﾞﾑの高速化

    横尾 真, 岩﨑　敦, 上田　俊

    第12回情報科学技術フォーラム（FIT2013)  2013.9 

    　More details

    Event date： 2013.9

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：鳥取大学   Country：Japan  

  • メカニズムデザインと最適化 Invited

    横尾 真

    論理と推論、実装、応用に関する合同セミナー  2013.7 

    　More details

    Event date： 2013.7

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：北海道大学   Country：Japan  

  • クラウドソーシングでのタスク品質改善のための価格設定の検討

    横尾 真, 岡　雅晃, 沖本　天太, 櫻井 祐子, 篠田　正人

    2013年度人工知能学会全国大会（第27回・JSAI2013)  2013.6 

    　More details

    Event date： 2013.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：富山国際会議場「大手町フォーラム」   Country：Japan  

  • 下限制約付きマッチングメカニズムの理論的設計と評価

    横尾 真, 後藤　誠大, 岩﨑　敦, 上田　俊

    2013年度人工知能学会全国大会（第27回・JSAI2013)  2013.6 

    　More details

    Event date： 2013.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：富山国際会議場「大手町フォーラム」   Country：Japan  

  • VCG-equivalent in Expectationメカニズム

    横尾 真, 藤田　悦誌, 岩﨑　敦, 東藤 大樹, ヨウ　ミョウ

    2013年度人工知能学会全国大会（第27回・JSAI2013)  2013.6 

    　More details

    Event date： 2013.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：富山国際会議場「大手町フォーラム」   Country：Japan  

  • クラウドソーシングに おける必要ワーカ数の動的決定方法の提案

    横尾 真, 櫻井 祐子, 岡　雅晃, 沖本　天太, 篠田　正人

    2013年度人工知能学会全国大会（第27回・JSAI2013)  2013.6 

    　More details

    Event date： 2013.6

    Language：Japanese   Presentation type：Oral presentation (general)  

    Venue：富山国際会議場「大手町フォーラム」   Country：Japan  

  • Quality-Control Mechanism utilizingWorker's Confidence for Crowdsourced Tasks International conference

    Makoto Yokoo, Yuko Sakurai, Tenda Okimoto, Masaaki Oka, Masato Shinoda

    The twelfth International Conference on Autonomous Agents and Multiagent Systems(AAMAS-2013)  2013.5 

    　More details

    Event date： 2013.5

    Language：English   Presentation type：Oral presentation (general)  

    Country：United States  

  • Generalized Partition Mechanism: Framework for Combining Multiple Stratedy-Mechanisms International conference

    Makoto Yokoo, Yuko Sakurai

    IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-2012)  2012.12 

    　More details

    Event date： 2012.12

    Country：China  

  • Laboratories/students problem with minimum/maximum quotas(IEEE Computer Society Japan Chapter JAWS Young Researcher Award )（JAWS2011優秀論文賞)，(iJAWS Best Paper Award）

    合同エージェントワークショップ＆シンポジウム２０１１ (JAWS-2011)  2011.10 

    　More details

    Event date： 2011.10

    Venue：熱海後楽園ホテル   Country：Japan  

  • 線形計画法を用いた提携構造形成と利得配分の同時解決(IEEE Computer Society Japan Chapter JAWS Young Researcher Award)

    北木真，上田俊，岩崎敦，横尾真

    合同エージェントワークショップ＆シンポジウム２０１１ (JAWS-2011)  2011.10 

    　More details

    Event date： 2011.10

    Venue：熱海後楽園ホテル   Country：Japan  

  • 自動メカニズムデザインを利用した組合せオークションのルール抽出アルゴリズムの提案（船井ベストペーパー賞）

    毛利貴之,杉町勇和,東藤大樹，岩崎敦,横尾真

    第10回情報科学技術フォーラム（FIT-2011）  2011.9 

    　More details

    Event date： 2011.9 - 2011.8

    Venue：函館大学   Country：Japan  

  • Pseudo-tree-based Algorithm for Approximate Distributed Constraint Optimization with Quality Bounds International conference

    Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo

    The tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2011)  2011.5 

    　More details

    Event date： 2011.5

    Language：English  

    Country：Taiwan, Province of China  

  • Concise Characteristic Function Representations in Coalitional Games Based on Agent Types International conference

    Suguru Ueda, Makoto Kitaki, Atsushi Iwasaki, Makoto Yokoo

    The tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2011)  2011.5 

    　More details

    Event date： 2011.5

    Language：English  

    Country：Taiwan, Province of China  

  • 架空名義操作不可能な施設配置メカニズムの特徴付け

    東藤大樹, 岩崎　敦，横尾　真

    第9回情報科学技術フォーラム (FIT2010)  2010.9 

    　More details

    Event date： 2010.9

    Presentation type：Oral presentation (general)  

    Venue：九州大学   Country：Japan  

    本研究では，参加者が共有する施設（例えば鉄道の駅）を設置する場所を投票で決定する際に，各参加者が正直に自分の選好を申告し，かつ，複数個の投票を行う誘因を与えない意思決定メカニズムを提案している．このような性質を持つメカニズムは，オークション等の金銭の譲渡が可能な状況では従来研究が存在したが，金銭の譲渡が不可能な場合での考察は本研究が世界初の試みである．

  • 架空名義操作不可能な組合せオークションメカニズム：VCG メカニズムの改良

    毛利貴之, 東藤大樹, 岩崎　敦，横尾　真

    第9回情報科学技術フォーラム (FIT2010)  2010.9 

    　More details

    Event date： 2010.9

    Presentation type：Oral presentation (general)  

    Venue：九州大学   Country：Japan  

    本発表では，インターネット上で生じる，複数のメールアドレス等を用いて複数の入札を行う架空名義入札と呼ばれる不正行為に対して，そのような不正行為の影響を受けないオークションメカニズムを提案している．本発表では，ノーベル経済学賞を受賞したW. Vickreyの提案によるVCGメカニズムを改良することにより，架空名義操作不可能とする方法を示している．

  • Characterization of Strategy-proof, Revenue Monotone Combinatorial Auction Mechanisms and Connection with False-name-proofness'' International conference

    Taiki Todo, Atsushi Iwasaki and Makoto Yokoo

    2009.12 

    　More details

    Event date： 2009.12

    Language：English  

    Country：Italy  

  • Single　Agent　Optimal Pricing under Market Uncertainty by Using POMDP International conference

    Dong Hao, 岩﨑 敦, 横尾 真, Yong Joon, 神取　道宏, 小原　一郎

    International Joint Agent Workshop and Symposium2012（IJAWS-2012）  2012.10 

    　More details

    Language：English  

    Venue：静岡県掛川市   Country：Japan  

  • Soft Nonlinearity Constraints and their Lower-Arity Decomposition International conference

    Venkatesh Ramamoorthy, Marius C. Silaghi, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo

    11th Workshop on Preferences and Soft Constraints (SofT-11)Held in conjunction with CP-2011  2011.9 

    　More details

    Language：English  

    Country：Italy  

  • Strategy-proof Mechanisms for two-sided Matching with Minimum and Maximum Quotas International conference

    Suguru Ueda, Daniel Fragiadakis, Atsushi Iwasaki, Peter Troyan, Makoto Yokoo

    The eleventh International Conference on Auto-nomous Agents and Multiagent Systems(AAMAS-2012)  2012.6 

    　More details

    Language：English  

    Country：Spain  

  • Automated Equilibrium Analysis of Repeated Games with Private Monitoring: A POMDP Approach International conference

    Yongjoon Joe, Atsushi Iwasaki, Michihiro Kandori, Ichiro Obara, Makoto Yokoo

    The eleventh International Conference on Auto-nomous Agents and Multiagent Systems(AAMAS-2012)  2012.6 

    　More details

    Language：English  

    Country：Spain  

  • 多目的制約最適化問題：ユーザとの対話型解法の提案

    沖本　天太, Yongjoon　Joe, 岩﨑 敦, 横尾 真

    第11回情報科学技術フォーラム（FIT-2012）  2012.9 

    　More details

    Language：Japanese  

    Venue：法政大学   Country：Japan  

  • A Differential Game Theoretic Model for Real-Time Spectrum Princing in Cognitive Radio Networks International conference

    2012.10 

    　More details

    Language：English  

    Country：United States  

  • 多目的分散制約最適化問題における厳密／非厳密解法の提案

    沖本　天太, ジョヨンジュン, 上田　俊, 岩﨑 敦, 櫻井 祐子, 横尾 真, 井上　克巳

    合同エージェントワークショップ＆シンポジウム2012(JAWS-2012)  2012.10 

    　More details

    Language：Japanese  

    Venue：静岡県掛川市   Country：Japan  

  • BnB-ADOPT_P : 分散制約最適化問題におけるハイブリッド型の解法の提案

    沖本　天太, 山本　将, 櫻井 祐子, 横尾 真, 井上　克巳

    合同エージェントワークショップ＆シンポジウム2012（JAWS-2012）  2012.10 

    　More details

    Language：Japanese  

    Venue：静岡県掛川市   Country：Japan  

  • クラウドソーシングにおける品質コントロールの一考察

    櫻井 祐子, 沖本　天太, 岡　雅晃, 兵藤　明彦, 篠田　正人, 横尾 真

    合同エージェントワークショップ＆シンポジウム2012（JAWS-2012）  2012.10 

    　More details

    Language：Japanese  

    Venue：静岡県掛川市   Country：Japan  

  • 正と負の利得が混在するルール集合による協力ゲームの簡略表記法の分析

    橋本　直幸, 大田　直樹, 上田　俊, 岩﨑 敦, 横尾 真

    合同エージェントワークショップ＆シンポジウム2012（JAWS-2012）  2012.10 

    　More details

    Language：Japanese  

    Venue：静岡県掛川市   Country：Japan  

▼display all

MISC

  • Preface

    Yokoo M., Qiao H., Vorobeychik Y., Hao J.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   13824 LNAI   2023   （ ISSN:03029743 ISBN:9783031255489 ）

    　More details

    Publisher：Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  

    Scopus

  • MC-netsを用いた提携構造形成問題のMaxSAT符号化の改良と評価 (特集 「命題論理の充足可能性問題SATの最新動向」および一般)

    越村 三幸, 廖 暁鵑, 野本 一貴, 上田 俊, 櫻井 祐子, 横尾 真

    人工知能基本問題研究会   2018.3

    　More details

    Language：Japanese  

  • MC-netsを用いた提携構造形成問題のMaxSAT符号化の改良

    越村 三幸, 廖 暁鵑, 野本 一貴, 上田 俊, 櫻井 祐子, 横尾 真

    日本ソフトウェア科学会大会論文集   2017.9

    　More details

    Language：Japanese  

  • D-8-13 外部性が存在する提携ゲームのための提携構造形成アルゴリズムの提案(D-8.人工知能と知識処理,一般セッション)

    野本 一貴, 伊原 尚正, 鶴田 俊佑, 櫻井 祐子, 横尾 真

    電子情報通信学会総合大会講演論文集   2016.3

    　More details

    Language：Japanese  

  • RF-003 架空名義操作不可能な再配分メカニズムの特徴付け(F分野:人工知能・ゲーム,査読付き論文,船井ベストペーパー賞受賞論文)

    鶴田 俊佑, 岡 雅晃, 東藤 大樹, 櫻井 祐子, 横尾 真

    情報科学技術フォーラム講演論文集   2014.8

    　More details

    Language：Japanese  

  • RF-002 計算複雑性に基づいたパレート効率的な複数財交換ルール(F分野:人工知能・ゲーム,査読付き論文)

    藤田 悦誌, レスカ ジュリアン, 苑田 尭久, 東藤 大樹, 横尾 真

    情報科学技術フォーラム講演論文集   2014.8

    　More details

    Language：Japanese  

  • 自己充足性を満たすための報酬設定の検討 (人工知能と知識処理)

    岡 雅晃, 東藤 大樹, 櫻井 祐子, 横尾 真

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   2014.6

    　More details

    Language：Japanese  

    本論文ではエージェントの行動予測に対するメカニズム設計の検討を行う.エージェントの行動を正確に予測することは,電力会社やバス会社といった,顧客(エージェント)の需要を満たす必要がある供給者にとって有益である.エージェントが明日の天気など,結果を制御できないイベントを予測する場合,proper scoring ruleは正直に予測を申告する誘因を与えるメカニズムとして知られている.一方,エージェントに自身の行動を予測させる場合,実際に行動を決定するとき,予測と異なった行動を取った場合の方がエージェントの効用が増加する可能性がある.そこで,本研究では,proper scoring ruleがこのような状況においてもエージェントに予測通りに行動を選択する誘因を与えることができるかを検討する.我々は,予測通りに行動を選択することを自己充足と呼ぶ.具体的には,エージェントが自身の期待効用を最大化する申告と行動戦略を見つけることができる場合,任意のproper scoring ruleは自己充足性を満たすことを理論的に示す.

  • RA-007 双対解を用いた提携構造付きコアの非空判定アルゴリズムの高速化(A分野:モデル・アルゴリズム・プログラミング,査読付き論文)

    岩崎 敦, 上田 俊, 横尾 真

    情報科学技術フォーラム講演論文集   2013.8

    　More details

    Language：Japanese  

  • 1-G-8 双対解を用いたコアおよび弱εコア^+の非空判定アルゴリズム(ゲーム理論(1))

    上田 俊, 北木 真, 岩崎 敦, 横尾 真

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2012.9

    　More details

    Language：Japanese  

  • 自動メカニズムデザインを利用した組合せオークションのルール抽出アルゴリズムの提案

    毛利 貴之, 杉町 勇和, 東藤 大樹, 岩崎 敦, 横尾 真

    情報処理学会論文誌   2012.8

    　More details

    Language：Japanese  

    一般に組合せオークションのためのメカニズムは割当て規則と支払い規則の2つの関数によって構成される．メカニズムに関する著名な研究成果として，理論的に優れた性質を持つVickrey-Clarke-Groves（VCG）メカニズムが知られている．しかしながら，VCGメカニズムにはいくつかの問題点があると近年指摘されている．これまでに，その問題に対して頑健性が保証されるメカニズムがいくつか提案されている．従来，これらの関数は人手で設計されてきたが，多大な時間と労力がかかる．そこで近年，整数計画法を利用した自動設計の手法（自動メカニズムデザイン）が提案されている．しかしながら，自動メカニズムデザインは小規模な問題にしか対応できず，現実の問題サイズを扱うことができない．そのため従来研究では，小規模な問題を解き，出力された結果の中から特徴的な結果を抽出し，一般に適用可能なルールを求めようとしている．それでも一般的なルールを得るには人手による部分がまだまだ多い．また，得られたルールが必ずしも適切だとは限らず，別途検証する必要がある．本論文では，自動メカニズムデザインの出力結果から一般的なルールを抽出するアルゴリズムを提案する．具体的には商品の割当て方法や支払額を決定する関数は，あるしきい値を超えているかどうかで勝敗が決まるとし，そのしきい値を出力するアルゴリズムである．Automated mechanism design (AMD) provides a novel scheme to design social choice rules (e.g., combinatorial auction mechanisms) by using mathematical programming technique. However, it only returns a discretized set of outcomes, i.e., allocations and the associated payments given possible type profiles. Therefore, for large combinatorial auction problems, there has been no scheme to effectively generalize a social choice rule for a continuous set of outcomes in the literature of mechanism design. In this paper, we formalize the problem as a rule extraction problem. We then propose a new algorithm to automatically extract a payment rule of a combinatorial auction mechanism from the discretized set of outcomes obtained from AMD. Our experiments reveal that the proposed algorithm successfully extracts payment rules of two existing combinatorial auction mechanisms that is either strategy-proof or false-name-proof.

  • 2011年度論文賞の受賞論文紹介：インターネット時代の市場設計理論の構築へ向けて

    東藤 大樹, 岩崎 敦, 横尾 真

    情報処理   2012.7

    　More details

    Language：Japanese  

  • 1-E-1 無閉路ネットワーク上の架空名義操作不可能な施設配置メカニズムの特徴付け(都市・地域・国土)

    東藤 大樹, 岩崎 敦, 横尾 真

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2011.9

    　More details

    Language：Japanese  

  • 1-I-7 配属人数下限付き研究室配属問題(離散最適化(1))

    上田 俊, 岩崎 敦, 横尾 真

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2011.9

    　More details

    Language：Japanese  

  • A-024 配属人数下限付き研究室配属問題(数理モデル化と問題解決(2),A分野:モデル・アルゴリズム・プログラミング)

    上田 俊, 岩崎 敦, 横尾 真

    情報科学技術フォーラム講演論文集   2011.9

    　More details

    Language：Japanese  

  • RF-001 自動メカニズムデザインを利用した組合せオークションのルール抽出アルゴリズムの提案(船井ベストペーパー賞受賞論文,エージェント,F分野:人工知能・ゲーム)

    毛利 貴之, 杉町 勇和, 東藤 大樹, 岩崎 敦, 横尾 真

    情報科学技術フォーラム講演論文集   2011.9

    　More details

    Language：Japanese  

  • RF-002 架空名義操作不可能な組合せオークションメカニズム : VCGメカニズムの改良(F分野:人工知能・ゲーム,査読付き論文)

    毛利 貴之, 東藤 大樹, 岩崎 敦, 横尾 真

    情報科学技術フォーラム講演論文集   2010.8

    　More details

    Language：Japanese  

  • RA-007 架空名義操作不可能な施設配置メカニズムの特徴付け(A分野:モデル・アルゴリズム・プログラミング,査読付き論文)

    東藤 大樹, 岩崎 敦, 横尾 真

    情報科学技術フォーラム講演論文集   2010.8

    　More details

    Language：Japanese  

  • *-SAT:SATの拡張(<特集>最近のSAT技術の発展)

    平山 勝敏, 横尾 真, Katsutoshi Hirayama, Makoto Yokoo, Graduate School of Maritime Sciences Kobe University, Graduate School of Information Science and Electrical Engineering Kyushu University

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   2010.1

    　More details

    Language：Japanese  

  • 架空名義操作不可能な組合せオークションの割当規則の特性

    東藤 大樹, 岩崎 敦, 横尾 真, 櫻井 祐子

    電子情報通信学会論文誌. D, 情報・システム = The IEICE transactions on information and systems (Japanese edition)   2009.11

    　More details

    Language：Japanese  

    メカニズムデザインとは複数の人間/エージェントが何らかの社会的決定をする場合に,社会的に望ましい結果をもたらす相互作用のルール(例えば,割当規則と支払規則)を設計することである.この分野は電子商取引の拡大に伴い,経済学だけでなく,人工知能/エージェント分野でも活発に研究が行われている.特に,電子商取引のための基盤技術としてオークションメカニズムに関する研究が注目されている.その一つに割当規則の実装可能性に関する研究があり,戦略的操作不可能なオークションメカニズムの割当規則が満たすべき性質を吟味している.しかし,複数のメールアドレスなどを用いて不正に利益を増加させる架空名義操作に関する性質はほとんど検討されていない.そこで本論文では,架空名義操作不可能な組合せオークションメカニズムの割当規則が満たすべき性質を提案する.また,提案した性質を用いて,既存の組合せオークションメカニズムが架空名義操作不可能であるかを検証し,架空名義操作不可能であると信じられてきた二つのメカニズムが,実は架空名義操作可能であることを発見した.

  • 2-D-1 数理計画法を用いたメカニズムデザインの自動化 : 架空名義入札に頑健な組合せオークションメカニズムの設計(離散・組合せ最適化(5))

    岩崎 敦, 大森 由総, 東藤 大樹, 横尾 真

    日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集   2009.9

    　More details

    Language：Japanese  

  • 複数財のオークション

    横尾　真

    日本評論社、経済セミナー   2009.9

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • キーワード広告におけるゲーム理論・オークション理論(<特集>Web技術,ビジネスモデルとAI)

    櫻井 祐子, 横尾 真, Yuko Sakurai, Makoto Yokoo

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   2009.7

    　More details

    Language：Japanese  

  • 適切な掲載数を決定するキーワード広告オークションプロトコルの提案(<特集>エージェント)

    櫻井 祐子, 岩崎 敦, 横尾 真, Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo, 日本学術振興会:九州大学大学院システム情報科学研究院, JSPS:Graduate School of ISEE Kyushu University, Graduate School of ISEE Kyushu University, Graduate School of ISEE Kyushu University

    コンピュータソフトウェア = Computer software   2008.10

    　More details

    Language：Japanese  

    現在,Yahoo!やGoogleなどの検索エンジンでは検索結果の周囲に関連した広告が表示される.これら広告の掲載順位を決定するためにオークションが利用されている.既存のキーワード広告オークションでは掲載数は固定されているが,掲載数を入札額に応じて決定することにより,社会的余剰が増加することが予想される.従って,掲載数が可変の場合を対象とした新しいプロトコルを提案する,まず,Vickrey-Clarke-Groves (VCG)メカニズムを適用したプロトコルを提案する.VCGメカニズムは理論的に望ましい性質を持つ一方で,支払額の計算が複雑であるなどの課題がある.そこで,既存プロトコルの一般化第二価格入札(GSP)に基づき,より実践的なプロトコルの独占権付き一般化第二価格入札(GSP-ExR)の提案を行う.具体的には,最高入札者はプレミアムを払うことで独占的に広告を表示させることを可能にする.In a keyword auction, advertisers submit their bids to search keywords and their ads are displayed according the result of the auction when people search the keyword on internet search engines. In existing keyword auctions, the number of slots is determined in advance and the obtained social surplus is not always maximized. Thus, we develop new keyword auction protocols in which the auctioneer can flexibly determine the optimal number of slots which maximizes social surplus. The first protocol is based on the Vickrey-Clarke-Groves (VCG) mechanism. Although this protocol has good theoretical characteristics such as strategy-proofness, determining the payment is quite complicated. The second protocol, which we call the GSP with Exculsive Right (GSP-ExR), eliminates these VCG drawbacks. If the value per click of the highest ranked bidder is large enough, then this bidder can exclusively display his advertisement by paying a premium.

  • 組合せオークションのための架空名義操作不可能なメカニズムの特性

    東藤 大樹, 岩崎 敦, 横尾 真, 櫻井 祐子

    情報処理学会研究報告知能と複雑系（ICS）   2008.10

    　More details

    Language：Japanese  

    メカニズムデザインとは，複数の人間 （エージェント） が何らかの社会的決定をする場合に，社会的に望ましい結果をもたらすような相互作用のルール （割当規則と支払規則） を設計することである．この分野は電子商取引の拡大にともない，経済学だけでなく，人工知能／エージェント分野でも活発に研究が行われている．その中にメカニズムの単調性に関する研究がある．この研究によって，単調性を満たす割当規則さえ見つかれば，メカニズムが戦略的操作不可能となるような支払規則が存在することが示されている （実装可能性） ．しかし，複数のメールアドレスを用いて不正に利益を増加させるといった架空名義操作に関する性質はほとんど検討されていない．そこで本論文では，架空名義操作に対して，割当規則が満たすべき条件を吟味する．その結果，組合せオークションメカニズムが架空名義操作不可能となる支払規則が存在するために割当規則が満たすべき条件を示した．We identify a simple condition called subadditivity, which characterizes false-name-proof allocation rules in combinatorial auctions. An auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of a winner. An auction mechanism is false-name-proof if an agent has no incentive for submitting multiple bids from different identifiers. We prove that a deterministic allocation rule will be false-name-proof (when coupled with an appropriate payment rule) if and only if it satisfies subadditivity condition.

  • 自動メカニズムデザインによる架空名義入札に頑健な組合せオークションメカニズムの構築

    大森由総, 斎藤恭昌, 岩崎 敦, 櫻井 祐子, 横尾 真

    情報処理学会研究報告知能と複雑系（ICS）   2008.10

    　More details

    Language：Japanese  

    本論文では，自動メカニズムデザインを用いて架空名義入札に頑健なオークションメカニズムを構築する新しい手法を提案する．インターネットオークションのような匿名性の高い環境では，架空名義入札と呼ばれる新しい不正行為の危険性が指摘されており，架空名義入札の影響を受けないオークションメカニズムがいくつか提案されているが，まだ決定版といわれるメカニズムは提案されていない．本論文では，最適化手法を用いて社会的に望ましい性質を満たすようメカニズムを自動設計する手法である自動メカニズムデザインを用いることで，新しい架空名義入札に頑健なオークションメカニズムを構築する．また，提案手法が構築したメカニズムと既存のオークションメカニズムを比較する．This paper proposes automated mechanism design, as a mechanism design technique, for false-name-proof combinatorial auctions. Mechanisms have traditionally been designed manually for classes of problems. Sandholm (2003) introduced automated mechanism design, where a mechanism is automatically designed using constrained optimization technique. This paper presents the first attempt for automatically generating a false-name-proof combinatorial auction mechanism. False-name-proofness means that a mechanism is not influenced by false-name manipulations that submitted by a single buyer who uses multiple fictitious names such as multiple e-mail addresses. Then, we show that our technique yields an auction mechanism which has better outcomes than some existing combinatorial auction mechanisms.

  • 非準線形効用を対象とした架空名義入札に頑健な複数ユニットオークションプロトコルの提案

    櫻井 祐子, 斉藤 恭昌, 岩崎 敦, 横尾 真

    電子情報通信学会技術研究報告. AI, 人工知能と知識処理   2007.12

    　More details

    Language：Japanese  

    従来のオークション研究のほとんどは,入札者の効用を準線形を仮定して議論している.例外として,予算制約に関する研究が存在するだけである.誘因両立性を満たすプロトコルとして有名なVCGプロトコルは準線形効用の場合しか適用をすることができないと考えられていた.本論文では,社会的な効率性を若干犠牲にすることにより,非準線形効用の場合でもVCGを改良したプロトコルが利用可能であることを示す.さらに,我々は,インターーネット環境で深刻な問題となりえる架空名義入札に着目し,公開競上げ式の架空名義入札に頑健なオークションプロトコル(NQ-AOP)の提案を行う.

  • 適切な掲載数を決定するキーワード広告オークションの提案

    櫻井 祐子, 岩崎 敦, 横尾 真

    情報処理学会研究報告知能と複雑系（ICS）   2007.10

    　More details

    Language：Japanese  

    現在，Yahoo! や Google などの検索エンジンでは検索結果の周囲に関連した広告が表示される．このような広告の掲載位置を決定するためにオークションが利用されている．既存のキーワード広告オークションは掲載数は固定されているが，掲載数を入札額に応じて変動させた方が社会的に望ましいと考える．そこで，掲載数が可変のとき，既存プロトコルを適用した場合の問題点とその解決策を示す．In a keyword auction, advertisers submit their bids to search keywords and their ads are displayed according the result of the auction when people search the keyword on internet search engines. In existing keyword auctions, the number of slots is determined in advance and the obtained social surplus is not always maximized. Thus, we develop new keyword auction protocols in which the auctioneer can flexibly determine the optimal number of slots which maximizes social surplus. First, we propose an auction protocol based on the Vickrey-Clarke-Groves mechanism. While the VCG can satisfy theoretically good characteristics, it needs the complicated calculation of payment. Therefore, we propose a practical protocol based on existing auction protocol applied in Google and Yahoo!

  • 生まれは同じ、育ちが違う兄弟

    横尾　真、岩崎　敦

    日本評論社、ゲーム理論プラス（経済セミナー増刊）   2007.6

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • インターネットオークションとメカニズムデザイン

    横尾真，岩崎敦

    情報処理学会学会誌   2007.3

    　More details

    Language：Japanese   Publishing type：Article, review, commentary, editorial, etc. (scientific journal)  

  • 任意の評価値に対する架空名義入札に頑健なダブルオークションプロトコル

    櫻井 祐子, 横尾 真

    人工知能学会論文誌 = Transactions of the Japanese Society for Artificial Intelligence : AI   2004.11

    　More details

    Language：Japanese  

    DOI： 10.1145/860575.860629

  • 分散・協調AI

    情報処理学会論文誌   2004.9

    　More details

    Language：English  

    We first present an algorithm called multi-ABT as a baseline algorithm for solving distributed constraint satisfaction problems where each agent has multiple local variables. Then we show a cost profile of multi-ABT for various numbers of intra-agent constraints (constraints defined over variables of one agent) and inter-agent constraints (constraints defined over variables of multiple agents) in a distributed graph-coloring problem. This cost profile enabled us to make the following observations: (1) the satisfiability thresholds are identified in the narrow region on the x-y plane (where the x-axis is the number of intra-agent constraints and the y-axis is the number of inter-agent constraints) in which the sum of intra- and inter-agent constraints is constant and problem instances in the region (called the crossover belt) are likely to be expensive in terms of the median cost; (2) among problem instances on the crossover belt those with a smaller number of intra-agent constraints and a larger number of inter-agent constraints may be more expensive; and (3) for a fixed total number of variables problem instances on the crossover belt may be more expensive as the number of agents increases or the number of variables per agent decreases. Our further experiments suggest that these observations can be generalized to cases where different algorithms are applied or different sets of parameters of the problem are used.We first present an algorithm called multi-ABT as a baseline algorithm for solving distributed constraint satisfaction problems where each agent has multiple local variables. Then, we show a cost profile of multi-ABT for various numbers of intra-agent constraints (constraints defined over variables of one agent) and inter-agent constraints (constraints defined over variables of multiple agents) in a distributed graph-coloring problem. This cost profile enabled us to make the following observations: (1) the satisfiability thresholds are identified in the narrow region on the x-y plane (where the x-axis is the number of intra-agent constraints and the y-axis is the number of inter-agent constraints) in which the sum of intra- and inter-agent constraints is constant, and problem instances in the region (called the crossover belt) are likely to be expensive in terms of the median cost; (2) among problem instances on the crossover belt, those with a smaller number of intra-agent constraints and a larger number of inter-agent constraints may be more expensive; and (3) for a fixed total number of variables, problem instances on the crossover belt may be more expensive as the number of agents increases or the number of variables per agent decreases. Our further experiments suggest that these observations can be generalized to cases where different algorithms are applied or different sets of parameters of the problem are used.

  • 平均的に予算非負なダブルオークションプロトコル

    櫻井 祐子, 横尾 真

    人工知能学会論文誌 = Transactions of the Japanese Society for Artificial Intelligence : AI   2003.11

    　More details

    Language：Japanese  

    DOI： 10.1145/544741.544769

  • 架空名義入札に頑健な組合せオークションプロトコルにおけるバンドルの設計方法

    横尾 真, 櫻井 祐子, 松原 繁夫, Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara, 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, 日本電信電話株式会社NTTコミュニケーション科学基礎研究所, NTT Communication, Science Laboratories, NTT Communication, Science Laboratories, NTT Communication, Science Laboratories

    コンピュータソフトウェア = Computer software   2003.7

    　More details

    Language：Japanese  

    本論文では,インターネットオークションで深刻な問題となり得る架空名義入札に対して,頑健性が保証される組合せオークションプロトコルの実現方法について検討する.インターネットを利用することにより低コストで大規模なオークションが可能となった一方で,ネットワークでの匿名性を利用した新しいタイプの不正行為が問題となる.このような不正行為の1つとして,単一のエージェントが,複数の名義を用いて入札を行う架空名義入札が存在する.複数種類の商品を扱う組合せオークションにおいて,架空名義入札に対して頑健なプロトコルとして,レベル付き分割セットプロトコル(LDSプロトコル)が提案されている.しかしながら,LDSプロトコルではオークションの主催者がレベル付き分割セットと呼ばれる一連の財のバンドルの組合せを決定しなければならない.良い社会的余剰を得られるようにレベル付き分割セットを設計することは,組合せオークションにおける勝者決定問題よりもはるかに複雑な最適化問題となる.本論文では良い社会的余剰を得ることができるレベル付き分割セットを設計するためのヒューリスティックな手法を提案する.この手法は勝者決定アルゴリズムを主要な構成要素として,目的とするバンドルの組合せを元に,レベル付き分割セットを構成する.計算機シミュレーションを用いて,提案手法により,パレート効率的な社会的余剰に非常に近い結果が得られることを示す.

  • 架空名義入札に頑健な組合せオークションプロトコル

    横尾 真, 櫻井 祐子, 松原 繁夫

    情報処理学会論文誌   2002.6

    　More details

    Language：Japanese  

    本論文では，インターネットオークションで深刻な問題となりうる架空名義入札に対して，頑健性が保証される新しい組合せオークションプロトコルを提案する．インターネットを利用することにより低コストで大規模なオークションが可能となった一方で，ネットワークでの匿名性を利用した新しいタイプの不正行為が問題となる．このような不正行為の1つとして，単一のエージェントが，複数の名義を用いて入札を行う架空名義入札が存在する．従来，架空名義入札が存在しない場合には，一般化Vickreyオークション（GVA）により，支配戦略において誘因両立性，パレート効率性，個人合理性が保証されることが知られている．一方，複数財の組合せオークションにおいて架空名義入札が可能な場合には，GVAのみならず，どのようなオークションメカニズムをもってしても，すべての場合において，誘因両立性，パレート効率性，個人合理性を同時に満たすものは存在しないことが示されている．本論文で提案するレベル付分割セットプロトコルは，財の留保価格を用いて，財をまとめて売るか，個別に売るかの判断をする点が特徴であり，パレート効率性は保証できないが，誘因両立性，個人合理性を満たす．シミュレーションを用いて，本プロトコルで適切な留保価格を設定した場合に，すべての財をまとめて売るプロトコルと比較して，より良い社会的余剰が得られることを示す．This paper presents a new combinatorial auction protocolthat is robust against false-name bids.Internet auctions have become an integral part ofElectronic Commerce (EC) anda promising field for applying agent and Artificial Intelligencetechnologies.Although theInternet provides an excellent infrastructure for combinatorialauctions, we must consider the possibility of anew type of cheating, i.e., an agent tries to profit fromsubmitting several bids under fictitious names (false-name bids).If there exists no false-name bid,the generalized Vickrey auction protocol (GVA) satisfiesindividual rationality, Pareto efficiency, and incentive compatibility.On the other hand, when false-name bids are possible,it is theoretically impossible for any combinatorialauction protocol to simultaneously satisfythese three properties in all cases.Our newly developed Leveled Division Set (LDS) protocol, which is a modification of theGVA, utilizes reservation pricesof auctioned goods for making decisions on whether to sell goods in a bundle orseparately.The LDS protocol satisfiesindividual rationality and incentive compatibility, although it is notguaranteed to achieve a Pareto efficient social surplus.Simulation results show that the LDS protocol can achieve a better socialsurplus than that for a protocol that always sells goods in a bundle.

  • 組合せオークションの高速な準最適勝者決定アルゴリズム

    櫻井 祐子, 横尾 真, 亀井 剛次

    人工知能学会論文誌 = Transactions of the Japanese Society for Artificial Intelligence : AI   2001.11

    　More details

    Language：Japanese  

    This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions, which is based on limited discrepancy search (LDS). Internet auctions have become an integral part of Electronic Commerce and can incorporate large-scale, complicated types of auctions including combinatorial auctions, where multiple items are sold simultaneously and bidders can express complementarity among these items. Although we can increase participants&amp;rsquo; utilities by using combinatorial auctions, determining the optimal winners is a complicated constraint optimization problem that is shown to be NP-complete. We introduce the idea of LDS to an existing algorithm based on A*. The merit of LDS is that it can avoid time-consuming re-computation of heuristic function h(&amp;middot;), since LDS is less sensitive to the quality of h(&amp;middot;). It can also limit the search efforts only to promising regions. Experiments using various problem settings show that, compared with the existing optimal algorithm, LDS can find near-optimal solutions (better than 95&#37;) very quickly (around 1&#37; of the running time).

    DOI： 10.1007/3-540-45349-0_47

  • 架空名義入札に頑健なダブルオークションプロトコル

    横尾 真, 櫻井 祐子, 松原 繁夫

    電子情報通信学会論文誌. D-1, 情報・システム 1-情報処理   2001.8

    　More details

    Language：Japanese  

    オークションは急成長している電子商取引の重要な一分野であり, ソフトウェアエージェント技術の有望な適用領域であると考えられる. インターネットを利用することにより低コストで大規模なオークションが可能となった一方で, ネットワークでの匿名性を利用した新しいタイプの不正行為が問題となる. 本論文では, このような不正行為の一つである架空名義入札に対して頑健性が保証される, 新しいダブルオークションプロトコルを提案する. ダブルオークションは買手/売手の双方が複数存在し入札を行うオークションであり, 外貨, 証券, 株等の取引に広く用いられている. 従来, 架空名義入札が存在しない場合には, 支配戦略において誘因両立的であるダブルオークションプロトコル(PMDプロトコル)が提案されている. 一方, 売手が別の名義を用いて, 買手になりすまして入札を行うといった架空名義入札の可能性を考えると, PMDプロトコルでは, 入札者は架空名義入札によって利益を増やすことが可能であり, 誘因両立性は保証されない. 本論文では, 架空名義入札が可能な場合でも, 支配戦略において誘因両立的である, しきい値価格ダブルオークションプロトコル(Threshold Price Double auction protocol, TPD)を提案する. TPDプロトコルの特徴は, 財のしきい値価格を用いて可能な取引の数及び取引価格を制御することである. シミュレーションを用いた実験結果を用いて, 適切なしきい値価格を設定することにより, TPDプロトコルでパレート効率的な割当てに非常に近い社会的余剰が得られることを示す.

  • ACM EC-00参加報告

    櫻井 祐子, 横尾 真, Yuko Sakurai, Makoto Yokoo

    コンピュータソフトウェア = Computer software   2001.5

    　More details

    Language：Japanese  

  • "Trends of Internet Auctions and Agent-mediated Web Commerce''

    Makoto Yokoo and Satoru Fujita

    New Generation computing   2001.1

    　More details

    Language：English  

  • 架空名義入札に頑健な組合せオークションプロトコル

    横尾 真, 櫻井 祐子, 松原 繁夫

    人工知能学会全国大会論文集 = Proceedings of the Annual Conference of JSAI   2000.7

    　More details

    Language：Japanese  

  • 制約充足テクニックを用いた移動体通信の周波数割当問題の解法

    横尾 真, 平山 勝敏

    情報処理学会論文誌   2000.4

    　More details

    Language：Japanese  

    本論文では移動体通信の周波数割当問題を，制約充足テクニックを用いて解く新しい手法を提案する．本手法の特徴は以下のとおりである：1)各要求を変数として表現するのではなく，同じセルに属する複数の要求をとりまとめて，非常に大きな領域を持つ1つの変数として表現し，この変数の値を段階的に決定する，2)フォワードチェッキングを取り入れた分枝限定法による探索を行う，3)セルの順序付けに強力なヒューリスティックスを用いる，4) limited discrepancy探索のような最新の探索手法を用いる．標準的なベンチマークを用いた実験的な評価により，本手法により最適解，もしくは最適解に非常に近い準最適解が得られることが示された．得られた解の品質は，ほとんどの場合，既存の焼きなまし法やタブー探索，ニューラルネットワークによる解法と同等か優れている．本研究により，適切な問題の表現およびヒューリスティックスとともに用いられた場合，最新の制約充足テクニックは，現実的な応用問題を解く十分な能力があることが示された．This paper presents a new algorithm for solving frequency assignment problemsin cellular mobile systems using constraint satisfaction techniques.The characteristics of this algorithm are as follows:1) instead of representing each call in a cell(a unit area in providing communication services) as a variable,we represent a cell (which has multiple calls) as a variable that has a very large domain,and determine a variable value step by step,2) a branch-and-bound search that incorporates forward-checking is performed,3) a powerful cell-ordering heuristic is introduced,and 4) the limited discrepancy search is introduced to improve the chance of findinga solution in a limited amount of search.Experimental evaluations using standard benchmark problems show thatthis algorithm can find optimal or semi-optimal solutions for these problems,and most of the obtained solutions are better than or equivalent to those ofexisting methods using simulated annealing, tabu search, or neural networks.These results show that state-of-the-art constraint satisfaction/optimizationtechniques are capable of solving realistic application problemswhen equipped with an appropriate problem representation and heuristics.

  • 複雑な局所問題に対応する分散制約充足アルゴリズム

    横尾 真, 平山 勝敏, Makoto Yokoo, Katsutoshi Hirayama, Kobe University of Mercantile Marine.

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   2000.3

    　More details

    Language：English  

    A distributed constraint satisfaction problem can formalize various application problems in Multiagent systems, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems.We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.

    DOI： 10.1109/ICMAS.1998.699222

  • 分散制約充足におけるnogood学習の効果

    平山 勝敏, 横尾 真, Katsutoshi Hirayama, Makoto Yokoo, Kobe University of Mercantile Marine., NTT Communication Science Laboratories.

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   2000.3

    　More details

    Language：English  

    We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in the CSP literature and can efficiently make effective nogoods.We combine the method with the asynchronous weak-commitment search algorithm (AWC) and evaluate the performance of the resultant algorithm on distributed 3-coloring problems and distributed 3SAT problems. As a result, we found that the resolvent-based learning works well compared to previous learning methods for distributed constraint satisfaction algorithms. We also found that the AWC with the resolvent-based learning is able to find a solution with fewer cycles than the distributed breakout algorithm, which was known to be the most efficient algorithm (in terms of cycles) for solving distributed CSPs.

    DOI： 10.1109/ICDCS.2000.840919

  • インターネットオークションの理論と応用

    横尾　真

    人工知能学会誌   2000.1

    　More details

    Language：Japanese  

  • 分散不完全制約充足問題

    平山 勝敏, 横尾 真, Katsutoshi Hirayama, Makoto Yokoo, NTTC ommunication Science Laboratories

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   1999.7

    　More details

    Language：Japanese  

    Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to find a set of assignments to variables that satisfies all constraints among agents. However, when real-life problems are formalized as distributed CSPs, they are often over-constrained and have no solution that satisfies all constraints. This paper provides the Distributed Partial Constraint Satisfaction Problem (DPCSP) as a new framework for dealing with over-constrained situations. We also present new algorithms for solving Distributed Maxima1 Constraint Satisfaction Problems (DMCSPs), which belong to an important class of DPCSP. These algorithms are called the Synchronous Branch and Bound (SBB) and the Iterative Distributed Breakout (IDB). Both algorithms were tested on hard classes of over-constrained random binary distributed CSPs. The results can be summarized as SBB is preferable when we are mainly concerned with the optimality of a solution, while IDB is preferable when we want to get a nearly optimal solution quickly.

  • 電子商取引における一般化Vickreyオークションの問題点 : 架空名義入札に対する頑健性

    櫻井 祐子, 横尾 真, 松原 繁夫

    人工知能学会全国大会論文集 = Proceedings of the Annual Conference of JSAI   1999.6

    　More details

    Language：Japanese  

  • 制約充足テクニックを用いた移動体通信の周波数割当問題の解法

    横尾 真, 平山 勝敏

    人工知能学会全国大会論文集 = Proceedings of the Annual Conference of JSAI   1999.6

    　More details

    Language：Japanese  

  • 分散breakout：反復改善型分散制約充足アルゴリズム

    横尾 真, 平山 勝敏

    情報処理学会論文誌   1998.6

    　More details

    Language：Japanese  

    本論文では分散制約充足問題を解くための新しいアルゴリズムである分散breakoutアルゴリズムを提案する．本アルゴリズムは集中型の制約充足問題を解くための反復改善型のアルゴリズムであるbreakoutアルゴリズムに触発されたものであり，各エージェントは近傍のエージェントと現在の変数の値の割当，可能な改善法を交換し，エージェント全体として制約条件違反の個数が減少するように値の変更を行う．また，エージェント全体として局所最適に陥ったことを検出するのではなく，近傍との通信のみで検出できる，より弱い条件である準局所最適を検出し，制約の重みを変更することにより準局所最適から脱出する．実験的な評価により，本アルゴリズムはグラフの色塗り問題の非常に難しい問題のインスタンスに関して既存のアルゴリズムより効率的であることを示す．This paper presents a new algorihm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributed breakout algorithm,which is inspired by the breakout algorithm for solving centralized CSPs.In this algorithm,each agent tries to optimize its evaluation value (the number of constraint violations) by exchanging its current value and the possible amount of its improvement among neighboring agents.Instead of detecting the fact that agents as a whole are trapped in a local-minimum,each agent detects whether it is in a quasi-local-minimum,which is a weaker condition than a local-minimum,and changes the weights of constraint violations to escape from the quasi-local-minimum.Experimental evaluations show this algorithm to be much more efficient than existing algorithms for critically difficult (phase transition) problem instances of distributed graph-coloring problems.

  • CSPの新しい展開 : 分散/動的/不完全CSP (<特集> 制約充足問題の基礎と応用)

    横尾 真, 平山 勝敏, Makoto Yokoo, Katsutoshi Hirayama, NTT Communication Science Laboratories, Kobe University of Mercantile Marine

    人工知能学会誌 = Journal of Japanese Society for Artificial Intelligence   1997.5

    　More details

    Language：Japanese  

  • Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems

    Yokoo Makoto, Hirayama Katsutoshi

    1997.3

    　More details

    Language：English  

    Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems

▼display all

Professional Memberships

  • 電子情報通信学会

  • 日本ソフトウェア科学会

  • 情報処理学会

  • 人工知能学会

  • American Association for Artificial Intelligence(AAAI)

Committee Memberships

  • International Foundations of Autonomous Agents and Multiagent Systems (IFAAMAS)   Executive   Foreign country

    2013.8 - 2015.5   

  • International Foundations of Autonomous Agents and Multiagent Systems (IFAAMAS)   Executive head   Foreign country

    2011.7 - 2013.7   

  • Councilor   Domestic

    2010.4 - 2012.3   

  • Executive   Domestic

    2006.6 - 2008.5   

  • International Foundations of Autonomous Agents and Multiagent Systems (IFAAMAS)   Executive   Foreign country

    2004.5 - 2006.4   

  • Executive   Domestic

    2004.1 - 2008.6   

  • Association for the Advancement of Artificial Intelligence (AAAI)   Executive   Foreign country

    2001.7 - 2014.7   

  • International Foundations of Multiagent Systems (IFMAS)   Executive   Foreign country

    2000.7 - 2004.7   

▼display all

Academic Activities

  • プログラム委員 International contribution

    2022.5

    　More details

    Type：Competition, symposium, etc. 

  • 領域アドバイザー

    Role(s)： Review, evaluation

    科学技術振興機構  2022.4 - 2027.3

    　More details

    Type：Scientific advice/Review 

  • 領域委員長 International contribution

    2021.8

    　More details

    Type：Competition, symposium, etc. 

  • 外部専門家

    Role(s)： Review, evaluation

    科学技術振興機構  2021.6 - 2022.3

    　More details

    Type：Scientific advice/Review 

  • プログラム委員 International contribution

    （ オンライン ） 2021.5

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2021.2

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    （ オンライン ） 2020.11

    　More details

    Type：Competition, symposium, etc. 

  • 外部専門家

    Role(s)： Review, evaluation

    科学技術振興機構  2020.7 - 2020.11

    　More details

    Type：Scientific advice/Review 

  • 領域アドバイザー

    Role(s)： Review, evaluation

    科学技術振興機構  2020.6 - 2022.3

    　More details

    Type：Scientific advice/Review 

  • 領域委員長 International contribution

    2020.5

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2020.2

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2019.5

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    （ Stockholmsmässan(Stockholm) ） 2018.7

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    （ Stockholmsmässan（Stockholm) ） 2018.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    （ WTC Sheraton（Sao Paulo) ） 2017.5

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2016.7

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    （ Grand Copthorne Waterfront Hotel Singapore（Singapore) ） 2016.5

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2015.7

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2015.5

    　More details

    Type：Competition, symposium, etc. 

  • Artificial Intelligence Journal International contribution

    2015.4 - 2018.3

    　More details

    Type：Academic society, research group, etc. 

  • 科学研究費委員会専門委員

    Role(s)： Review, evaluation

    日本学術振興会  2014.12 - 2016.11

    　More details

    Type：Scientific advice/Review 

  • プログラム委員 International contribution

    （ Québec Convention Center (Wuebec) ） 2014.7

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2013.8

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2013.5

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2012.7

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2012.6

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2011.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2011.5

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2010.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2010.5

    　More details

    Type：Competition, symposium, etc. 

  • 特別研究員等審査会専門委員

    Role(s)： Review, evaluation

    日本学術振興会  2010.4 - 2012.3

    　More details

    Type：Scientific advice/Review 

  • General Chair International contribution

    The 12th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2009)  （ Japan ） 2009.12

    　More details

    Type：Competition, symposium, etc. 

  • 領域委員長 International contribution

    2009.7

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2009.5

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2008.9

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2008.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員長

    第22回 人工知能学会全国大会  （ ときわ市民ホール／勤労者福祉総合センター（北海道旭川市） ） 2008.6 - 2009.6

    　More details

    Type：Competition, symposium, etc. 

    Number of participants：600

  • シニアプログラム委員 International contribution

    2008.5

    　More details

    Type：Competition, symposium, etc. 

  • Artificial Intelligence Journal International contribution

    2008.4 - 2015.3

    　More details

    Type：Academic society, research group, etc. 

  • General Chair International contribution

    The Sixth International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2007)  （ Hawaii Convention Center (Honolulu,Hawaii) UnitedStatesofAmerica ） 2007.5

    　More details

    Type：Competition, symposium, etc. 

    Number of participants：500

  • プログラム委員 International contribution

    2007.1

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員長 International contribution

    2006.12

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2006.9

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2006.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2006.5

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2005.7 - 2005.8

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2005.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2005.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2004.7

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2004.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2003.9 - 2003.10

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2003.8

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員長 International contribution

    2003.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2002.9

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2002.7 - 2002.8

    　More details

    Type：Competition, symposium, etc. 

  • シニアプログラム委員 International contribution

    2002.7

    　More details

    Type：Competition, symposium, etc. 

  • Journal of Artificial Intelligence Research International contribution

    2002.1 - 2001.12

    　More details

    Type：Academic society, research group, etc. 

  • プログラム委員 International contribution

    2001.11 - 2001.12

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2001.8

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員長 International contribution

    2001.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2001.5 - 2001.6

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2000.9

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    2000.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    1999.5

    　More details

    Type：Competition, symposium, etc. 

  • Journal of Artificial Intelligence Research International contribution

    1999.1 - 2001.12

    　More details

    Type：Academic society, research group, etc. 

  • プログラム委員 International contribution

    1998.10

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    1998.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    1998.7

    　More details

    Type：Competition, symposium, etc. 

  • プログラム委員 International contribution

    1996.8

    　More details

    Type：Competition, symposium, etc. 

▼display all

Research Projects

  • 小島マーケットデザインプロジェクト，計算機科学グループリーダー

    2023 - 2028

    JST ERATO

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Contract research

  • Challenge to Sigma-2P complete problems: moving up in the polynomial hierarchy

    Grant number：22K19813  2022 - 2023

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Challenging Research(Exploratory)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

    CiNii Research

  • Advancing Social Science through Market Design and its Practical Implementation

    Grant number：21H04979  2021.7 - 2026.3

    Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (S)

    　 More details

    Grant type：Scientific research funding

    CiNii Research

  • モビリティのためのアルゴリズム論の研究

    2020.4 - 2023.3

    京都大学（日本） 

    　 More details

    Authorship：Coinvestigator(s) 

  • 科研費 基盤A「インセンティブ設計科学の創出」

    2020.4 - 2023.3

    九州大学（日本） 

    　 More details

    Authorship：Principal investigator 

  • Creation of Incentive Design Science

    Grant number：20H00609  2020 - 2022

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (A)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

    CiNii Research

  • マルチエージェント基礎理論の社会システム設計への応用

    2019.8 - 2020.3

    共同研究

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • マルチエージェント基礎理論の社会システム設計への応用

    2018.6 - 2019.3

    共同研究

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 科研費 基盤B「自己組織化クラウドソーシングのためのメカニズム設計」

    2018.4 - 2023.3

    産業技術総合研究所（日本） 

    　 More details

    Authorship：Coinvestigator(s) 

  • Mechanism Design for Self-Organized Crowdsourcing

    Grant number：18H03299  2018 - 2022

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

    CiNii Research

  • マルチエージェント基礎理論の社会システム設計への応用

    2017.10 - 2018.3

    共同研究

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 制約付きマッチングメカニズムの理論的基盤の確立

    2017.9 - 2018.3

    共同研究

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 科研費 基盤A「マーケットデザインの実践的理論の構築」

    2017.4

    九州大学 

    　 More details

    Authorship：Principal investigator 

  • マーケットデザインの実践的理論の構築

    Grant number：17H00761  2017 - 2019

    日本学術振興会  科学研究費助成事業  基盤研究(A)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • JST国際科学技術共同研究推進事業：SICORP, Resilient Human-in-the-loop Multi-agent Optimization International coauthorship

    2016.12 - 2020.3

    九州大学 

    　 More details

    Authorship：Principal investigator 

  • エージェント応用

    2016.10 - 2017.3

    共同研究

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Other funds from industry-academia collaboration

  • 人間を系に含むマルチエージェントレジリエント最適化

    2016 - 2019

    戦略的国際共同研究プログラム（科学技術振興機構)

    　 More details

    Authorship：Principal investigator  Grant type：Contract research

  • システム情報科学研究院研究資金

    2016

    　 More details

    Grant type：Donation

  • システム情報科学研究院研究資金

    2016

    　 More details

    Grant type：Donation

  • クラウドソーシングのためのヒューマンセントリックメカニズム設計理論の構築

    Grant number：15H02751  2015 - 2017

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • システム情報科学研究院研究資金

    2015

    　 More details

    Grant type：Donation

  • システム情報科学研究院研究資金

    2015

    　 More details

    Grant type：Donation

  • ソフトウェアエコシステムの理論構築と実践を加速する分野横断国際ネットワークの構築 International coauthorship

    2014.10 - 2017.3

    奈良先端科学技術大学院大学 

    　 More details

    Authorship：Collaborating Investigator(s) (not designated on Grant-in-Aid) 

  • ソフトウェアエコシステムの理論構築と実践を加速する分野横断国際ネットワークの構築

    2014 - 2016

    日本学術振興会  頭脳循環を加速する戦略的国際研究ネットワーク推進プログラム

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Joint research

  • 限量子消去法を用いたパラメトリックメカニズム設計技術の確立

    Grant number：26540118  2014 - 2015

    科学研究費助成事業  萌芽研究

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • システム情報科学研究院研究資金

    2014

    　 More details

    Grant type：Donation

  • システム情報科学研究院研究資金

    2013

    　 More details

    Grant type：Donation

  • 科研費 基盤Ｓ「持続可能な発展のための資源配分メカニズム設計理論の構築」

    2012.10 - 2017.3

    九州大学(日本） 

    　 More details

    Authorship：Principal investigator 

  • 持続可能な発展のための資源配分メカニズム設計理論の構築

    Grant number：24220003  2012 - 2016

    日本学術振興会  科学研究費助成事業  基盤研究(S)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • システム情報科学研究院研究資金

    2012

    　 More details

    Grant type：Donation

  • 分散グリーンコンピューティング：分散最適化技術の環境関連問題への応用

    Grant number：23300060  2011 - 2013

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 談合の影響を受け難い組合せ調達メカニズムとその調整技術の開発

    Grant number：23500184  2011 - 2013

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • コンパクトな論理記述に基づく協力ゲーム理論の再構築

    Grant number：23500167  2011 - 2013

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 最適化と法則発見を用いた集団合意形成ルールの自動設計

    Grant number：23650073  2011 - 2012

    科学研究費助成事業  挑戦的萌芽研究

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • システム情報科学研究院研究資金

    2011

    　 More details

    Grant type：Donation

  • システム情報科学研究院研究資金

    2010

    　 More details

    Grant type：Donation

  • 制約プログラミングの研究

    2009.4 - 2010.3

    共同研究

    　 More details

    Grant type：Other funds from industry-academia collaboration

  • システム情報科学研究院研究資金

    2009

    　 More details

    Grant type：Donation

  • 情報ネットワーク経済のためのメカニズム設計理論の確立

    Grant number：20240015  2008 - 2012

    日本学術振興会  科学研究費助成事業  基盤研究(A)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • 制約最適化問題のＳＡＴ変換による解法とその並列分散処理に関する研究

    Grant number：20240003  2008 - 2011

    日本学術振興会  科学研究費助成事業  基盤研究(A)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • システム情報科学研究院研究資金

    2008

    　 More details

    Grant type：Donation

  • ユビキタス時代における次世代型電子商取引システムのための基盤技術

    Grant number：19300048  2007 - 2010

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 開環境での協力ゲームにおける新しい解概念の提案

    Grant number：19650004  2007 - 2008

    科学研究費助成事業  萌芽研究

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • 計算論的メカニズムデザインに基づくe-ビジネス支援機構の設計と実装

    Grant number：18300049  2006 - 2009

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 情報財の流通／取引メカニズムの設計に関する企画調査

    Grant number：18630004  2006

    日本学術振興会  科学研究費助成事業  基盤研究(C)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • ソフトウェアエージェントに基づく電子商取引メカニズムの設計と実装

    Grant number：17300046  2005 - 2008

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 耐久消費財リサイクル市場の構造分析と制度設計

    Grant number：17310029  2005 - 2008

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Scientific research funding

  • 不正行為に頑健なインターネットオークションプロトコルの設計と評価

    Grant number：17300049  2005 - 2007

    日本学術振興会  科学研究費助成事業  基盤研究(B)

    　 More details

    Authorship：Principal investigator  Grant type：Scientific research funding

  • 研究調査助成

    2005

    　 More details

    Grant type：Donation

  • 情報経済学に関する研究

    2004.4 - 2005.3

    共同研究

    　 More details

    Authorship：Principal investigator  Grant type：Other funds from industry-academia collaboration

  • 人工知能研究助成

    2004

    　 More details

    Grant type：Donation

▼display all

Award for Educational Activities

  • 九州大学工学講義賞（平成28年度）

       

Class subject

  • データ構造とアルゴリズムⅡ（CM）

    2023.6 - 2023.8   Summer quarter

  • Game Theory II

    2023.6 - 2023.8   Summer quarter

  • ゲーム理論Ⅱ

    2023.6 - 2023.8   Summer quarter

  • データ構造とアルゴリズムⅡＢ

    2023.6 - 2023.8   Summer quarter

  • データ構造とアルゴリズムⅣ

    2023.6 - 2023.8   Summer quarter

  • データ構造とアルゴリズムⅠB（C）

    2023.6 - 2023.8   Summer quarter

  • 【通年】情報理工学講究

    2023.4 - 2024.3   Full year

  • 【通年】情報理工学演習

    2023.4 - 2024.3   Full year

  • 【通年】情報理工学研究Ⅰ

    2023.4 - 2024.3   Full year

  • 情報理工学論議Ⅰ

    2023.4 - 2023.9   First semester

  • 情報理工学論述Ⅰ

    2023.4 - 2023.9   First semester

  • 情報理工学読解

    2023.4 - 2023.9   First semester

  • ゲーム理論

    2023.4 - 2023.9   First semester

  • データ構造とアルゴリズムⅠ（CM）

    2023.4 - 2023.6   Spring quarter

  • Game Theory I

    2023.4 - 2023.6   Spring quarter

  • ゲーム理論Ⅰ

    2023.4 - 2023.6   Spring quarter

  • データ構造とアルゴリズムⅡＡ

    2023.4 - 2023.6   Spring quarter

  • データ構造とアルゴリズムⅢ

    2023.4 - 2023.6   Spring quarter

  • データ構造とアルゴリズムⅠA（C）

    2023.4 - 2023.6   Spring quarter

  • Game Theory II

    2022.6 - 2022.8   Summer quarter

  • データ構造とアルゴリズムⅡ（CM）

    2022.6 - 2022.8   Summer quarter

  • データ構造とアルゴリズムⅡＢ

    2022.6 - 2022.8   Summer quarter

  • データ構造とアルゴリズムⅠB（C）

    2022.6 - 2022.8   Summer quarter

  • ゲーム理論Ⅱ

    2022.6 - 2022.8   Summer quarter

  • 情報理工学研究Ⅰ

    2022.4 - 2023.3   Full year

  • 情報理工学演習

    2022.4 - 2023.3   Full year

  • 情報理工学講究

    2022.4 - 2023.3   Full year

  • Advanced Seminar in Informatics

    2022.4 - 2023.3   Full year

  • Advanced Research in Informatics II

    2022.4 - 2023.3   Full year

  • Advanced Research in Informatics I

    2022.4 - 2023.3   Full year

  • 情報学特別演習

    2022.4 - 2023.3   Full year

  • 情報学特別講究第二

    2022.4 - 2023.3   Full year

  • 情報学特別講究第一

    2022.4 - 2023.3   Full year

  • Advanced Research in Information Semantics

    2022.4 - 2023.3   Full year

  • 情報論理学特別講究

    2022.4 - 2023.3   Full year

  • Advanced Project Management Technique

    2022.4 - 2023.3   Full year

  • Exercise in Teaching

    2022.4 - 2023.3   Full year

  • Intellectual Property Management

    2022.4 - 2023.3   Full year

  • データ構造とアルゴリズムⅠ（C）

    2022.4 - 2022.9   First semester

  • データ構造とアルゴリズムⅡ

    2022.4 - 2022.9   First semester

  • ゲーム理論

    2022.4 - 2022.9   First semester

  • 情報学論述Ⅰ

    2022.4 - 2022.9   First semester

  • 情報学論議Ⅰ

    2022.4 - 2022.9   First semester

  • 情報理工学読解

    2022.4 - 2022.9   First semester

  • 情報理工学論述Ⅰ

    2022.4 - 2022.9   First semester

  • 情報理工学論議Ⅰ

    2022.4 - 2022.9   First semester

  • Game Theory

    2022.4 - 2022.9   First semester

  • Game Theory I

    2022.4 - 2022.6   Spring quarter

  • データ構造とアルゴリズムⅠ（CM）

    2022.4 - 2022.6   Spring quarter

  • データ構造とアルゴリズムⅡＡ

    2022.4 - 2022.6   Spring quarter

  • データ構造とアルゴリズムⅠA（C）

    2022.4 - 2022.6   Spring quarter

  • ゲーム理論Ⅰ

    2022.4 - 2022.6   Spring quarter

  • 情報学論述Ⅱ

    2021.10 - 2022.3   Second semester

  • 情報学論議Ⅱ

    2021.10 - 2022.3   Second semester

  • 情報理工学演示

    2021.10 - 2022.3   Second semester

  • データ構造とアルゴリズムⅡＢ

    2021.6 - 2021.8   Summer quarter

  • データ構造とアルゴリズムⅠＢ（C）

    2021.6 - 2021.8   Summer quarter

  • ゲーム理論Ⅱ

    2021.6 - 2021.8   Summer quarter

  • Game Theory II

    2021.6 - 2021.8   Summer quarter

  • Exercise in Teaching

    2021.4 - 2022.3   Full year

  • Advanced Project Management Technique

    2021.4 - 2022.3   Full year

  • 情報論理学特別講究

    2021.4 - 2022.3   Full year

  • Advanced Research in Information Semantics

    2021.4 - 2022.3   Full year

  • 情報学特別講究第一

    2021.4 - 2022.3   Full year

  • 情報学特別講究第二

    2021.4 - 2022.3   Full year

  • 情報学特別演習

    2021.4 - 2022.3   Full year

  • Advanced Research in Informatics I

    2021.4 - 2022.3   Full year

  • Advanced Research in Informatics II

    2021.4 - 2022.3   Full year

  • Advanced Seminar in Informatics

    2021.4 - 2022.3   Full year

  • 情報理工学研究Ⅰ

    2021.4 - 2022.3   Full year

  • 情報理工学演習

    2021.4 - 2022.3   Full year

  • Intellectual Property Management

    2021.4 - 2022.3   Full year

  • 国際演示技法

    2021.4 - 2022.3   Full year

  • 知的財産技法

    2021.4 - 2022.3   Full year

  • ティーチング演習

    2021.4 - 2022.3   Full year

  • 先端プロジェクト管理技法

    2021.4 - 2022.3   Full year

  • Scientific English Presentation

    2021.4 - 2022.3   Full year

  • データ構造とアルゴリズムⅡ

    2021.4 - 2021.9   First semester

  • データ構造とアルゴリズムⅠ（C）

    2021.4 - 2021.9   First semester

  • [M2]ゲーム理論

    2021.4 - 2021.9   First semester

  • 情報理工学読解

    2021.4 - 2021.9   First semester

  • [M2]情報学論述Ⅰ

    2021.4 - 2021.9   First semester

  • [M2]情報学論議Ⅰ

    2021.4 - 2021.9   First semester

  • [M2]Game Theory

    2021.4 - 2021.9   First semester

  • Game Theory I

    2021.4 - 2021.6   Spring quarter

  • データ構造とアルゴリズムⅡＡ

    2021.4 - 2021.6   Spring quarter

  • データ構造とアルゴリズムⅠＡ（C）

    2021.4 - 2021.6   Spring quarter

  • ゲーム理論Ⅰ

    2021.4 - 2021.6   Spring quarter

  • 情報学論議Ⅱ

    2020.10 - 2021.3   Second semester

  • データ構造とアルゴリズムⅡ

    2020.10 - 2021.3   Second semester

  • 情報学演示

    2020.10 - 2021.3   Second semester

  • 情報学論述Ⅱ

    2020.10 - 2021.3   Second semester

  • データ構造とアルゴリズムⅠB

    2020.6 - 2020.8   Summer quarter

  • データ構造とアルゴリズムⅡB

    2020.6 - 2020.8   Summer quarter

  • Advanced Seminar in Informatics

    2020.4 - 2021.3   Full year

  • 国際演示技法

    2020.4 - 2021.3   Full year

  • 知的財産技法

    2020.4 - 2021.3   Full year

  • ティーチング演習

    2020.4 - 2021.3   Full year

  • 先端プロジェクト管理技法

    2020.4 - 2021.3   Full year

  • Scientific English Presentation

    2020.4 - 2021.3   Full year

  • Intellectual Property Management

    2020.4 - 2021.3   Full year

  • Exercise in Teaching

    2020.4 - 2021.3   Full year

  • Advanced Project Management Technique

    2020.4 - 2021.3   Full year

  • 情報論理学特別講究

    2020.4 - 2021.3   Full year

  • Advanced Research in Information Semantics

    2020.4 - 2021.3   Full year

  • 情報学特別講究第一

    2020.4 - 2021.3   Full year

  • 情報学特別講究第二

    2020.4 - 2021.3   Full year

  • 情報学特別演習

    2020.4 - 2021.3   Full year

  • Advanced Research in Informatics I

    2020.4 - 2021.3   Full year

  • Advanced Research in Informatics II

    2020.4 - 2021.3   Full year

  • 情報学論議Ⅰ

    2020.4 - 2020.9   First semester

  • データ構造とアルゴリズムⅡ

    2020.4 - 2020.9   First semester

  • ゲーム理論

    2020.4 - 2020.9   First semester

  • 情報学読解

    2020.4 - 2020.9   First semester

  • 情報学論述Ⅰ

    2020.4 - 2020.9   First semester

  • データ構造とアルゴリズムⅠA

    2020.4 - 2020.6   Spring quarter

  • データ構造とアルゴリズムⅡA

    2020.4 - 2020.6   Spring quarter

  • 情報学論議Ⅱ

    2019.10 - 2020.3   Second semester

  • 情報学演示

    2019.10 - 2020.3   Second semester

  • 情報学論述Ⅱ

    2019.10 - 2020.3   Second semester

  • データ構造とアルゴリズムⅠB（C)

    2019.6 - 2019.8   Summer quarter

  • データ構造とアルゴリズムⅡB

    2019.6 - 2019.8   Summer quarter

  • データ構造とアルゴリズムⅠ

    2019.4 - 2019.9   First semester

  • ゲーム理論

    2019.4 - 2019.9   First semester

  • 情報学読解

    2019.4 - 2019.9   First semester

  • 情報学論述Ⅰ

    2019.4 - 2019.9   First semester

  • 情報学論議Ⅰ

    2019.4 - 2019.9   First semester

  • データ構造とアルゴリズムⅡ

    2019.4 - 2019.9   First semester

  • データ構造とアルゴリズムⅠA（C)

    2019.4 - 2019.6   Spring quarter

  • データ構造とアルゴリズムⅡA

    2019.4 - 2019.6   Spring quarter

  • 情報学論議Ⅱ

    2018.10 - 2019.3   Second semester

  • 情報学演示

    2018.10 - 2019.3   Second semester

  • 情報学論述Ⅱ

    2018.10 - 2019.3   Second semester

  • ゲーム理論

    2018.4 - 2018.9   First semester

  • データ構造とアルゴリズムⅡ

    2018.4 - 2018.9   First semester

  • データ構造とアルゴリズムⅠ

    2018.4 - 2018.9   First semester

  • 情報学読解

    2018.4 - 2018.9   First semester

  • 情報学論述Ⅰ

    2018.4 - 2018.9   First semester

  • 情報学論議Ⅰ

    2018.4 - 2018.9   First semester

  • 情報学論議Ⅱ

    2017.10 - 2018.3   Second semester

  • 情報学演示

    2017.10 - 2018.3   Second semester

  • 情報学論述Ⅱ

    2017.10 - 2018.3   Second semester

  • Intellectual Property Management

    2017.4 - 2018.3   Full year

  • 国際演示技法

    2017.4 - 2018.3   Full year

  • 知的財産技法

    2017.4 - 2018.3   Full year

  • ティーチング演習

    2017.4 - 2018.3   Full year

  • 先端プロジェクト管理技法

    2017.4 - 2018.3   Full year

  • Overseas Internship

    2017.4 - 2018.3   Full year

  • Scientific English Presentation

    2017.4 - 2018.3   Full year

  • データ構造とアルゴリズムI

    2017.4 - 2017.9   First semester

  • 情報学読解

    2017.4 - 2017.9   First semester

  • 情報学論述Ⅰ

    2017.4 - 2017.9   First semester

  • 情報学論議Ⅰ

    2017.4 - 2017.9   First semester

  • ゲーム理論

    2017.4 - 2017.9   First semester

  • データ構造とアルゴリズムⅡ

    2017.4 - 2017.9   First semester

  • データ構造とアルゴリズムI

    2016.4 - 2017.3   Full year

  • ゲーム理論