Velzen, Bas van (Tilburg University, Center for Economic Research)
Abstract
In this paper we introduce the class of simple combinatorial optimisation cost games, which are games associated to {0, 1}-matrices. A coalitional value of a combinatorial optimisation game is determined by solving an integer program associated with this matrix and the characteristic vector of the coalition. For this class of games, we will characterise core stability and totally balancedness. We continue by characterising exactness and largeness. Finally, we conclude the paper by applying our main results to minimum colouring games and minimum vertex cover games.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
118.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: