Budget balanced mechanisms for the multicast pricing problem with rates

Markus Bläser*, Bodo Manthey

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

A meta mechanism was designed under the layered paradigm that uses a binary mechanism for each layer as a blackbox. The resulting metamechanism is interesting on its own and can be applied to other pricing problems with rates. The mechanism works for general graphs and computes for each layer a multicast tree whose weight is at most twice the weight of an optimum Steiner tree, provided that the triangle inequality holds. It is shown that for the split session paradigm, such a meta mechanism does not exist.

Original languageEnglish
Title of host publicationEC '03
Subtitle of host publicationProceedings of the 4th ACM Conference on Electronic Commerce
Place of PublicationNew York, NY
PublisherAssociation for Computing Machinery (ACM)
Pages194-195
Number of pages2
ISBN (Print)1-58113-679-X
DOIs
Publication statusPublished - 2003
Externally publishedYes
Event4th ACM Conference on Electronic Commerce, EC 2003 - San Diego, United States
Duration: 9 Jun 200312 Jun 2003
Conference number: 4

Conference

Conference4th ACM Conference on Electronic Commerce, EC 2003
Abbreviated titleEC
CountryUnited States
CitySan Diego
Period9/06/0312/06/03

Keywords

  • Cost-sharing functions
  • Mechanism design
  • Multicast pricing

Fingerprint Dive into the research topics of 'Budget balanced mechanisms for the multicast pricing problem with rates'. Together they form a unique fingerprint.

  • Cite this

    Bläser, M., & Manthey, B. (2003). Budget balanced mechanisms for the multicast pricing problem with rates. In EC '03: Proceedings of the 4th ACM Conference on Electronic Commerce (pp. 194-195). New York, NY: Association for Computing Machinery (ACM). https://doi.org/10.1145/779928.779955