SIMPLICIAL ALGORITHM FOR COMPUTING A CORE ELEMENT IN A BALANCED GAME

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper we propose a simplicial algorithm to find a core element for balanced games without side payments. The algorithm subdivides an appropriate simplex into smaller simplices and generates from an arbitrarily chosen point a sequence of adjacent simplices of variable dimension. Within a finite number of iterations the algorithm finds a simplex yielding an approximating core element. If the accuracy of approximation is not satisfactory, the algorithm can be restarted with a smaller mesh size in order to improve the accuracy.

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

著者

• Talman Dolf

  Dept. Of Econometrics Tilburg University

• Kamiya Kazuya

  Faculty of Economics Osaka University

関連論文

• SIMPLICIAL ALGORITHM FOR COMPUTING A CORE ELEMENT IN A BALANCED GAME

スポンサーリンク