IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-24971-1_11.html
   My bibliography  Save this book chapter

Linear, Exponential, but Nothing Else

In: Gems of Combinatorial Optimization and Graph Algorithms

Author

Listed:
  • Max Klimm

    (Technische Universität Berlin, Institut für Mathematik)

Abstract

We consider two seemingly unrelated resource allocation problems and show that they share a deep structural property. In the first problem, we schedule jobs on a single machine to minimize the sum of the jobs’ cost where each job’s cost is determined by a job-specific function of its completion time. In the second problem, we consider weighted congestion games and are interested in the existence of pure Nash equilibria. We show that the classes of delay cost functions for which the scheduling problem admits a priority rule are exactly the classes of resource cost functions that guarantee the existence of a pure Nash equilibrium in weighted congestion games. These classes of cost functions are those that contain only linear functions or exponential functions, but not both.

Suggested Citation

  • Max Klimm, 2015. "Linear, Exponential, but Nothing Else," Springer Books, in: Andreas S. Schulz & Martin Skutella & Sebastian Stiller & Dorothea Wagner (ed.), Gems of Combinatorial Optimization and Graph Algorithms, pages 113-123, Springer.
    • Handle: RePEc:spr:sprchp:978-3-319-24971-1_11
    DOI: 10.1007/978-3-319-24971-1_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-24971-1_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.