[{"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:17:14Z","date_created":"2018-11-28T10:27:23Z","author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"title":"Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications","year":"2016","citation":{"ama":"N N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>. Universität Paderborn; 2016.","ieee":"N. N, <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>. Universität Paderborn, 2016.","chicago":"N, N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>. Universität Paderborn, 2016.","apa":"N, N. (2016). <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>. Universität Paderborn.","short":"N. N, Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications, Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","mla":"N, N. <i>Renegotiable vs. Non-Renegotiable Agreements - Theory and Applications</i>. Universität Paderborn, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"5934","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"citation":{"apa":"N, N. (2016). <i>Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015</i>. Universität Paderborn.","bibtex":"@book{N_2016, title={Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","short":"N. N, Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015, Universität Paderborn, 2016.","mla":"N, N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>. Universität Paderborn, 2016.","chicago":"N, N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015</i>. Universität Paderborn, 2016.","ama":"N N. <i>Wie Wertvoll Ist Der Einzelne Für Das Team? - Performancemessung Der Bundesligaspieler Anhand Der Kooperativen Spieltheorie Der Saison 2014/2015</i>. Universität Paderborn; 2016."},"year":"2016","date_created":"2018-11-28T10:23:06Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2022-11-30T14:25:52Z","publisher":"Universität Paderborn","title":"Wie wertvoll ist der Einzelne für das Team? - Performancemessung der Bundesligaspieler anhand der kooperativen Spieltheorie der Saison 2014/2015","type":"bachelorsthesis","status":"public","department":[{"_id":"205"}],"user_id":"477","_id":"5932","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}]},{"title":"Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH","supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"date_created":"2018-11-28T10:39:15Z","date_updated":"2022-11-30T14:26:34Z","publisher":"Universität Paderborn","citation":{"ama":"N N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn; 2016.","chicago":"N, N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH</i>. Universität Paderborn, 2016.","apa":"N, N. (2016). <i>Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH</i>. Universität Paderborn.","short":"N. N, Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH, Universität Paderborn, 2016.","mla":"N, N. <i>Automatisiertes Matching von Angebot Und Nachfrage in Der Kunststoffindustrie Ein Fallbeispiel in Kooperation Mit Der PINPOOLS GmbH</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Automatisiertes Matching von Angebot und Nachfrage in der Kunststoffindustrie Ein Fallbeispiel in Kooperation mit der PINPOOLS GmbH}, publisher={Universität Paderborn}, author={N, N}, year={2016} }"},"year":"2016","language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"5940","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","type":"bachelorsthesis"},{"language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"5935","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"bachelorsthesis","title":"Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische Analyse","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:29:57Z","date_updated":"2022-11-30T14:25:23Z","publisher":"Universität Paderborn","citation":{"ama":"N N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische Analyse</i>. Universität Paderborn; 2016.","chicago":"N, N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische Analyse</i>. Universität Paderborn, 2016.","apa":"N, N. (2016). <i>Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische Analyse</i>. Universität Paderborn.","mla":"N, N. <i>Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Der Einfluss von Netzwerken auf Gleichgewichtspreise - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","short":"N. N, Der Einfluss von Netzwerken Auf Gleichgewichtspreise - Eine Spieltheoretische Analyse, Universität Paderborn, 2016."},"year":"2016"},{"title":"Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?","date_updated":"2022-11-30T14:26:07Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:14:40Z","author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"year":"2016","citation":{"ieee":"N. N, <i>Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?</i> Universität Paderborn, 2016.","chicago":"N, N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i> Universität Paderborn, 2016.","ama":"N N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i> Universität Paderborn; 2016.","short":"N. N, Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?, Universität Paderborn, 2016.","mla":"N, N. <i>Hat Vertikale Integration Einen Einfluss Auf Die Allgemeine Wohlfahrt?</i> Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","apa":"N, N. (2016). <i>Hat vertikale Integration einen Einfluss auf die allgemeine Wohlfahrt?</i> Universität Paderborn."},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5931","user_id":"477","department":[{"_id":"205"}],"status":"public","type":"bachelorsthesis"},{"title":"Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte","date_updated":"2022-11-30T14:26:22Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:42:02Z","author":[{"last_name":"N","full_name":"N, N","first_name":"N"}],"year":"2016","citation":{"short":"N. N, Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte, Universität Paderborn, 2016.","mla":"N, N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","apa":"N, N. (2016). <i>Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte</i>. Universität Paderborn.","chicago":"N, N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Stabile Supply-Chains - Basierend auf der Theorie der Matching-Märkte</i>. Universität Paderborn, 2016.","ama":"N N. <i>Stabile Supply-Chains - Basierend Auf Der Theorie Der Matching-Märkte</i>. Universität Paderborn; 2016."},"language":[{"iso":"eng"}],"_id":"5941","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"205"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5933","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"year":"2016","citation":{"mla":"N, N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren</i>. Universität Paderborn, 2016.","short":"N. N, Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren, Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","apa":"N, N. (2016). <i>Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren</i>. Universität Paderborn.","ama":"N N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren</i>. Universität Paderborn; 2016.","chicago":"N, N. <i>Die Berechnung von Machtindizes - Ein Vergleich Verschiedener Verfahren</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren</i>. Universität Paderborn, 2016."},"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:25:37Z","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"date_created":"2018-11-28T10:25:05Z","title":"Die Berechnung von Machtindizes - ein Vergleich verschiedener Verfahren"},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5939","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"year":"2016","citation":{"mla":"N, N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Intermediaries in Buyer Seller Networks}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","short":"N. N, Intermediaries in Buyer Seller Networks, Universität Paderborn, 2016.","ama":"N N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn; 2016.","apa":"N, N. (2016). <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn.","ieee":"N. N, <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn, 2016.","chicago":"N, N. <i>Intermediaries in Buyer Seller Networks</i>. Universität Paderborn, 2016."},"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:26:49Z","date_created":"2018-11-28T10:36:09Z","author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"title":"Intermediaries in Buyer Seller Networks"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5937","user_id":"477","department":[{"_id":"205"}],"year":"2016","citation":{"apa":"N, N. (2016). <i>Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische Analyse</i>. Universität Paderborn.","short":"N. N, Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische Analyse, Universität Paderborn, 2016.","mla":"N, N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N, N}, year={2016} }","ama":"N N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische Analyse</i>. Universität Paderborn; 2016.","ieee":"N. N, <i>Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische Analyse</i>. Universität Paderborn, 2016.","chicago":"N, N. <i>Staatliche Regulierung in Vertikal Verbundenen Industrien - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2016."},"title":"Staatliche Regulierung in vertikal verbundenen Industrien - eine spieltheoretische Analyse","publisher":"Universität Paderborn","date_updated":"2022-11-30T14:27:16Z","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"date_created":"2018-11-28T10:32:44Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"5938","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"bachelorsthesis","title":"Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"date_created":"2018-11-28T10:34:03Z","date_updated":"2022-11-30T14:27:02Z","publisher":"Universität Paderborn","citation":{"chicago":"N, N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>. Universität Paderborn, 2016.","ieee":"N. N, <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>. Universität Paderborn, 2016.","ama":"N N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>. Universität Paderborn; 2016.","apa":"N, N. (2016). <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>. Universität Paderborn.","short":"N. N, Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts, Universität Paderborn, 2016.","mla":"N, N. <i>Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts</i>. Universität Paderborn, 2016.","bibtex":"@book{N_2016, title={Pricing and Revenue Sharing of Bundles Using Game Theoretical Concepts}, publisher={Universität Paderborn}, author={N, N}, year={2016} }"},"year":"2016"},{"year":"2015","date_created":"2017-10-17T12:41:40Z","publisher":"Universität Paderborn","title":"Strategic Formation of Customer Relationship Networks","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"3865","file_name":"WP - Strategic Formation of Customer Relationship Networks.pdf","access_level":"closed","title":"Strategic Formation of Customer Relationship Networks","file_size":908865,"creator":"cjhaake","date_created":"2018-08-09T09:10:34Z","date_updated":"2018-08-09T09:13:36Z"}],"abstract":[{"lang":"eng","text":"We analyze the stability of networks when two intermediaries strategically form costly links to customers. We interpret these links as customer relationships that enable trade to sell a product. Equilibrium prices and equilibrium quantities on the output as well as on the input market are determined endogenously for a given network of customer relationships. We investigate in how far the substitutability of the intermediaries' products and the costs of link formation influence the intermediaries' equilibrium profits and thus have an impact on the incentives to strategically form relationships to customers. For networks with three customers we characterize locally stable networks, in particular existence is guaranteed for any degree of substitutability. Moreover for the special cases of perfect complements, independent products and perfect substitutes, local stability coincides with the stronger concept of Nash stability. Additionally, for networks with n customers we analyze stability regions for selected networks and determine their limits when n goes to infinity. It turns out that the shape of the stability regions for those networks does not significantly change compared to a setting with a small number of customers. "}],"language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"apa":"Brangewitz, S., Haake, C.-J., &#38; Möhlmeier, P. (2015). <i>Strategic Formation of Customer Relationship Networks</i> (Vol. 91). Universität Paderborn.","bibtex":"@book{Brangewitz_Haake_Möhlmeier_2015, series={Working Papers CIE}, title={Strategic Formation of Customer Relationship Networks}, volume={91}, publisher={Universität Paderborn}, author={Brangewitz, Sonja and Haake, Claus-Jochen and Möhlmeier, Philipp}, year={2015}, collection={Working Papers CIE} }","short":"S. Brangewitz, C.-J. Haake, P. Möhlmeier, Strategic Formation of Customer Relationship Networks, Universität Paderborn, 2015.","mla":"Brangewitz, Sonja, et al. <i>Strategic Formation of Customer Relationship Networks</i>. Vol. 91, Universität Paderborn, 2015.","ieee":"S. Brangewitz, C.-J. Haake, and P. Möhlmeier, <i>Strategic Formation of Customer Relationship Networks</i>, vol. 91. Universität Paderborn, 2015.","chicago":"Brangewitz, Sonja, Claus-Jochen Haake, and Philipp Möhlmeier. <i>Strategic Formation of Customer Relationship Networks</i>. Vol. 91. Working Papers CIE. Universität Paderborn, 2015.","ama":"Brangewitz S, Haake C-J, Möhlmeier P. <i>Strategic Formation of Customer Relationship Networks</i>. Vol 91. Universität Paderborn; 2015."},"intvolume":"        91","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"},{"last_name":"Möhlmeier","full_name":"Möhlmeier, Philipp","first_name":"Philipp"}],"volume":91,"date_updated":"2022-01-06T06:56:40Z","type":"working_paper","status":"public","urn":"2499","user_id":"65453","series_title":"Working Papers CIE","department":[{"_id":"205"},{"_id":"475"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"249","file_date_updated":"2018-08-09T09:13:36Z"},{"citation":{"apa":"Pfannschmidt, K. (2015). <i>Solving the aggregated bandits problem</i>. Universität Paderborn.","mla":"Pfannschmidt, Karlson. <i>Solving the Aggregated Bandits Problem</i>. Universität Paderborn, 2015.","bibtex":"@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }","short":"K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015.","ieee":"K. Pfannschmidt, <i>Solving the aggregated bandits problem</i>. Universität Paderborn, 2015.","chicago":"Pfannschmidt, Karlson. <i>Solving the Aggregated Bandits Problem</i>. Universität Paderborn, 2015.","ama":"Pfannschmidt K. <i>Solving the Aggregated Bandits Problem</i>. Universität Paderborn; 2015."},"year":"2015","title":"Solving the aggregated bandits problem","date_created":"2017-10-17T12:41:41Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"author":[{"last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson","first_name":"Karlson"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:56:50Z","status":"public","type":"mastersthesis","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"251","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"conference":{"name":"23rd European Conference on Information Systems (ECIS)","location":"Münster, Germany"},"title":"Sharing Means Caring? Hosts' Price Reactions to Rating Visibility","author":[{"first_name":"Dominik","last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik"},{"first_name":"Philipp","last_name":"Herrmann","full_name":"Herrmann, Philipp"}],"date_created":"2017-10-17T12:41:41Z","date_updated":"2022-01-06T06:57:03Z","citation":{"mla":"Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility.” <i>Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster</i>, 2015.","bibtex":"@inproceedings{Gutt_Herrmann_2015, title={Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility}, booktitle={Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster}, author={Gutt, Dominik and Herrmann, Philipp}, year={2015} }","short":"D. Gutt, P. Herrmann, in: Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster, 2015.","apa":"Gutt, D., &#38; Herrmann, P. (2015). Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility. In <i>Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster</i>. Münster, Germany.","ieee":"D. Gutt and P. Herrmann, “Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility,” in <i>Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster</i>, Münster, Germany, 2015.","chicago":"Gutt, Dominik, and Philipp Herrmann. “Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility.” In <i>Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster</i>, 2015.","ama":"Gutt D, Herrmann P. Sharing Means Caring? Hosts’ Price Reactions to Rating Visibility. In: <i>Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster</i>. ; 2015."},"year":"2015","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:43:15Z","ddc":["040"],"user_id":"16205","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"254","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:43:15Z","date_updated":"2018-03-21T09:43:15Z","access_level":"closed","file_id":"1486","file_name":"254-RIP_ECIS2015-Sharing_means_caring_2594_final.pdf","file_size":707962}],"status":"public","abstract":[{"lang":"eng","text":"We empirically investigate how hosts on Airbnb, a popular peer-to-peer website for fee-based sharing of under-utilized space, adjust their prices once their offering gets a visible star rating for the first time. We use data for over 14,000 offerings from Airbnb which we collected for New York City. Our findings indicate that hosts whose offerings achieve star rating visibility significantly increase their prices by an average of 2.69 € more than hosts with comparable offerings who do not experience this rating visibility during the time of observation. Out of all offerings who achieve rating visibility, we identify the upper quartile of hosts to be the main driver of this price increase, whereas the first 75% percent show only a marginal price reaction. These results can serve as a first step towards understanding the motivation of people to provide assets to the sharing economy."}],"type":"conference","publication":"Proceedings of the 23rd European Conference on Information Systems (ECIS), Münster"},{"year":"2015","citation":{"ieee":"M. Trykacz, <i>Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen</i>. Universität Paderborn, 2015.","chicago":"Trykacz, Matthias. <i>Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen</i>. Universität Paderborn, 2015.","ama":"Trykacz M. <i>Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen</i>. Universität Paderborn; 2015.","apa":"Trykacz, M. (2015). <i>Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen</i>. Universität Paderborn.","bibtex":"@book{Trykacz_2015, title={Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen}, publisher={Universität Paderborn}, author={Trykacz, Matthias}, year={2015} }","mla":"Trykacz, Matthias. <i>Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen</i>. Universität Paderborn, 2015.","short":"M. Trykacz, Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen, Universität Paderborn, 2015."},"date_updated":"2022-01-06T06:57:06Z","publisher":"Universität Paderborn","author":[{"last_name":"Trykacz","full_name":"Trykacz, Matthias","first_name":"Matthias"}],"date_created":"2017-10-17T12:41:41Z","title":"Share Economy - Identifikation von konstituierenden Merkmalen anhand einer vergleichenden Betrachtung von Geschäftsmodellen","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"255","user_id":"477","language":[{"iso":"ger"}]},{"title":"Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung","supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"author":[{"last_name":"Zindler","full_name":"Zindler, Finn","first_name":"Finn"}],"date_created":"2017-10-17T12:41:42Z","date_updated":"2022-01-06T06:57:07Z","publisher":"Universität Paderborn","citation":{"ama":"Zindler F. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn; 2015.","ieee":"F. Zindler, <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.","chicago":"Zindler, Finn. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.","bibtex":"@book{Zindler_2015, title={Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung}, publisher={Universität Paderborn}, author={Zindler, Finn}, year={2015} }","mla":"Zindler, Finn. <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn, 2015.","short":"F. Zindler, Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung, Universität Paderborn, 2015.","apa":"Zindler, F. (2015). <i>Selektive Vertriebssysteme am Fallbeispiel der Adidas AG - eine wettbewerbspolitische Beurteilung</i>. Universität Paderborn."},"year":"2015","language":[{"iso":"ger"}],"department":[{"_id":"280"}],"user_id":"42447","_id":"256","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis"},{"title":"Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network","author":[{"full_name":"Rojahn, Tobias","last_name":"Rojahn","first_name":"Tobias"}],"date_created":"2017-10-17T12:41:46Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:51Z","citation":{"ama":"Rojahn T. <i>Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network</i>. Universität Paderborn; 2015.","chicago":"Rojahn, Tobias. <i>Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network</i>. Universität Paderborn, 2015.","ieee":"T. Rojahn, <i>Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network</i>. Universität Paderborn, 2015.","apa":"Rojahn, T. (2015). <i>Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network</i>. Universität Paderborn.","bibtex":"@book{Rojahn_2015, title={Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2015} }","short":"T. Rojahn, Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network, Universität Paderborn, 2015.","mla":"Rojahn, Tobias. <i>Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network</i>. Universität Paderborn, 2015."},"year":"2015","user_id":"477","_id":"281","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"mastersthesis"},{"title":"Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:53Z","date_created":"2017-10-17T12:41:47Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"author":[{"first_name":"Michelle","full_name":"Kirsch, Michelle","last_name":"Kirsch"}],"year":"2015","citation":{"apa":"Kirsch, M. (2015). <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>. Universität Paderborn.","bibtex":"@book{Kirsch_2015, title={Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern}, publisher={Universität Paderborn}, author={Kirsch, Michelle}, year={2015} }","short":"M. Kirsch, Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern, Universität Paderborn, 2015.","mla":"Kirsch, Michelle. <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>. Universität Paderborn, 2015.","ama":"Kirsch M. <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>. Universität Paderborn; 2015.","ieee":"M. Kirsch, <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>. Universität Paderborn, 2015.","chicago":"Kirsch, Michelle. <i>Koordinierter Patentschutz in einer globalisierten Welt - Effizienz- und Anreizwirkungen auf die Arzneimittelversorgung in Entwicklungsländern</i>. Universität Paderborn, 2015."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"282","user_id":"42447","department":[{"_id":"280"}],"status":"public","type":"bachelorsthesis"},{"user_id":"15572","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"287","file_date_updated":"2018-03-08T09:59:05Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","file":[{"date_created":"2018-03-08T09:55:30Z","creator":"florida","date_updated":"2018-03-08T09:59:05Z","file_id":"1203","file_name":"287-1503.04317v1.pdf","access_level":"closed","file_size":1625732,"content_type":"application/pdf","relation":"main_file"}],"status":"public","abstract":[{"text":"The size of modern data centers is constantly increasing. As it is not economic to interconnect all machines in the data center using a full-bisection-bandwidth network, techniques have to be developed to increase the efficiency of data-center networks. The Software-Defined Network paradigm opened the door for centralized traffic engineering (TE) in such environments. Up to now, there were already a number of TE proposals for SDN-controlled data centers that all work very well. However, these techniques either use a high amount of flow table entries or a high flow installation rate that overwhelms available switching hardware, or they require custom or very expensive end-of-line equipment to be usable in practice. We present HybridTE, a TE technique that uses (uncertain) information about large flows. Using this extra information, our technique has very low hardware requirements while maintaining better performance than existing TE techniques. This enables us to build very low-cost, high performance data-center networks.","lang":"eng"}],"urn":"2875","date_created":"2017-10-17T12:41:48Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_updated":"2022-01-06T06:58:17Z","doi":"10.1109/EWSDN.2015.57","title":"HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks","has_accepted_license":"1","quality_controlled":"1","citation":{"chicago":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 1--7, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>.","ieee":"P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7.","ama":"Wette P, Karl H. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:1--7. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>","apa":"Wette, P., &#38; Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/EWSDN.2015.57\">https://doi.org/10.1109/EWSDN.2015.57</a>","short":"P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7.","bibtex":"@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7} }","mla":"Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.57\">10.1109/EWSDN.2015.57</a>."},"page":"1--7","year":"2015"},{"file_date_updated":"2018-03-21T10:28:21Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"79"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","_id":"241","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"file_size":692363,"file_name":"241-ScheidelerSetzerStrothmann2015.pdf","file_id":"1497","access_level":"closed","date_updated":"2018-03-21T10:28:21Z","creator":"florida","date_created":"2018-03-21T10:28:21Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that searchability is maintained while the recovery process is going on, as long as there are no corrupted messages in the system. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of handling node dynamics."}],"publication":"Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)","type":"conference","doi":"10.4230/LIPIcs.OPODIS.2015.24","title":"Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures","date_created":"2017-10-17T12:41:39Z","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:56:07Z","citation":{"short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>}, booktitle={Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>.","apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” In <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs), 2015. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>.","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures,” in <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015.","ama":"Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In: <i>Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs). ; 2015. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2015.24\">10.4230/LIPIcs.OPODIS.2015.24</a>"},"year":"2015","has_accepted_license":"1"},{"type":"conference","status":"public","_id":"242","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","series_title":"Lecture Notes in Computer Science","file_date_updated":"2018-03-21T09:59:32Z","has_accepted_license":"1","page":"201-216","citation":{"chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 201–16. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>.","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–216.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. ; 2015:201-216. doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.","bibtex":"@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture Notes in Computer Science}, title={Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>}, booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216}, collection={Lecture Notes in Computer Science} }","mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2015, pp. 201–16, doi:<a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">10.1007/978-3-319-21741-3_14</a>.","apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 201–216). <a href=\"https://doi.org/10.1007/978-3-319-21741-3_14\">https://doi.org/10.1007/978-3-319-21741-3_14</a>"},"date_updated":"2022-01-06T06:56:10Z","author":[{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"doi":"10.1007/978-3-319-21741-3_14","publication":"Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"lang":"eng","text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":532792,"access_level":"closed","file_name":"242-KSS-SSS2015.pdf","file_id":"1496","date_updated":"2018-03-21T09:59:32Z","creator":"florida","date_created":"2018-03-21T09:59:32Z"}],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2015","date_created":"2017-10-17T12:41:39Z","title":"Towards a Universal Approach for the Finite Departure Problem in Overlay Networks"}]