[{"_id":"185","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:53:36Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:28Z","author":[{"full_name":"Schmidt, Christopher","last_name":"Schmidt","first_name":"Christopher"}],"title":"Kundenbewertungen im Online-Handel – Alles Betrug?","year":"2016","citation":{"chicago":"Schmidt, Christopher. <i>Kundenbewertungen im Online-Handel – Alles Betrug?</i> Universität Paderborn, 2016.","ieee":"C. Schmidt, <i>Kundenbewertungen im Online-Handel – Alles Betrug?</i> Universität Paderborn, 2016.","ama":"Schmidt C. <i>Kundenbewertungen im Online-Handel – Alles Betrug?</i> Universität Paderborn; 2016.","apa":"Schmidt, C. (2016). <i>Kundenbewertungen im Online-Handel – Alles Betrug?</i> Universität Paderborn.","bibtex":"@book{Schmidt_2016, title={Kundenbewertungen im Online-Handel – Alles Betrug?}, publisher={Universität Paderborn}, author={Schmidt, Christopher}, year={2016} }","mla":"Schmidt, Christopher. <i>Kundenbewertungen im Online-Handel – Alles Betrug?</i> Universität Paderborn, 2016.","short":"C. Schmidt, Kundenbewertungen im Online-Handel – Alles Betrug?, Universität Paderborn, 2016."}},{"citation":{"ama":"Hesso A. <i>Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen</i>. Universität Paderborn; 2016.","ieee":"A. Hesso, <i>Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen</i>. Universität Paderborn, 2016.","chicago":"Hesso, Aref. <i>Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen</i>. Universität Paderborn, 2016.","bibtex":"@book{Hesso_2016, title={Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen}, publisher={Universität Paderborn}, author={Hesso, Aref}, year={2016} }","short":"A. Hesso, Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen, Universität Paderborn, 2016.","mla":"Hesso, Aref. <i>Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen</i>. Universität Paderborn, 2016.","apa":"Hesso, A. (2016). <i>Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen</i>. Universität Paderborn."},"year":"2016","author":[{"first_name":"Aref","full_name":"Hesso, Aref","last_name":"Hesso"}],"date_created":"2018-04-10T09:56:14Z","date_updated":"2022-01-06T06:55:39Z","publisher":"Universität Paderborn","title":"Die Rolle der Reputation: Die Entstehung, der Aufbau, die Messung und die Auswirkung der Reputation auf Kunden und Unternehmen","type":"mastersthesis","status":"public","department":[{"_id":"19"}],"user_id":"477","_id":"2271","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"language":[{"iso":"ger"}]},{"author":[{"first_name":"Matthias","last_name":"Keller","full_name":"Keller, Matthias"}],"supervisor":[{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:41:34Z","date_updated":"2022-01-06T06:55:22Z","publisher":"Universität Paderborn","title":"Application Deployment at Distributed Clouds","has_accepted_license":"1","citation":{"chicago":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","ieee":"M. Keller, <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","ama":"Keller M. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn; 2016.","mla":"Keller, Matthias. <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn, 2016.","bibtex":"@book{Keller_2016, title={Application Deployment at Distributed Clouds}, publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }","short":"M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn, 2016.","apa":"Keller, M. (2016). <i>Application Deployment at Distributed Clouds</i>. Universität Paderborn."},"year":"2016","department":[{"_id":"75"}],"user_id":"477","_id":"220","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T10:37:11Z","ddc":["040"],"type":"dissertation","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":7467820,"file_name":"220-Keller_PhD-Theses_01.pdf","access_level":"closed","file_id":"1513","date_updated":"2018-03-21T10:37:11Z","creator":"florida","date_created":"2018-03-21T10:37:11Z"}]},{"quality_controlled":"1","issue":"1","year":"2016","publisher":"Journal of Graph Algorithms and Applications","date_created":"2018-11-19T15:33:50Z","title":"The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree","publication":"Journal of Graph Algorithms and Applications","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 that is closely related to the over thirty-year-old idea of splay trees and evaluate its adaption performance in the distributed scenario if different communication patterns are provided. \r\nTo 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. \r\nWe show that, in general, the game (i.e., the process of local adjustments) does not converge, and that convergence is related to certain structures of the communication interests, which we call conflicts. \r\nWe classify conflicts and show that for two communication scenarios in which convergence is guaranteed, the self-adjusting tree performs well. \r\nFurthermore, 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.\r\nHowever, for the other conflict classes, a distributed self-adjusting binary search tree adapts poorly.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"Strothmann2016.20.1.pdf","file_id":"5912","file_size":2324066,"date_created":"2018-11-27T11:58:08Z","creator":"thim","date_updated":"2018-11-27T11:58:08Z"}],"ddc":["040"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1526-1719"]},"has_accepted_license":"1","citation":{"apa":"Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. <i>Journal of Graph Algorithms and Applications</i>, <i>20</i>(1), 79–100. <a href=\"https://doi.org/10.7155/jgaa.00385\">https://doi.org/10.7155/jgaa.00385</a>","short":"T.F. Strothmann, Journal of Graph Algorithms and Applications 20 (2016) 79–100.","bibtex":"@article{Strothmann_2016, title={The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree}, volume={20}, DOI={<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>}, number={1}, journal={Journal of Graph Algorithms and Applications}, publisher={Journal of Graph Algorithms and Applications}, author={Strothmann, Thim Frederik}, year={2016}, pages={79–100} }","mla":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree.” <i>Journal of Graph Algorithms and Applications</i>, vol. 20, no. 1, Journal of Graph Algorithms and Applications, 2016, pp. 79–100, doi:<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>.","ama":"Strothmann TF. The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. <i>Journal of Graph Algorithms and Applications</i>. 2016;20(1):79-100. doi:<a href=\"https://doi.org/10.7155/jgaa.00385\">10.7155/jgaa.00385</a>","ieee":"T. F. Strothmann, “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree,” <i>Journal of Graph Algorithms and Applications</i>, vol. 20, no. 1, pp. 79–100, 2016.","chicago":"Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree.” <i>Journal of Graph Algorithms and Applications</i> 20, no. 1 (2016): 79–100. <a href=\"https://doi.org/10.7155/jgaa.00385\">https://doi.org/10.7155/jgaa.00385</a>."},"page":"79-100","intvolume":"        20","date_updated":"2022-01-06T07:02:38Z","author":[{"id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik"}],"volume":20,"doi":"10.7155/jgaa.00385","type":"journal_article","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"5762","user_id":"477","department":[{"_id":"79"}],"file_date_updated":"2018-11-27T11:58:08Z"},{"file":[{"date_updated":"2019-01-29T14:38:25Z","date_created":"2019-01-29T14:38:25Z","creator":"abursig","file_size":83968,"access_level":"closed","file_id":"7242","file_name":"Rating Variance_CIST_Abstract.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference_abstract","publication":"Workshop on IS Design and Economic Behavior (ISDEB)","ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-29T14:38:25Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"4374","user_id":"477","department":[{"_id":"276"}],"year":"2016","citation":{"bibtex":"@inproceedings{Zimmermann_Herrmann_Kundisch_Nault_2016, title={How do different Sources of the Variance of Online Consumer Ratings matter?}, booktitle={Workshop on IS Design and Economic Behavior (ISDEB)}, author={Zimmermann, Steffen and Herrmann, Philipp and Kundisch, Dennis and Nault, Barrie}, year={2016} }","short":"S. Zimmermann, P. Herrmann, D. Kundisch, B. Nault, in: Workshop on IS Design and Economic Behavior (ISDEB), 2016.","mla":"Zimmermann, Steffen, et al. “How Do Different Sources of the Variance of Online Consumer Ratings Matter?” <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2016.","apa":"Zimmermann, S., Herrmann, P., Kundisch, D., &#38; Nault, B. (2016). How do different Sources of the Variance of Online Consumer Ratings matter? In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. Ilmenau, Germany.","chicago":"Zimmermann, Steffen, Philipp Herrmann, Dennis Kundisch, and Barrie Nault. “How Do Different Sources of the Variance of Online Consumer Ratings Matter?” In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2016.","ieee":"S. Zimmermann, P. Herrmann, D. Kundisch, and B. Nault, “How do different Sources of the Variance of Online Consumer Ratings matter?,” in <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, Ilmenau, Germany, 2016.","ama":"Zimmermann S, Herrmann P, Kundisch D, Nault B. How do different Sources of the Variance of Online Consumer Ratings matter? In: <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. ; 2016."},"quality_controlled":"1","has_accepted_license":"1","title":"How do different Sources of the Variance of Online Consumer Ratings matter?","conference":{"location":"Ilmenau, Germany","name":"Workshop on IS Design and Economic Behavior (ISDEB)"},"date_updated":"2022-01-06T07:00:59Z","author":[{"last_name":"Zimmermann","full_name":"Zimmermann, Steffen","first_name":"Steffen"},{"last_name":"Herrmann","full_name":"Herrmann, Philipp","first_name":"Philipp"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"},{"last_name":"Nault","full_name":"Nault, Barrie","first_name":"Barrie"}],"date_created":"2018-09-10T13:02:44Z"},{"_id":"5407","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","date_created":"2018-11-07T09:45:57Z","author":[{"full_name":"Koepe, Jörn","last_name":"Koepe","first_name":"Jörn"}],"title":"Price-Based Allocation Games","year":"2016","citation":{"ama":"Koepe J. <i>Price-Based Allocation Games</i>. Universität Paderborn; 2016.","ieee":"J. Koepe, <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","chicago":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","mla":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","apa":"Koepe, J. (2016). <i>Price-Based Allocation Games</i>. Universität Paderborn."}},{"type":"mastersthesis","status":"public","_id":"688","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2016","citation":{"apa":"Kutzias, D. (2016). <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn.","mla":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","chicago":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","ieee":"D. Kutzias, <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","ama":"Kutzias D. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn; 2016."},"date_updated":"2022-01-06T07:03:23Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-11-14T06:50:35Z","author":[{"full_name":"Kutzias, Damian","last_name":"Kutzias","first_name":"Damian"}],"title":"Friendship Processes in Network Creation Games"},{"user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"689","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2017-11-14T06:51:37Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"id":"30291","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer","first_name":"Johannes Sebastian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:23Z","title":"Routing Algorithms on Delayed Networks for Disaster Management Support","citation":{"bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","mla":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","apa":"Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn.","ama":"Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn; 2016.","chicago":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","ieee":"J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016."},"year":"2016"},{"citation":{"chicago":"Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016.","ieee":"T. Handirk, <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016.","ama":"Handirk T. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn; 2016.","mla":"Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016.","bibtex":"@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }","short":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016.","apa":"Handirk, T. (2016). <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn."},"year":"2016","title":"Über die Rolle von Informationen in Verkehrsnetzwerken","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_created":"2017-12-19T10:10:17Z","author":[{"first_name":"Tobias","last_name":"Handirk","full_name":"Handirk, Tobias"}],"date_updated":"2022-01-06T06:50:51Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1082","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"128","project":[{"_id":"1","name":"SFB 901"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","year":"2016","citation":{"ama":"Bernhardt K. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn; 2016.","ieee":"K. Bernhardt, <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016.","chicago":"Bernhardt, Katharina. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016.","bibtex":"@book{Bernhardt_2016, title={Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}, publisher={Universität Paderborn}, author={Bernhardt, Katharina}, year={2016} }","short":"K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen, Universität Paderborn, 2016.","mla":"Bernhardt, Katharina. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016.","apa":"Bernhardt, K. (2016). <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn."},"title":"Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen","date_updated":"2022-01-06T06:51:20Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:16Z","author":[{"first_name":"Katharina","last_name":"Bernhardt","full_name":"Bernhardt, Katharina"}]},{"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"130","user_id":"42447","department":[{"_id":"280"}],"status":"public","type":"mastersthesis","title":"Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce","date_updated":"2022-01-06T06:51:27Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:17Z","author":[{"last_name":"Kaczorkowski","full_name":"Kaczorkowski, Jessica","first_name":"Jessica"}],"supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"year":"2016","citation":{"ieee":"J. Kaczorkowski, <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016.","chicago":"Kaczorkowski, Jessica. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016.","ama":"Kaczorkowski J. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn; 2016.","apa":"Kaczorkowski, J. (2016). <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn.","short":"J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce, Universität Paderborn, 2016.","bibtex":"@book{Kaczorkowski_2016, title={Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce}, publisher={Universität Paderborn}, author={Kaczorkowski, Jessica}, year={2016} }","mla":"Kaczorkowski, Jessica. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016."}},{"intvolume":"       353","citation":{"ieee":"A. Cord-Landwehr, <i>Selfish Network Creation - On Variants of Network Creation Games</i>, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","chicago":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","ama":"Cord-Landwehr A. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","apa":"Cord-Landwehr, A. (2016). <i>Selfish Network Creation - On Variants of Network Creation Games</i> (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016."},"publication_identifier":{"isbn":["978-3-942647-72-4"]},"has_accepted_license":"1","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089","relation":"confirmation"}]},"date_updated":"2022-01-06T06:52:23Z","volume":353,"author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"status":"public","type":"dissertation","file_date_updated":"2018-03-21T12:52:03Z","_id":"154","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","year":"2016","title":"Selfish Network Creation - On Variants of Network Creation Games","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2017-10-17T12:41:22Z","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T12:52:03Z","creator":"florida","date_updated":"2018-03-21T12:52:03Z","file_name":"154-dissertation.pdf","access_level":"closed","file_id":"1551","file_size":800101}],"ddc":["040"],"language":[{"iso":"eng"}]},{"user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"159","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:48:02Z","ddc":["040"],"type":"journal_article","publication":"IEEE/ACM Transactions on Networking","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","file_id":"1547","access_level":"closed","file_size":1655309,"date_created":"2018-03-21T12:48:02Z","creator":"florida","date_updated":"2018-03-21T12:48:02Z"}],"status":"public","abstract":[{"text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived.","lang":"eng"}],"author":[{"last_name":"Harks","full_name":"Harks, Tobias","first_name":"Tobias"},{"first_name":"Martin","full_name":"Höfer, Martin","last_name":"Höfer"},{"last_name":"Schewior","full_name":"Schewior, Kevin","first_name":"Kevin"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:41:23Z","date_updated":"2022-01-06T06:52:40Z","publisher":"IEEE","doi":"10.1109/TNET.2015.2468571","title":"Routing Games With Progressive Filling","issue":"4","has_accepted_license":"1","citation":{"apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2016). Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>, (4), 2553–2562. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4, IEEE, 2016, pp. 2553–62, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” <i>IEEE/ACM Transactions on Networking</i>, no. 4, pp. 2553–2562, 2016.","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” <i>IEEE/ACM Transactions on Networking</i>, no. 4 (2016): 2553–62. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. <i>IEEE/ACM Transactions on Networking</i>. 2016;(4):2553-2562. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>"},"page":"2553 - 2562","year":"2016"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:55:43Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"149","user_id":"477","series_title":"LNCS","department":[{"_id":"63"},{"_id":"541"}],"abstract":[{"lang":"eng","text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α)."}],"file":[{"date_created":"2018-03-21T12:55:43Z","creator":"florida","date_updated":"2018-03-21T12:55:43Z","access_level":"closed","file_id":"1553","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","file_size":236253,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"conference","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","title":"Strategic Online Facility Location","doi":"10.1007/978-3-319-48749-6_43","date_updated":"2022-01-06T06:52:10Z","date_created":"2017-10-17T12:41:21Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"year":"2016","citation":{"ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:593--607. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607.","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 593--607. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 593--607, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">10.1007/978-3-319-48749-6_43</a>.","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","apa":"Drees, M., Feldkord, B., &#38; Skopalik, A. (2016). Strategic Online Facility Location. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 593--607). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_43\">https://doi.org/10.1007/978-3-319-48749-6_43</a>"},"page":"593--607","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_created":"2018-11-02T15:57:25Z","creator":"ups","date_updated":"2018-11-02T15:57:25Z","file_id":"5318","access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","file_size":654903,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).","lang":"eng"}],"publication":"Journal of Combinatorial Optimization","title":"Towards the price of leasing online","date_created":"2017-10-17T12:41:18Z","publisher":"Springer","year":"2016","issue":"4","file_date_updated":"2018-11-02T15:57:25Z","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"139","status":"public","type":"journal_article","doi":"10.1007/s10878-015-9915-5","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Peter ","full_name":"Pietrzyk, Peter ","last_name":"Pietrzyk"}],"date_updated":"2022-01-06T06:51:46Z","citation":{"apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk, P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>, (4), 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>.","bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216. doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>","chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>.","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>, no. 4, pp. 1197--1216, 2016."},"page":" 1197--1216","has_accepted_license":"1"},{"has_accepted_license":"1","citation":{"short":"C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84.","mla":"Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84, doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>}, booktitle={Proceedings of the 30th International Symposium on Distributed Computing (DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}, year={2016}, pages={71--84}, collection={LNCS} }","apa":"Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i> (pp. 71--84). <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>","ama":"Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In: <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2016:71--84. doi:<a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">10.1007/978-3-662-53426-7_6</a>","ieee":"C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks,” in <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 2016, pp. 71--84.","chicago":"Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” In <i>Proceedings of the 30th International Symposium on Distributed Computing (DISC)</i>, 71--84. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53426-7_6\">https://doi.org/10.1007/978-3-662-53426-7_6</a>."},"page":"71--84","year":"2016","date_created":"2017-10-17T12:41:19Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:51:56Z","doi":"10.1007/978-3-662-53426-7_6","title":"Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks","type":"conference","publication":"Proceedings of the 30th International Symposium on Distributed Computing (DISC)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T12:59:29Z","date_created":"2018-03-21T12:59:29Z","creator":"florida","file_size":209638,"access_level":"closed","file_id":"1558","file_name":"142-SchSetStrDISC16.pdf"}],"status":"public","abstract":[{"text":"For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that have the advantage of being able to recover from any illegal state. However, the vast majority of these networks cannot give any guarantees on its functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific identifier are answered successfully if a node with that identifier exists in the network. We investigate overlay networks that are not only self-stabilizing but that also ensure that monotonic 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. Monotonic searchability was recently introduced in OPODIS 2015, in which the authors provide a solution for a simple line topology.We present the first universal approach to maintain monotonic searchability that is applicable to a wide range of topologies. As the base for our approach, we introduce a set of primitives for manipulating overlay networks that allows us to maintain searchability and show how existing protocols can be transformed to use theses primitives.We complement this result with a generic search protocol that together with the use of our primitives guarantees monotonic searchability.As an additional feature, searching existing nodes with the generic search protocol is as fast as searching a node with any other fixed routing protocol once the topology has stabilized.","lang":"eng"}],"series_title":"LNCS","user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"142","file_date_updated":"2018-03-21T12:59:29Z","language":[{"iso":"eng"}],"ddc":["040"]},{"department":[{"_id":"63"}],"user_id":"477","series_title":"LNCS","_id":"143","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:20:45Z","ddc":["000"],"publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","type":"conference","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5269","file_name":"TheMonotoneCircuitValueProblem.pdf","file_size":234587,"creator":"ups","date_created":"2018-11-02T14:20:45Z","date_updated":"2018-11-02T14:20:45Z"}],"abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}],"date_created":"2017-10-17T12:41:19Z","author":[{"first_name":"Faisal N. ","last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. "},{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"first_name":"Christine","full_name":"Markarian, Christine","id":"37612","last_name":"Markarian"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"date_updated":"2022-01-06T06:51:57Z","doi":"10.1007/978-3-319-42634-1_8","title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","has_accepted_license":"1","page":"92-102","citation":{"ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>. LNCS. ; 2016:92-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102.","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 92–102. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i> (pp. 92–102). <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>","mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N.  and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }"},"year":"2016"},{"volume":634,"author":[{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"},{"first_name":"Marios","last_name":"Mavronicolas","full_name":"Mavronicolas, Marios"}],"date_created":"2017-10-17T12:41:20Z","publisher":"Elsevier","date_updated":"2022-01-06T06:51:59Z","doi":"10.1016/j.tcs.2016.04.013","title":"The complexity of equilibria for risk-modeling valuations","has_accepted_license":"1","intvolume":"       634","page":"67-96","citation":{"apa":"Monien, B., &#38; Mavronicolas, M. (2016). The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>, <i>634</i>, 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>","bibtex":"@article{Monien_Mavronicolas_2016, title={The complexity of equilibria for risk-modeling valuations}, volume={634}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Monien, Burkhard and Mavronicolas, Marios}, year={2016}, pages={67–96} }","short":"B. Monien, M. Mavronicolas, Theoretical Computer Science 634 (2016) 67–96.","mla":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i>, vol. 634, Elsevier, 2016, pp. 67–96, doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>.","chicago":"Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Equilibria for Risk-Modeling Valuations.” <i>Theoretical Computer Science</i> 634 (2016): 67–96. <a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">https://doi.org/10.1016/j.tcs.2016.04.013</a>.","ieee":"B. Monien and M. Mavronicolas, “The complexity of equilibria for risk-modeling valuations,” <i>Theoretical Computer Science</i>, vol. 634, pp. 67–96, 2016.","ama":"Monien B, Mavronicolas M. The complexity of equilibria for risk-modeling valuations. <i>Theoretical Computer Science</i>. 2016;634:67-96. doi:<a href=\"https://doi.org/10.1016/j.tcs.2016.04.013\">10.1016/j.tcs.2016.04.013</a>"},"year":"2016","user_id":"42447","_id":"144","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-21T12:58:42Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Theoretical Computer Science","type":"journal_article","status":"public","file":[{"file_id":"1557","file_name":"144-Monien_Mavronicolas-TCS2016_01.pdf","access_level":"closed","file_size":633599,"date_created":"2018-03-21T12:58:42Z","creator":"florida","date_updated":"2018-03-21T12:58:42Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider risk-averse players seeking to minimize the sum V=E+R of expectationE and a risk valuationR of their costs; R is non-negative and vanishes exactly when the cost incurred to a player is constant over all choices of strategies by the other players. In a V-equilibrium, no player could unilaterally reduce her cost.Say that V has the Weak-Equilibrium-for-Expectation property if all strategies supported in a player's best-response mixed strategy incur the same conditional expectation of her cost. We introduce E-strict concavity and observe that every E-strictly concave valuation has the Weak-Equilibrium-for-Expectation property. We focus on a broad class of valuations shown to have the Weak-Equilibrium-for-Expectation property, which we exploit to prove two main complexity results, the first of their kind, for the two simplest cases of the problem:• Two strategies: Deciding the existence of a V-equilibrium is strongly NP-hard for the restricted class of player-specific scheduling games on two ordered links [22], when choosing R as (1)Var (variance), or (2)SD (standard deviation), or (3) a concave linear sum of even moments of small order.• Two players: Deciding the existence of a V-equilibrium is strongly NP-hard when choosing R as (1)γ⋅Var, or (2)γ⋅SD, where γ>0 is the risk-coefficient, or choosing V as (3) a convex combination of E+γ⋅Var and the concave ν-valuationν−1(E(ν(⋅))), where ν(x)=xr, with r≥2. This is a concrete consequence of a general strong NP-hardness result that only needs the Weak-Equilibrium-for-Expectation property and a few additional properties for V; its proof involves a reduction with a single parameter, which can be chosen efficiently so that each valuation satisfies the additional properties.","lang":"eng"}]},{"type":"journal_article","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"145","user_id":"14052","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-03-21T12:57:57Z","publication_status":"published","has_accepted_license":"1","citation":{"bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>.","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","apa":"Feldotto, M., &#38; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>, <i>28</i>(5), 1655–1677. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. <i>Concurrency and Computation: Practice and Experience</i>. 2016;28(5):1655-1677. doi:<a href=\"https://doi.org/10.1002/cpe.3716\">10.1002/cpe.3716</a>","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Concurrency and Computation: Practice and Experience</i> 28, no. 5 (2016): 1655–77. <a href=\"https://doi.org/10.1002/cpe.3716\">https://doi.org/10.1002/cpe.3716</a>.","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” <i>Concurrency and Computation: Practice and Experience</i>, vol. 28, no. 5, pp. 1655–1677, 2016."},"intvolume":"        28","page":"1655-1677","date_updated":"2022-01-06T06:52:00Z","author":[{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"volume":28,"doi":"10.1002/cpe.3716","publication":"Concurrency and Computation: Practice and Experience","abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. "}],"file":[{"date_updated":"2018-03-21T12:57:57Z","date_created":"2018-03-21T12:57:57Z","creator":"florida","file_size":3121363,"access_level":"closed","file_id":"1556","file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"ddc":["040"],"issue":"5","year":"2016","publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:20Z","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM"},{"type":"bachelorsthesis","year":"2016","citation":{"bibtex":"@book{Holzmann_2016, title={Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren}, publisher={Universität Paderborn}, author={Holzmann, Annabel}, year={2016} }","mla":"Holzmann, Annabel. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016.","short":"A. Holzmann, Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren, Universität Paderborn, 2016.","apa":"Holzmann, A. (2016). <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn.","ama":"Holzmann A. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn; 2016.","ieee":"A. Holzmann, <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016.","chicago":"Holzmann, Annabel. <i>Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren</i>. Universität Paderborn, 2016."},"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T06:51:28Z","publisher":"Universität Paderborn","_id":"131","date_created":"2017-10-17T12:41:17Z","author":[{"last_name":"Holzmann","full_name":"Holzmann, Annabel","first_name":"Annabel"}],"user_id":"477","title":"Wenn 1+1 nicht 2 ergibt – Gestaltungsmöglichkeiten Einzelbewertungen in Reputationssystemen zu Gesamtbewertungen zu aggregieren","language":[{"iso":"ger"}]}]