12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

93%

93% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > New techniques for cost sharing in combinatoria...
View graph of relations

« Back

New techniques for cost sharing in combinatorial optimization games

Research output: Contribution to journalJournal article

Published

Journal publication date2010
JournalMathematical Programming
Journal number1-2
Volume124
Number of pages26
Pages93-118
Original languageEnglish

Abstract

Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games. In this paper, we define a very general class of games, called integer minimization games, which includes the combinatorial optimization games in the literature as special cases. We then present new techniques, based on row and column generation, for computing good cost shares for these games. To illustrate the power of these techniques, we apply them to traveling salesman and vehicle routing games. Our results generalize and unify several results in the literature. The main underlying idea is that suitable valid inequalities for the associated combinatorial optimization problems can be used to derive improved cost shares.