Budget balanced mechanisms for the multicast pricing problem with rates

Markus Bläser; Bodo Manthey

doi:10.1145/779928.779955

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 proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	EC '03
Subtitle of host publication	Proceedings of the 4th ACM Conference on Electronic Commerce
Place of Publication	New York, NY
Publisher	Association for Computing Machinery
Pages	194-195
Number of pages	2
ISBN (Print)	1-58113-679-X
DOIs	https://doi.org/10.1145/779928.779955
Publication status	Published - 2003
Externally published	Yes
Event	4th ACM Conference on Electronic Commerce, EC 2003 - San Diego, United States Duration: 9 Jun 2003 → 12 Jun 2003 Conference number: 4

Conference

Conference	4th ACM Conference on Electronic Commerce, EC 2003
Abbreviated title	EC
Country/Territory	United States
City	San Diego
Period	9/06/03 → 12/06/03

Keywords

Cost-sharing functions
Mechanism design
Multicast pricing

Access to Document

10.1145/779928.779955

Cite this

@inproceedings{5f505ed7fa304eacac82602c0e229005,

title = "Budget balanced mechanisms for the multicast pricing problem with rates",

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.",

keywords = "Cost-sharing functions, Mechanism design, Multicast pricing",

author = "Markus Bl{\"a}ser and Bodo Manthey",

year = "2003",

doi = "10.1145/779928.779955",

language = "English",

isbn = "1-58113-679-X",

pages = "194--195",

booktitle = "EC '03",

publisher = "Association for Computing Machinery",

address = "United States",

note = "4th ACM Conference on Electronic Commerce, EC 2003, EC ; Conference date: 09-06-2003 Through 12-06-2003",

}

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. Association for Computing Machinery, New York, NY, pp. 194-195, 4th ACM Conference on Electronic Commerce, EC 2003, San Diego, California, United States, 9/06/03. https://doi.org/10.1145/779928.779955

TY - GEN

T1 - Budget balanced mechanisms for the multicast pricing problem with rates

AU - Bläser, Markus

AU - Manthey, Bodo

N1 - Conference code: 4

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Cost-sharing functions

KW - Mechanism design

KW - Multicast pricing

UR - http://www.scopus.com/inward/record.url?scp=17044449500&partnerID=8YFLogxK

U2 - 10.1145/779928.779955

DO - 10.1145/779928.779955

M3 - Conference contribution

AN - SCOPUS:17044449500

SN - 1-58113-679-X

SP - 194

EP - 195

BT - EC '03

PB - Association for Computing Machinery

CY - New York, NY

T2 - 4th ACM Conference on Electronic Commerce, EC 2003

Y2 - 9 June 2003 through 12 June 2003

ER -

Budget balanced mechanisms for the multicast pricing problem with rates

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this