Simple Combinatorial Optimisation Cost Games

S. van Velzen

Research output: Working paperDiscussion paperOther research output

205 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages12
Volume2005-118
Publication statusPublished - 2005

Publication series

NameCentER Discussion Paper
Volume2005-118

Keywords

  • Combinatorial optimisation game
  • core stability
  • totally balancedness
  • largeness
  • exactness

Fingerprint Dive into the research topics of 'Simple Combinatorial Optimisation Cost Games'. Together they form a unique fingerprint.

  • Cite this

    van Velzen, S. (2005). Simple Combinatorial Optimisation Cost Games. (CentER Discussion Paper; Vol. 2005-118). Operations research.