A bankruptcy problem and an information trading problem: Applications to k-convex games

A bankruptcy problem and an information trading problem: Applications to k-convex games

0.00 Avg rating0 Votes
Article ID: iaor19961718
Country: Germany
Volume: 41
Issue: 3
Start Page Number: 313
End Page Number: 324
Publication Date: May 1995
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors:
Abstract:

The paper is devoted to two real problems that generate a cooperative game model with a so-called k-convex characteristic function when certain conditions are fulfilled. Both a bankruptcy problem and an information trading problem are modelled as a cooperative game by constructing the corresponding bankruptcy game as well as the information market game. Firstly, it is established that the bankruptcy game is a k-convex n-person game where 1•k•n-2 if and only if the estate is sufficient to meet the claims of creditors in any (n-k)-person coalition. Secondly, it is shown that the k-convexity property for the information market game is equivalent to the nonexistence of profits with respect to a restricted class of submarkets.

Reviews

Required fields are marked *. Your email address will not be published.