Lancaster EPrints

New techniques for cost sharing in combinatorial optimization games

Caprara, A and Letchford, A N (2010) New techniques for cost sharing in combinatorial optimization games. Mathematical Programming, 124 (1-2). pp. 93-118. ISSN 0025-5610

[img]
Preview
PDF (New techniques for cost sharing in combinatorial optimization games) - Draft Version
Download (212Kb) | Preview

    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.

    Item Type: Article
    Journal or Publication Title: Mathematical Programming
    Uncontrolled Keywords: cooperative games ; cost shares ; combinatorial optimisation games ; traveling salesman game
    Subjects: H Social Sciences > HB Economic Theory
    Departments: Lancaster University Management School > Management Science
    ID Code: 45297
    Deposited By: ep_importer_pure
    Deposited On: 11 Jul 2011 19:29
    Refereed?: Yes
    Published?: Published
    Last Modified: 09 Apr 2014 22:30
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/45297

    Actions (login required)

    View Item