Linear, Exponential, but Nothing Else

Max Klimm ()
Additional contact information
Max Klimm: Technische Universität Berlin, Institut für Mathematik

A chapter in Gems of Combinatorial Optimization and Graph Algorithms, 2015, pp 113-123 from Springer

Abstract: 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.

Keywords: Cost Function; Priority Rule; Strategy Profile; Congestion Game; Delay Cost (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-24971-1_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319249711

DOI: 10.1007/978-3-319-24971-1_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().