RANKING BY RELATIONAL POWER BASED ON DIGRAPHS

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper we examine the ranking of objects whose relative merits are given by a directed graph. We consider several measures and show their rationality through axiomatization as well as showing the relationship with the Shapley value of games whose characteristic function is derived from the directed graph. We also give some numerical examples and report the experience of the application to the best paper selection problem.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Yamamoto Yoshitsugu

  University Of Tsukuba

• Yamamoto Yoshitsugu

  Univ. Tsukuba

• Ryuo Satoko

  University of Tsukuba

関連論文

• A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
• RANKING BY RELATIONAL POWER BASED ON DIGRAPHS
• A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS
• LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(SCOPE (Seminar on Computation and OPtimization for new Extensions))

スポンサーリンク