[{"ddc":["040"],"file_date_updated":"2018-03-21T09:59:00Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"243","user_id":"477","series_title":"LNCS","department":[{"_id":"79"}],"abstract":[{"text":"This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm, which is closely related to the nearly thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided.To do so, the process of self-adjustment is modeled similarly to a basic network creation game, in which the nodes want to communicate with only a certain subset of all nodes. We show that, in general, the game (i.e., the process of local adjustments) does not converge, and convergence is related to certain structures of the communication interests, which we call conflicts.We classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate the different classes of conflicts separately and show that, for a certain class of conflicts, the performance of the tree network is asymptotically as good as the performance for converging instances. However, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly.","lang":"eng"}],"file":[{"file_size":1003113,"file_name":"243-Strothmann-Walcom2015.pdf","access_level":"closed","file_id":"1495","date_updated":"2018-03-21T09:59:00Z","creator":"florida","date_created":"2018-03-21T09:59:00Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)","title":"The impact of communication patterns on distributed locally self-adjusting binary search trees","doi":"10.1007/978-3-319-15612-5_16","date_updated":"2022-01-06T06:56:17Z","author":[{"last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319","first_name":"Thim Frederik"}],"date_created":"2017-10-17T12:41:39Z","year":"2015","citation":{"short":"T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.","bibtex":"@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication patterns on distributed locally self-adjusting binary search trees}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>}, booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186}, collection={LNCS} }","mla":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>.","apa":"Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>","ama":"Strothmann TF. The impact of communication patterns on distributed locally self-adjusting binary search trees. In: <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">10.1007/978-3-319-15612-5_16</a>","ieee":"T. F. Strothmann, “The impact of communication patterns on distributed locally self-adjusting binary search trees,” in <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186.","chicago":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15612-5_16\">https://doi.org/10.1007/978-3-319-15612-5_16</a>."},"page":"175--186","has_accepted_license":"1"},{"date_created":"2017-10-17T12:41:39Z","publisher":"Elsevier","title":"The complexity of pure equilibria in mix-weighted congestion games on parallel links","issue":"12","year":"2015","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Information Processing Letters","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:48:16Z","date_created":"2018-03-21T09:48:16Z","creator":"florida","file_size":239984,"access_level":"closed","file_name":"244-Mavronic_Monien2015_01.pdf","file_id":"1494"}],"abstract":[{"lang":"eng","text":"We revisit the simple class of weighted congestion games on parallel links [10], where each player has a non-negative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. We extend this class to mix-weighted congestion games on parallel links, where weights may as well be negative. For the resulting simple class, we study the complexity of deciding the existence of a pure equilibrium, where no player could unilaterally improve her cost by switching to another link.We show that even for a singlenegative weight, this decision problem is strongly NP-complete when the number of links is part of the input; the problem is NP-complete already for two links. When the number of links is a fixed constant, we show, through a pseudopolynomial, dynamic programming algorithm, that the problem is not strongly NP-complete unless P = NP; the algorithm works for any number of negative weights."}],"author":[{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"first_name":"Marios","full_name":"Mavronicolas, Marios","last_name":"Mavronicolas"}],"volume":115,"date_updated":"2022-01-06T06:56:20Z","main_file_link":[{"url":"http://www.sciencedirect.com/journal/information-processing-letters/vol/115/issue/12"}],"doi":"10.1016/j.ipl.2015.07.012","has_accepted_license":"1","citation":{"mla":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing Letters</i>, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:<a href=\"https://doi.org/10.1016/j.ipl.2015.07.012\">10.1016/j.ipl.2015.07.012</a>.","bibtex":"@article{Monien_Mavronicolas_2015, title={The complexity of pure equilibria in mix-weighted congestion games on parallel links}, volume={115}, DOI={<a href=\"https://doi.org/10.1016/j.ipl.2015.07.012\">10.1016/j.ipl.2015.07.012</a>}, number={12}, journal={Information Processing Letters}, publisher={Elsevier}, author={Monien, Burkhard and Mavronicolas, Marios}, year={2015}, pages={927–931} }","short":"B. Monien, M. Mavronicolas, Information Processing Letters 115 (2015) 927–931.","apa":"Monien, B., &#38; Mavronicolas, M. (2015). The complexity of pure equilibria in mix-weighted congestion games on parallel links. <i>Information Processing Letters</i>, <i>115</i>(12), 927–931. <a href=\"https://doi.org/10.1016/j.ipl.2015.07.012\">https://doi.org/10.1016/j.ipl.2015.07.012</a>","ieee":"B. Monien and M. Mavronicolas, “The complexity of pure equilibria in mix-weighted congestion games on parallel links,” <i>Information Processing Letters</i>, vol. 115, no. 12, pp. 927–931, 2015.","chicago":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria in Mix-Weighted Congestion Games on Parallel Links.” <i>Information Processing Letters</i> 115, no. 12 (2015): 927–31. <a href=\"https://doi.org/10.1016/j.ipl.2015.07.012\">https://doi.org/10.1016/j.ipl.2015.07.012</a>.","ama":"Monien B, Mavronicolas M. The complexity of pure equilibria in mix-weighted congestion games on parallel links. <i>Information Processing Letters</i>. 2015;115(12):927-931. doi:<a href=\"https://doi.org/10.1016/j.ipl.2015.07.012\">10.1016/j.ipl.2015.07.012</a>"},"intvolume":"       115","page":"927-931","user_id":"42447","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"244","file_date_updated":"2018-03-21T09:48:16Z","type":"journal_article","status":"public"},{"abstract":[{"lang":"eng","text":"Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":277574,"file_name":"247-07313613.pdf","access_level":"closed","file_id":"1491","date_updated":"2018-03-21T09:46:21Z","date_created":"2018-03-21T09:46:21Z","creator":"florida"}],"status":"public","type":"conference","publication":"Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)","ddc":["040"],"file_date_updated":"2018-03-21T09:46:21Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"247","user_id":"15504","department":[{"_id":"75"}],"year":"2015","citation":{"chicago":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 37–42, 2015. <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>.","ieee":"A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics,” in <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42.","ama":"Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In: <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>. ; 2015:37-42. doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>","short":"A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.","mla":"Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path Routing without Collecting Statistics.” <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 37–42, doi:<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>.","bibtex":"@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}, DOI={<a href=\"https://doi.org/10.1109/EWSDN.2015.58\">10.1109/EWSDN.2015.58</a>}, booktitle={Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42} }","apa":"Schwabe, A., &#38; Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics. In <i>Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)</i> (pp. 37–42). <a href=\"https://doi.org/10.1109/EWSDN.2015.58\">https://doi.org/10.1109/EWSDN.2015.58</a>"},"page":"37-42","has_accepted_license":"1","title":"SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics","doi":"10.1109/EWSDN.2015.58","date_updated":"2022-01-06T06:56:32Z","date_created":"2017-10-17T12:41:40Z","author":[{"first_name":"Arne","full_name":"Schwabe, Arne","last_name":"Schwabe"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}]},{"year":"2015","citation":{"ama":"Sonntag M. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität Paderborn; 2015.","ieee":"M. Sonntag, <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität Paderborn, 2015.","chicago":"Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität Paderborn, 2015.","short":"M. Sonntag, Reputation und Vertrauen auf Online-Märkten, Universität Paderborn, 2015.","bibtex":"@book{Sonntag_2015, title={Reputation und Vertrauen auf Online-Märkten}, publisher={Universität Paderborn}, author={Sonntag, Melissa}, year={2015} }","mla":"Sonntag, Melissa. <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität Paderborn, 2015.","apa":"Sonntag, M. (2015). <i>Reputation und Vertrauen auf Online-Märkten</i>. Universität Paderborn."},"status":"public","type":"bachelorsthesis","title":"Reputation und Vertrauen auf Online-Märkten","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T06:57:12Z","publisher":"Universität Paderborn","_id":"258","date_created":"2017-10-17T12:41:42Z","author":[{"last_name":"Sonntag","full_name":"Sonntag, Melissa","first_name":"Melissa"}],"user_id":"477"},{"conference":{"location":"Philadelphia, USA","name":"INFORMS Annual Meeting"},"title":"Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?","author":[{"last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik","first_name":"Dominik"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"}],"date_created":"2017-10-17T12:41:42Z","date_updated":"2022-01-06T06:57:13Z","citation":{"apa":"Gutt, D., &#38; Kundisch, D. (2015). Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings? In <i>INFORMS Annual Meeting</i>. Philadelphia, USA.","short":"D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2015.","bibtex":"@inproceedings{Gutt_Kundisch_2015, title={Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?}, booktitle={INFORMS Annual Meeting}, author={Gutt, Dominik and Kundisch, Dennis}, year={2015} }","mla":"Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?” <i>INFORMS Annual Meeting</i>, 2015.","ama":"Gutt D, Kundisch D. Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings? In: <i>INFORMS Annual Meeting</i>. ; 2015.","ieee":"D. Gutt and D. Kundisch, “Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?,” in <i>INFORMS Annual Meeting</i>, Philadelphia, USA, 2015.","chicago":"Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form Overall Ratings?” In <i>INFORMS Annual Meeting</i>, 2015."},"year":"2015","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2019-01-18T14:11:39Z","ddc":["330"],"user_id":"477","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":"259","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"Informs_annual_meeting_2015.pdf","access_level":"closed","file_id":"6862","file_size":89877,"date_created":"2019-01-18T14:11:39Z","creator":"d0mi","date_updated":"2019-01-18T14:11:39Z"}],"status":"public","type":"conference_abstract","publication":"INFORMS Annual Meeting"},{"_id":"264","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:34:36Z","type":"dissertation","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":8031107,"access_level":"closed","file_name":"264-Dissertation_-_Wette.pdf","file_id":"1481","date_updated":"2018-03-21T09:34:36Z","date_created":"2018-03-21T09:34:36Z","creator":"florida"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:20Z","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"}],"supervisor":[{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"date_created":"2017-10-17T12:41:43Z","title":"Optimizing Software-Defined Networks using Application-Layer Knowledge","has_accepted_license":"1","year":"2015","citation":{"apa":"Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn.","bibtex":"@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }","short":"P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015.","mla":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","chicago":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","ieee":"P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","ama":"Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn; 2015."}},{"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:33:11Z","date_created":"2018-03-21T09:33:11Z","creator":"florida","file_size":679580,"access_level":"closed","file_id":"1478","file_name":"266-p343-markarian.pdf"}],"status":"public","abstract":[{"text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". ","lang":"eng"}],"type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","file_date_updated":"2018-03-21T09:33:11Z","ddc":["040"],"user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"266","citation":{"apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344.","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>"},"page":"343-344","year":"2015","has_accepted_license":"1","doi":"10.1145/2767386.2767454","title":"Online Resource Leasing","author":[{"first_name":"Christine","last_name":"Markarian","id":"37612","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:41:44Z","date_updated":"2022-01-06T06:57:22Z"},{"language":[{"iso":"ger"}],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"268","status":"public","type":"bachelorsthesis","title":"Online Bewertungssysteme – Ein systematischer Überblick","author":[{"first_name":"Alexander","last_name":"Lange","full_name":"Lange, Alexander"}],"date_created":"2017-10-17T12:41:44Z","date_updated":"2022-01-06T06:57:28Z","publisher":"Universität Paderborn","citation":{"ama":"Lange A. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität Paderborn; 2015.","chicago":"Lange, Alexander. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität Paderborn, 2015.","ieee":"A. Lange, <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität Paderborn, 2015.","apa":"Lange, A. (2015). <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität Paderborn.","mla":"Lange, Alexander. <i>Online Bewertungssysteme – Ein systematischer Überblick</i>. Universität Paderborn, 2015.","bibtex":"@book{Lange_2015, title={Online Bewertungssysteme – Ein systematischer Überblick}, publisher={Universität Paderborn}, author={Lange, Alexander}, year={2015} }","short":"A. Lange, Online Bewertungssysteme – Ein systematischer Überblick, Universität Paderborn, 2015."},"year":"2015"},{"ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T07:40:55Z","creator":"florida","date_created":"2018-03-20T07:40:55Z","file_size":260503,"file_name":"320-a2-caragiannis.pdf","access_level":"closed","file_id":"1433"}],"publication":"Transactions on Economics and Computation","title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","publisher":"ACM","date_created":"2017-10-17T12:41:54Z","year":"2015","issue":"1","article_number":"2","file_date_updated":"2018-03-20T07:40:55Z","_id":"320","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","status":"public","type":"journal_article","doi":"10.1145/2614687","date_updated":"2022-01-06T06:59:04Z","volume":3,"author":[{"first_name":"Ioannis","full_name":"Caragiannis, Ioannis","last_name":"Caragiannis"},{"first_name":"Angelo","last_name":"Fanelli","full_name":"Fanelli, Angelo"},{"first_name":"Nick","last_name":"Gravin","full_name":"Gravin, Nick"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"intvolume":"         3","citation":{"ama":"Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>. 2015;3(1). doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>","ieee":"I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2015.","chicago":"Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i> 3, no. 1 (2015). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>.","mla":"Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” <i>Transactions on Economics and Computation</i>, vol. 3, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>.","bibtex":"@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={<a href=\"https://doi.org/10.1145/2614687\">10.1145/2614687</a>}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).","apa":"Caragiannis, I., Fanelli, A., Gravin, N., &#38; Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. <i>Transactions on Economics and Computation</i>, <i>3</i>(1). <a href=\"https://doi.org/10.1145/2614687\">https://doi.org/10.1145/2614687</a>"},"has_accepted_license":"1"},{"has_accepted_license":"1","year":"2015","citation":{"chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>"},"page":"67-79","date_updated":"2022-01-06T06:59:08Z","publisher":"Elsevier","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:41:55Z","title":"A deterministic worst-case message complexity optimal solution for resource discovery","doi":"10.1016/j.tcs.2014.11.027","type":"journal_article","publication":"Theoretical Computer Science","abstract":[{"lang":"eng","text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds."}],"file":[{"date_created":"2018-03-20T07:38:02Z","creator":"florida","date_updated":"2018-03-20T07:38:02Z","file_name":"327-KKS15-TOCS_01.pdf","access_level":"closed","file_id":"1427","file_size":398044,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"327","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-20T07:38:02Z"},{"status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"department":[{"_id":"183"}],"user_id":"477","_id":"3309","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"apa":"Fanasch, P. (2015). <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn.","mla":"Fanasch, Patrizia. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn, 2015.","bibtex":"@book{Fanasch_2015, title={Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg}, publisher={Universität Paderborn}, author={Fanasch, Patrizia}, year={2015} }","short":"P. Fanasch, Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg, Universität Paderborn, 2015.","chicago":"Fanasch, Patrizia. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn, 2015.","ieee":"P. Fanasch, <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn, 2015.","ama":"Fanasch P. <i>Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg</i>. Universität Paderborn; 2015."},"year":"2015","title":"Erfolg durch Persönlichkeit? Der Einfluss der Markenpersönlichkeit auf den Zusammenhang von Reputation und Unternehmenserfolg","supervisor":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"}],"author":[{"last_name":"Fanasch","full_name":"Fanasch, Patrizia","first_name":"Patrizia"}],"date_created":"2018-06-22T11:57:31Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"3310","user_id":"477","department":[{"_id":"183"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Frick","full_name":"Frick, Bernd","first_name":"Bernd"}],"author":[{"first_name":"Gregor Paul","full_name":"Walczok, Gregor Paul","last_name":"Walczok"}],"date_created":"2018-06-22T11:59:36Z","title":"Die Veränderung des Mobilfunkmarktes durch die Discountanbieter","year":"2015","citation":{"ama":"Walczok GP. <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>. Universität Paderborn; 2015.","chicago":"Walczok, Gregor Paul. <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>. Universität Paderborn, 2015.","ieee":"G. P. Walczok, <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>. Universität Paderborn, 2015.","mla":"Walczok, Gregor Paul. <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>. Universität Paderborn, 2015.","short":"G.P. Walczok, Die Veränderung des Mobilfunkmarktes durch die Discountanbieter, Universität Paderborn, 2015.","bibtex":"@book{Walczok_2015, title={Die Veränderung des Mobilfunkmarktes durch die Discountanbieter}, publisher={Universität Paderborn}, author={Walczok, Gregor Paul}, year={2015} }","apa":"Walczok, G. P. (2015). <i>Die Veränderung des Mobilfunkmarktes durch die Discountanbieter</i>. Universität Paderborn."}},{"user_id":"18949","department":[{"_id":"183"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"288","file_date_updated":"2018-03-21T09:24:24Z","type":"journal_article","status":"public","author":[{"first_name":"Joe","last_name":"Cox","full_name":"Cox, Joe"},{"first_name":"Daniel","full_name":"Kaimann, Daniel","id":"18949","last_name":"Kaimann"}],"volume":14,"date_updated":"2022-01-06T06:58:25Z","doi":"10.1002/cb.1553","has_accepted_license":"1","citation":{"ama":"Cox J, Kaimann D. How do reviews from professional critics interact with other signals of product quality? Evidence from the video game industry. <i>Journal of Consumer Behaviour</i>. 2015;14(6):366-377. doi:<a href=\"https://doi.org/10.1002/cb.1553\">10.1002/cb.1553</a>","ieee":"J. Cox and D. Kaimann, “How do reviews from professional critics interact with other signals of product quality? Evidence from the video game industry,” <i>Journal of Consumer Behaviour</i>, vol. 14, no. 6, pp. 366–377, 2015.","chicago":"Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.” <i>Journal of Consumer Behaviour</i> 14, no. 6 (2015): 366–77. <a href=\"https://doi.org/10.1002/cb.1553\">https://doi.org/10.1002/cb.1553</a>.","mla":"Cox, Joe, and Daniel Kaimann. “How Do Reviews from Professional Critics Interact with Other Signals of Product Quality? Evidence from the Video Game Industry.” <i>Journal of Consumer Behaviour</i>, vol. 14, no. 6, Wiley Online Library, 2015, pp. 366–77, doi:<a href=\"https://doi.org/10.1002/cb.1553\">10.1002/cb.1553</a>.","bibtex":"@article{Cox_Kaimann_2015, title={How do reviews from professional critics interact with other signals of product quality? Evidence from the video game industry}, volume={14}, DOI={<a href=\"https://doi.org/10.1002/cb.1553\">10.1002/cb.1553</a>}, number={6}, journal={Journal of Consumer Behaviour}, publisher={Wiley Online Library}, author={Cox, Joe and Kaimann, Daniel}, year={2015}, pages={366–377} }","short":"J. Cox, D. Kaimann, Journal of Consumer Behaviour 14 (2015) 366–377.","apa":"Cox, J., &#38; Kaimann, D. (2015). How do reviews from professional critics interact with other signals of product quality? Evidence from the video game industry. <i>Journal of Consumer Behaviour</i>, <i>14</i>(6), 366–377. <a href=\"https://doi.org/10.1002/cb.1553\">https://doi.org/10.1002/cb.1553</a>"},"intvolume":"        14","page":"366-377","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Journal of Consumer Behaviour","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"288-Cox_et_al-2015-Journal_of_Consumer_Behaviour.pdf","file_id":"1467","file_size":386704,"date_created":"2018-03-21T09:24:24Z","creator":"florida","date_updated":"2018-03-21T09:24:24Z"}],"abstract":[{"text":"Experience goods are characterised by information asymmetry and a lack of ex ante knowledge of product quality, such that reliable external signals of quality are likely to be highly valued. Two potentially credible sources of such information are reviews from professional critics and ‘word of mouth’ from other consumers. This paper makes a direct comparison between the relative influences and interactions of reviews from both of these sources on the sales performance of video game software. In order to empirically estimate and separate the effects of the two signals, we analyze a sample of 1480 video games and their sales figures between 2004 and 2010. We find evidence to suggest that even after taking steps to control for endogeneity, reviews from professional critics have a significantly positive influence on sales which outweighs that from consumer reviews. We also find evidence to suggest that reviews from professional critics also interact significantly with other signals of product quality. Consequently, we contend that professional critics adopt the role of an influencer, whereas word-of-mouth opinion acts more as a predictor of sales in the market for video games.","lang":"eng"}],"date_created":"2017-10-17T12:41:48Z","publisher":"Wiley Online Library","title":"How do reviews from professional critics interact with other signals of product quality? Evidence from the video game industry","issue":"6","year":"2015"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:22:36Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"289","user_id":"16205","department":[{"_id":"276"}],"abstract":[{"lang":"eng","text":"We examine the effect of the variance of consumer ratings on product pricing and sales using an analytical model, which considers goods that are characterized by experience attributes and informed search attributes (i.e., experience attributes that were transformed in search attributes by consumer ratings). For pure informed search goods, equilibrium price increases and demand decreases in variance. For pure experience goods, equilibrium price and demand decrease in variance. For hybrid goods with low total variance, equilibrium price and demand increase with an increasing relative share of variance caused by informed search attributes when the average rating and total variance of ratings are held constant. Hence, risk-averse consumers may prefer a more expensive good with a higher variance of ratings out of two similar goods with the same average rating. Moreover, our analytical model provides a theoretical foundation for the empirically observed j-shaped distribution of consumer ratings in electronic commerce."}],"file":[{"date_updated":"2018-03-21T09:22:36Z","creator":"florida","date_created":"2018-03-21T09:22:36Z","file_size":349683,"access_level":"closed","file_name":"289-How_do_Different_Sources_of_the_Variance_of_Consumer_Ratings_Matt.pdf","file_id":"1465","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth","title":"How do Different Sources of the Variance of Consumer Ratings Matter?","conference":{"location":"Forth Worth, USA","name":"36th International Conference on Information Systems (ICIS)"},"date_updated":"2022-01-06T06:58:40Z","author":[{"full_name":"Herrmann, Philipp","last_name":"Herrmann","first_name":"Philipp"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"first_name":"Steffen","last_name":"Zimmermann","full_name":"Zimmermann, Steffen"},{"full_name":"Nault, Barry","last_name":"Nault","first_name":"Barry"}],"date_created":"2017-10-17T12:41:48Z","year":"2015","citation":{"bibtex":"@inproceedings{Herrmann_Kundisch_Zimmermann_Nault_2015, title={How do Different Sources of the Variance of Consumer Ratings Matter?}, booktitle={Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth}, author={Herrmann, Philipp and Kundisch, Dennis and Zimmermann, Steffen and Nault, Barry}, year={2015} }","short":"P. Herrmann, D. Kundisch, S. Zimmermann, B. Nault, in: Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth, 2015.","mla":"Herrmann, Philipp, et al. “How Do Different Sources of the Variance of Consumer Ratings Matter?” <i>Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>, 2015.","apa":"Herrmann, P., Kundisch, D., Zimmermann, S., &#38; Nault, B. (2015). How do Different Sources of the Variance of Consumer Ratings Matter? In <i>Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>. Forth Worth, USA.","ieee":"P. Herrmann, D. Kundisch, S. Zimmermann, and B. Nault, “How do Different Sources of the Variance of Consumer Ratings Matter?,” in <i>Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>, Forth Worth, USA, 2015.","chicago":"Herrmann, Philipp, Dennis Kundisch, Steffen Zimmermann, and Barry Nault. “How Do Different Sources of the Variance of Consumer Ratings Matter?” In <i>Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>, 2015.","ama":"Herrmann P, Kundisch D, Zimmermann S, Nault B. How do Different Sources of the Variance of Consumer Ratings Matter? In: <i>Proceedings of the 36th International Conference on Information Systems (ICIS), Fort Worth</i>. ; 2015."},"has_accepted_license":"1"},{"year":"2015","citation":{"ieee":"C. Osburg, <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.","chicago":"Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.","ama":"Osburg C. <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen</i>. Universität Paderborn; 2015.","mla":"Osburg, Christina. <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen</i>. Universität Paderborn, 2015.","bibtex":"@book{Osburg_2015, title={Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen}, publisher={Universität Paderborn}, author={Osburg, Christina}, year={2015} }","short":"C. Osburg, Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen, Universität Paderborn, 2015.","apa":"Osburg, C. (2015). <i>Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:58:47Z","publisher":"Universität Paderborn","author":[{"full_name":"Osburg, Christina","last_name":"Osburg","first_name":"Christina"}],"date_created":"2017-10-17T12:41:49Z","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"title":"Fusionen von gesetzlichen Krankenversicherungen zu den Effizienz- und Wechselwirkungen","type":"mastersthesis","status":"public","_id":"292","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"ger"}]},{"status":"public","type":"bachelorsthesis","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":"294","user_id":"42447","department":[{"_id":"280"}],"year":"2015","citation":{"mla":"Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>. Universität Paderborn, 2015.","short":"G. Materna, Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik, Universität Paderborn, 2015.","bibtex":"@book{Materna_2015, title={Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik}, publisher={Universität Paderborn}, author={Materna, GinaJoanna}, year={2015} }","apa":"Materna, G. (2015). <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>. Universität Paderborn.","chicago":"Materna, GinaJoanna. <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>. Universität Paderborn, 2015.","ieee":"G. Materna, <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>. Universität Paderborn, 2015.","ama":"Materna G. <i>Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik</i>. Universität Paderborn; 2015."},"title":"Fair Trade - Eine neue Perspektive in der internationalen Handelspolitik","date_updated":"2022-01-06T06:58:48Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2017-10-17T12:41:49Z","author":[{"first_name":"GinaJoanna","last_name":"Materna","full_name":"Materna, GinaJoanna"}]},{"date_created":"2017-10-17T12:41:49Z","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"author":[{"first_name":"Patricia","last_name":"Goronczewski","full_name":"Goronczewski, Patricia"}],"date_updated":"2022-01-06T06:58:48Z","publisher":"Universität Paderborn","title":"Fair Trade - An economic investigation of benefits and drawbacks","citation":{"ama":"Goronczewski P. <i>Fair Trade - An Economic Investigation of Benefits and Drawbacks</i>. Universität Paderborn; 2015.","ieee":"P. Goronczewski, <i>Fair Trade - An economic investigation of benefits and drawbacks</i>. Universität Paderborn, 2015.","chicago":"Goronczewski, Patricia. <i>Fair Trade - An Economic Investigation of Benefits and Drawbacks</i>. Universität Paderborn, 2015.","mla":"Goronczewski, Patricia. <i>Fair Trade - An Economic Investigation of Benefits and Drawbacks</i>. Universität Paderborn, 2015.","short":"P. Goronczewski, Fair Trade - An Economic Investigation of Benefits and Drawbacks, Universität Paderborn, 2015.","bibtex":"@book{Goronczewski_2015, title={Fair Trade - An economic investigation of benefits and drawbacks}, publisher={Universität Paderborn}, author={Goronczewski, Patricia}, year={2015} }","apa":"Goronczewski, P. (2015). <i>Fair Trade - An economic investigation of benefits and drawbacks</i>. Universität Paderborn."},"year":"2015","user_id":"42447","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"295","type":"bachelorsthesis","status":"public"},{"title":"Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2017-10-17T12:41:50Z","author":[{"first_name":"Dennis","full_name":"Plonka, Dennis","last_name":"Plonka"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:50Z","citation":{"apa":"Plonka, D. (2015). <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn.","short":"D. Plonka, Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit, Universität Paderborn, 2015.","mla":"Plonka, Dennis. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn, 2015.","bibtex":"@book{Plonka_2015, title={Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit}, publisher={Universität Paderborn}, author={Plonka, Dennis}, year={2015} }","chicago":"Plonka, Dennis. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn, 2015.","ieee":"D. Plonka, <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn, 2015.","ama":"Plonka D. <i>Entwicklung von Ablösesummen und Gehälter in der Fußball-Bundesliga - Salary Caps als mögliches Modell der Chancengleichheit</i>. Universität Paderborn; 2015."},"year":"2015","language":[{"iso":"ger"}],"department":[{"_id":"280"}],"user_id":"42447","_id":"298","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"bachelorsthesis"},{"date_updated":"2022-01-06T06:58:53Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:51Z","author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Dynamics and Efficiency in Topological Self-Stabilization","has_accepted_license":"1","year":"2015","citation":{"apa":"Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn.","bibtex":"@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }","mla":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","short":"A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015.","ama":"Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015."},"_id":"304","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:46:19Z","type":"dissertation","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":2275834,"file_name":"304-Dissertation_-_Koutsopoulos.pdf","access_level":"closed","file_id":"1441","date_updated":"2018-03-20T07:46:19Z","creator":"florida","date_created":"2018-03-20T07:46:19Z"}]},{"_id":"305","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-13T09:14:43Z","type":"dissertation","status":"public","file":[{"file_size":1709094,"file_id":"1206","file_name":"305-Dissertation_-_Kniesburges.pdf","access_level":"closed","date_updated":"2018-03-13T09:14:43Z","date_created":"2018-03-13T09:14:43Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:58:54Z","publisher":"Universität Paderborn","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"}],"date_created":"2017-10-17T12:41:51Z","title":"Distributed Data Structures and the Power of topological Self-Stabilization","has_accepted_license":"1","year":"2015","citation":{"ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015.","bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn."}}]