Random Assignment under Ordinal Preferences: A separation characterization. Asian J. of Management Science and Applications,. 2017. 3. 1. 50-60
Satoru FUJISHIGE (RISM, Kyoyo University), Yoshio SANO (University of Tsukuba). An Extended Probabilistic Serial Mechanism to the Random Assignment Problem with Multi-unit Demands and Polymatroidal Supplies. 2016
Zhan Ping, Ping Zhan. Algorithms for unbounded and varied capacitated lot-sizing problems with outsourcing. 江戸川大学紀要. 2016. 26. 26. 335-338
A simple construction of single-peaked domains and ex-ante efficiency
(The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications 2019)
The random assignment problem on a full preference domain with submodular constraints on goods
(International Symposium on Mathematical Programming, ISMP 2018 2018)
Ordinal Efficiency with Submodular Constraints on Goods
(日本オペレーションズ・リサーチ学会 2017年秋季研究発表会 1-F-7 2017)
A Solution to the Random Assignment Problem with a Matroidal Family of Goods
(日本オペレーションズ・リサーチ学会2016年秋季研究発表会 2016)
Probabilistic Assignment with Serial Rule: A Separation Characterization
(AAMSA: Asian Association of Management Science and Applications 2015 2015)