Search Results

Documents authored by Steinberg, Richard


Document
A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network

Authors: Edward Anderson, Frank Kelly, and Richard Steinberg

Published in: Dagstuhl Seminar Proceedings, Volume 5011, Computing and Markets (2005)


Abstract
We propose a method for determining how much to charge users of a communication network when they share bandwidth. Our approach can be employed either when a network owner wishes to sell bandwidth for a specified period of time to a number of different users, or when users cooperate to build a network to be shared among themselves. We show how a Contract and Balancing Mechanism can be defined to mediate between rapidly fluctuating prices and the longer time scales over which bandwidth contracts might be traded. An important property of the process is that it avoids introducing perverse incentives for a capacity provider to increase congestion.

Cite as

Edward Anderson, Frank Kelly, and Richard Steinberg. A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network. In Computing and Markets. Dagstuhl Seminar Proceedings, Volume 5011, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{anderson_et_al:DagSemProc.05011.3,
  author =	{Anderson, Edward and Kelly, Frank and Steinberg, Richard},
  title =	{{A Contract and Balancing Mechanism for Sharing Capacity in a Communication Network}},
  booktitle =	{Computing and Markets},
  pages =	{1--31},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5011},
  editor =	{Daniel Lehmann and Rudolf M\"{u}ller and Tuomas Sandholm},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05011.3},
  URN =		{urn:nbn:de:0030-drops-2041},
  doi =		{10.4230/DagSemProc.05011.3},
  annote =	{Keywords: compact representation of games, congestion games, local-effect games, action-graph gamescomputational markets; auctions; bidding strategiesNegotiatio}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail