Networks of complements

Moshe Babaioff; Liad Blumrosen; Noam Nisan

doi:10.4230/LIPIcs.ICALP.2016.140

Networks of complements

Moshe Babaioff, Liad Blumrosen, Noam Nisan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of "Price of Anarchy" and of "Price of Stability" type, for special families of graphs (paths, cycles) as well as more general ones (trees, graphs). We describe best-reply dynamics that converge to non-trivial equilibrium in several families of graphs, and we use these dynamics to prove the existence of approximately-efficient equilibria.

Original language	English
Title of host publication	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
Editors	Yuval Rabani, Ioannis Chatzigiannakis, Davide Sangiorgi, Michael Mitzenmacher
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770132
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2016.140
State	Published - 1 Aug 2016
Event	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 - Rome, Italy Duration: 12 Jul 2016 → 15 Jul 2016

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	55
ISSN (Print)	1868-8969

Conference

Conference	43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
Country/Territory	Italy
City	Rome
Period	12/07/16 → 15/07/16

Bibliographical note

Publisher Copyright:
© Moshe Babaioff, Liad Blumrosen, and Noam Nisan.

Keywords

Complements
Game Theory
Networks
Price of Stability
Pricing

Access to Document

10.4230/LIPIcs.ICALP.2016.140

Cite this

Babaioff, M., Blumrosen, L., & Nisan, N. (2016). Networks of complements. In Y. Rabani, I. Chatzigiannakis, D. Sangiorgi, & M. Mitzenmacher (Eds.), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 Article 140 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 55). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2016.140

Babaioff, Moshe ; Blumrosen, Liad ; Nisan, Noam. / Networks of complements. 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. editor / Yuval Rabani ; Ioannis Chatzigiannakis ; Davide Sangiorgi ; Michael Mitzenmacher. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{7145c502795841f0b4e1689adb991636,

title = "Networks of complements",

abstract = "We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of {"}Price of Anarchy{"} and of {"}Price of Stability{"} type, for special families of graphs (paths, cycles) as well as more general ones (trees, graphs). We describe best-reply dynamics that converge to non-trivial equilibrium in several families of graphs, and we use these dynamics to prove the existence of approximately-efficient equilibria.",

keywords = "Complements, Game Theory, Networks, Price of Stability, Pricing",

author = "Moshe Babaioff and Liad Blumrosen and Noam Nisan",

note = "Publisher Copyright: {\textcopyright} Moshe Babaioff, Liad Blumrosen, and Noam Nisan.; 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 ; Conference date: 12-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "1",

doi = "10.4230/LIPIcs.ICALP.2016.140",

language = "אנגלית",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Yuval Rabani and Ioannis Chatzigiannakis and Davide Sangiorgi and Michael Mitzenmacher",

booktitle = "43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016",

address = "גרמניה",

}

Babaioff, M, Blumrosen, L & Nisan, N 2016, Networks of complements. in Y Rabani, I Chatzigiannakis, D Sangiorgi & M Mitzenmacher (eds), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016., 140, Leibniz International Proceedings in Informatics, LIPIcs, vol. 55, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 12/07/16. https://doi.org/10.4230/LIPIcs.ICALP.2016.140

Networks of complements. / Babaioff, Moshe; Blumrosen, Liad ; Nisan, Noam.
43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. ed. / Yuval Rabani; Ioannis Chatzigiannakis; Davide Sangiorgi; Michael Mitzenmacher. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. 140 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 55).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Networks of complements

AU - Babaioff, Moshe

AU - Blumrosen, Liad

AU - Nisan, Noam

N1 - Publisher Copyright: © Moshe Babaioff, Liad Blumrosen, and Noam Nisan.

PY - 2016/8/1

Y1 - 2016/8/1

N2 - We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of "Price of Anarchy" and of "Price of Stability" type, for special families of graphs (paths, cycles) as well as more general ones (trees, graphs). We describe best-reply dynamics that converge to non-trivial equilibrium in several families of graphs, and we use these dynamics to prove the existence of approximately-efficient equilibria.

AB - We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of "Price of Anarchy" and of "Price of Stability" type, for special families of graphs (paths, cycles) as well as more general ones (trees, graphs). We describe best-reply dynamics that converge to non-trivial equilibrium in several families of graphs, and we use these dynamics to prove the existence of approximately-efficient equilibria.

KW - Complements

KW - Game Theory

KW - Networks

KW - Price of Stability

KW - Pricing

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

U2 - 10.4230/LIPIcs.ICALP.2016.140

DO - 10.4230/LIPIcs.ICALP.2016.140

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85012917336

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

A2 - Rabani, Yuval

A2 - Chatzigiannakis, Ioannis

A2 - Sangiorgi, Davide

A2 - Mitzenmacher, Michael

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

Y2 - 12 July 2016 through 15 July 2016

ER -

Babaioff M, Blumrosen L , Nisan N. Networks of complements. In Rabani Y, Chatzigiannakis I, Sangiorgi D, Mitzenmacher M, editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. 140. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ICALP.2016.140

Networks of complements

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this