Publications‎ > ‎


International Journal

  • William Yeoh, Makoto Yokoo,“Distributed Problem Solving,” AI Magazine, 33 (3), 53-65, 2012.  
  • Dong Hao, Xiaojuan Liao, Avishek Adhikari, Kouichi Sakurai, and Makoto Yokoo, “A repeated game approach for analyzing the collusion on selective forwarding in multihop wireless networks,”  Computer Communications, 35 (17), 2125-2137, 2012. 
  • Tenda Okimoto, Atsushi Iwasaki, and Makoto Yokoo, “Effect of DisCSP variable-ordering heuristics in scale-free networks,” Multiagent and Grid Systems, 8 (2), 127-141, 2012. 
  • Rashid Farooq, Tamas Fleiner, and Akihisa Tamura, “Matching with partially ordered contracts,” Japan Journal of Industrial and Applied Mathematics, 29, 401-417, 2012. 
  • Michel Grabisch and Yukihiko Funaki, “A Coalition Formation Value for Games in Partition Function Form,” European Journal of Operational Research, 221 (1), 175-185, 2012. 
  • Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada, “On the approximability and hardness of minimum topic connected overlay and its special instances,” Theoretical Computer Science, 429, 144-154, 2012. 
  • Sang Won Bae and Yoshio Okamoto, “Querying two boundary points for shortest paths in a polygonal domain,” Computational Geometry: Theory and Applications, 45, 284-293, 2012. 
  • Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Yoshio Okamoto, and Andreas Spillner, “Vertex angle and crossing angle resolution of leveled tree drawings,” Information Processing Letters, 112, 630-635, 2012. 
  • Yoshio Okamoto, Yota Otachi, and Ryuhei Uehara, “On bipartite powers of bigraphs,” Discrete Mathematics & Theoretical Computer Science, 14 (2), 11-20, 2012. 
  • Hiroshi Toyoizumi, Seiichi Tani, Naoto Miyoshi, and Yoshio Okamoto, “Reverse preferential spread in complex networks,” Physical Review E, 86, 2012. 
  • Michael Hoffmann, Jiří Matoušek, Yoshio Okamoto, and Philipp Zumstein, “Minimum and maximum against k lies,” Theoretical Computer Science, 1-10, 2012.

International Conference

  • Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, and Hiroshi Matsuo, "Distributed Search Method with Bounded Cost Vectors on Multiple Objective DCOPs, ” The 15th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2012), LNCS7455, 137-152, 2012.
  • Yuko Sakurai and Makoto Yokoo, “Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms,” IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-2012), 502-509, 2012.
  • Don Hao, Atsushi Iwasaki and Makoto Yokoo, “A Differential Game Theoretic Model for Real-Time Spectrum Pricing in Cognitive Radio Networks,” The 37th Annual IEEE Conference on Local Computer Networks (LCN-2012), 236-239, 2012.
  • Taiki Todo, Takayuki Mouri, Atsushi Iwasaki, and Makoto Yokoo, “False-name-proofness in Online Mechanisms,” The 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2012), 753-762, 2012.
  • Suguru Ueda, Takato Hasegawa, Naoyuki Hashimoto, Naoki Ohta, Atsushi Iwasaki, and Makoto Yokoo, “Handling Negative Value Rules in MC-net-based Coalition Structure Generation,The 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2012), 795-804, 2012.
  • Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno, “A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares,” The 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT-2012), LNCS7357, 24-35, 2012. 
  • Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou, “Reconfiguration of List L(2, 1)- Labelings in a Graph,” The 23rd International Symposium on Algorithms and Computation (ISAAC- 2012), LNCS7676, 34-43, 2012.
  • Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, and Yushi Uno, “A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks,” The 23rd International Symposium on Algorithms and Computation (ISAAC-2012), LNCS7676, 372-381, 2012.
  • Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto, “Universal Point Subsets for Planar Graphs,” The 23rd International Symposium on Algorithms and Computation (ISAAC-2012), LNCS7676, 423-432, 2012.
  • Marek Cygan, Holger Dell, Daniel Lokshtanov, Daniel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlstrom, “On problems as hard as CNF-S,” The 27th IEEE Conference on Computational Complexity (CCC-2012), 74-84, 2012.
  • Masashi Kiyomi, Yoshio Okamoto, and Toshiki Saitoh, “Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data,” The 11th International Symposium on Experimental Algorithms (SEA-2012), LNCS7276, 248-259, 2012.
  • Sang Won Bae, Yoshio Okamoto and Chan-Su Shin, “Area Bounds of Rectilinear Polygons Realized by Angle Sequences,” The 23rd International Symposium on Algorithms and Computation (ISAAC-2012), LNCS7676, 629-638, 2012.
  • Yasuyuki Shirai, Koji Tsuruma, Yuko Sakurai, Satoshi Oyama, and Shin-ichi Minato, “Incremental Set Recommendation Based on Class Differences,” The 16th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2012), LNCS7301, 183-194, 2012.

Invited Lecture

  • Makoto Yokoo, “Repeated Games with Private Monitoring: A New Frontier for POMDP Researchers,” The 7th Workshop on Multiagent Sequential Decision Making Under Uncertainty (MSDM-2012), The Technical University of Valencia (Spain), 2012/6/5.
  • Yoshio Okamoto, “Two (open) problems: simple, fun, and hopefully solvable,” Fields Workshop on Discrete and Computational Geometry, Carleton University (Canada), 2012/8/14. 


  • Masahiko Aoki, Kenneth Binmore, Simon Deakin, Herbert Gintis, Michihiro Kandori, “Complexity and Institutions: Markets, Norms and Corporations,” Palgrave Macmillan, 2012.