ACADSTAFF UGM

CREATION
Title : Cooperative Dynamic Game, Discrete Time Case
Author :

Prof. Dr. Salmah, M.Si. (2)

Date : 2012
Keyword : cooperative game, Pareto solution, Nash-bargaining solution cooperative game, Pareto solution, Nash-bargaining solution
Abstract : In this paper, we study the cooperative dynamic game problem for discrete time case. We assume the difference equation in this problem is linear and time invariant. The objective function for each player has the quadratic form and positive definite. We can proof that Pareto solution can be determined by minimizing linear convex combination of all objective functions. The disagreement point of all players is obtained by finding minimax point. The Nash-Bargaining solution is select by a point in Pareto frontier hat give biggest rectangle cold-drawn from disagreement point.
Group of Knowledge : Matematika
Level : Internasional
Status :
Published
Document
No Title Document Type Action