File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Totally balanced combinatorial optimization games

TitleTotally balanced combinatorial optimization games
Authors
KeywordsCombinatorial optimization
Cooperative games
Duality theory
Total balancedness
Issue Date2000
PublisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/10107/
Citation
Mathematical Programming, Series B, 2000, v. 87 n. 3, p. 441-452 How to Cite?
AbstractCombinatorial optimization games deal with cooperative games for which the value of every subset of players is obtained by solving a combinatorial optimization problem on the resources collectively owned by this subset. A solution of the game is in the core if no subset of players is able to gain advantage by breaking away from this collective decision of all players. The game is totally balanced if and only if the core is non-empty for every induced subgame of it. We study the total balancedness of several combinatorial optimization games in this paper. For a class of the partition game [5], we have a complete characterization for the total balancedness. For the packing and covering games [3], we completely clarify the relationship between the related primal/dual linear programs for the corresponding games to be totally balanced. Our work opens up the question of fully characterizing the combinatorial structures of totally balanced packing and covering games, for which we present some interesting examples: the totally balanced matching, vertex cover, and minimum coloring games.
Persistent Identifierhttp://hdl.handle.net/10722/75401
ISSN
2015 Impact Factor: 2.062
2015 SCImago Journal Rankings: 2.785
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorDeng, Xen_HK
dc.contributor.authorIbaraki, Ten_HK
dc.contributor.authorNagamochi, Hen_HK
dc.contributor.authorZang, Wen_HK
dc.date.accessioned2010-09-06T07:10:46Z-
dc.date.available2010-09-06T07:10:46Z-
dc.date.issued2000en_HK
dc.identifier.citationMathematical Programming, Series B, 2000, v. 87 n. 3, p. 441-452en_HK
dc.identifier.issn0025-5610en_HK
dc.identifier.urihttp://hdl.handle.net/10722/75401-
dc.description.abstractCombinatorial optimization games deal with cooperative games for which the value of every subset of players is obtained by solving a combinatorial optimization problem on the resources collectively owned by this subset. A solution of the game is in the core if no subset of players is able to gain advantage by breaking away from this collective decision of all players. The game is totally balanced if and only if the core is non-empty for every induced subgame of it. We study the total balancedness of several combinatorial optimization games in this paper. For a class of the partition game [5], we have a complete characterization for the total balancedness. For the packing and covering games [3], we completely clarify the relationship between the related primal/dual linear programs for the corresponding games to be totally balanced. Our work opens up the question of fully characterizing the combinatorial structures of totally balanced packing and covering games, for which we present some interesting examples: the totally balanced matching, vertex cover, and minimum coloring games.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/10107/en_HK
dc.relation.ispartofMathematical Programming, Series Ben_HK
dc.subjectCombinatorial optimizationen_HK
dc.subjectCooperative gamesen_HK
dc.subjectDuality theoryen_HK
dc.subjectTotal balancednessen_HK
dc.titleTotally balanced combinatorial optimization gamesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0025-5610&volume=87&spage=441&epage=452&date=2000&atitle=Totally+Balanced+Combinatorial+Optimization+Gamesen_HK
dc.identifier.emailZang, W:wzang@maths.hku.hken_HK
dc.identifier.authorityZang, W=rp00839en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s101070050005-
dc.identifier.scopuseid_2-s2.0-0007381610en_HK
dc.identifier.hkuros52970en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0007381610&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume87en_HK
dc.identifier.issue3en_HK
dc.identifier.spage441en_HK
dc.identifier.epage452en_HK
dc.identifier.isiWOS:000087422900005-
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridDeng, X=7401768881en_HK
dc.identifier.scopusauthoridIbaraki, T=7102088525en_HK
dc.identifier.scopusauthoridNagamochi, H=7004565758en_HK
dc.identifier.scopusauthoridZang, W=7005740804en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats