IMPROVED RESULTS FOR STACKELBERG SCHEDULING STRATEGIES.

PDF Version Also Available for Download.

Description

We continue the study initiated in [Ro01] on Stackelberg Scheduling Strategies. We are given a set of n independent parallel machines or equivalently a set of n parallel edges on which certain flow has to be sent. Each edge e is endowed with a latency function l{sub e}({center_dot}). The setting is that of a non-cooperative game: players choose edges so as minimize their individual latencies. Additionally, there is a single player who control as fraction ?? of the total flow. The goal is to find a strategy for the leader (i.e. an assignment of flow to indivual links) such that ... continued below

Physical Description

20 p.

Creation Information

Kumar, A. (Anil); Marathe, M. V. (Madhav V.) & Kapernick, R. J. (Richard J.) January 1, 2001.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

We continue the study initiated in [Ro01] on Stackelberg Scheduling Strategies. We are given a set of n independent parallel machines or equivalently a set of n parallel edges on which certain flow has to be sent. Each edge e is endowed with a latency function l{sub e}({center_dot}). The setting is that of a non-cooperative game: players choose edges so as minimize their individual latencies. Additionally, there is a single player who control as fraction ?? of the total flow. The goal is to find a strategy for the leader (i.e. an assignment of flow to indivual links) such that the selfish users react so as to minimize the total latency of the system. Building on the recent results in [Ro01, RT00], we show the following: 1. We devise a fully polynomial approximate scheme for the problem of finding the cheapest Stackelberg Strategy: given a performance requirement, our algorithm runs in time polynomial in n and {var_epsilon} and produces a Stackelberg strategy s, whose associated cost is within a 1 + {var_epsilon} factor of the optimum stackelberg strategy s*. The result is extended to obtain a polynomial-approximation scheme when instances are restricted to layered directed graphs in which each layer has a bounded number of vertices. 2. We then consider a two round Stackelberg strategy (denoted 2SS). In this strategy, the game consists of three rounds: a move by the leader followed by the moves of all the followers folowed again by a move by the leader who possibly reassigns some of the flows. We show that 2SS always dominates the one round scheme, and for some classes of latency functions, is guaranteed to be closer to the global social optimum. We also consider the variant where the leader plays after the selfish users have routed themselves, and observe that this dominates the one-round scheme. Extensions of the results to the special case when all the latency functions are linear are also presented. Our results extend the earlier results and answer an open question posed by Roughgarden [Ro01].

Physical Description

20 p.

Source

  • Submitted to: 34th ACA Symposium on Theory of Computing (STOC2002) Montreal, Canada, May 19-21, 2002

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Report No.: LA-UR-01-6406
  • Grant Number: none
  • Office of Scientific & Technical Information Report Number: 975873
  • Archival Resource Key: ark:/67531/metadc930620

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • January 1, 2001

Added to The UNT Digital Library

  • Nov. 13, 2016, 7:26 p.m.

Description Last Updated

  • Dec. 9, 2016, 11:41 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 1

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Kumar, A. (Anil); Marathe, M. V. (Madhav V.) & Kapernick, R. J. (Richard J.). IMPROVED RESULTS FOR STACKELBERG SCHEDULING STRATEGIES., article, January 1, 2001; United States. (digital.library.unt.edu/ark:/67531/metadc930620/: accessed May 21, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.