[{"_id":"3098","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"},{"_id":"475"}],"user_id":"477","series_title":"Studies in Economic Design","file_date_updated":"2018-08-09T09:14:11Z","type":"book_chapter","editor":[{"first_name":"Jean-Francois","last_name":"Laslier","full_name":"Laslier, Jean-Francois"},{"last_name":"Moulin","full_name":"Moulin, Herve","first_name":"Herve"},{"full_name":"Sanver, Remzi","last_name":"Sanver","first_name":"Remzi"},{"first_name":"William","last_name":"Zwicker","full_name":"Zwicker, William"}],"urn":"30987","status":"public","date_updated":"2022-01-06T06:58:55Z","volume":"(n.d.)","author":[{"last_name":"Trockel","full_name":"Trockel, Walter","first_name":"Walter"},{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"publication_identifier":{"issn":["2510-3970"]},"has_accepted_license":"1","publication_status":"accepted","place":"Heidelberg","citation":{"apa":"Trockel, W., &#38; Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F. Laslier, H. Moulin, R. Sanver, &#38; W. Zwicker (Eds.), <i>Studies in Economic Design</i> (Vol. (n.d.)). Heidelberg: Springer.","bibtex":"@inbook{Trockel_Haake, place={Heidelberg}, series={Studies in Economic Design}, title={Thoughts on Social Design}, volume={(n.d.)}, booktitle={Studies in Economic Design}, publisher={Springer}, author={Trockel, Walter and Haake, Claus-Jochen}, editor={Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi and Zwicker, WilliamEditors}, collection={Studies in Economic Design} }","short":"W. Trockel, C.-J. Haake, in: J.-F. Laslier, H. Moulin, R. Sanver, W. Zwicker (Eds.), Studies in Economic Design, Springer, Heidelberg, n.d.","mla":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier et al., vol. (n.d.), Springer.","ama":"Trockel W, Haake C-J. Thoughts on Social Design. In: Laslier J-F, Moulin H, Sanver R, Zwicker W, eds. <i>Studies in Economic Design</i>. Vol (n.d.). Studies in Economic Design. Heidelberg: Springer.","chicago":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” In <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier, Herve Moulin, Remzi Sanver, and William Zwicker, Vol. (n.d.). Studies in Economic Design. Heidelberg: Springer, n.d.","ieee":"W. Trockel and C.-J. Haake, “Thoughts on Social Design,” in <i>Studies in Economic Design</i>, vol. (n.d.), J.-F. Laslier, H. Moulin, R. Sanver, and W. Zwicker, Eds. Heidelberg: Springer."},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Studies in Economic Design","abstract":[{"lang":"eng","text":"One of the fundamental problems in applications of methods and results\r\nfrom mechanism design and implementation theory is the effective enforcement of\r\ntheoretically established equilibria by which social choice rules are implemented.\r\nHurwicz (2008) and Myerson (2009) introduce different concepts of formalizing\r\nenforcement of institutional rules via the introduction of legal and illegal games. In\r\nthis note the relation of their concepts with that of a social system defined inDebreu\r\n(1952) is analyzed and its potential of being instrumental for modelling institution\r\ndesign is discussed. The existence proof for such a system, also known as generalized\r\ngame or abstract economy had been the basis for the existence proof of a\r\ncompetitive equilibrium of an economy."}],"file":[{"creator":"cjhaake","date_created":"2018-08-09T08:36:24Z","date_updated":"2018-08-09T09:14:11Z","file_id":"3857","access_level":"closed","file_name":"WP - Thoughts on Social Design.pdf","title":"Thoughts on Social Design","file_size":141983,"content_type":"application/pdf","relation":"main_file"}],"publisher":"Springer","date_created":"2018-06-06T17:07:28Z","title":"Thoughts on Social Design","quality_controlled":"1","year":"2018"},{"year":"2018","citation":{"apa":"Schlangenotto, D. (2018). <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-312\">https://doi.org/10.17619/UNIPB/1-312</a>","short":"D. Schlangenotto, Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer, Universität Paderborn, 2018.","mla":"Schlangenotto, Darius. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>.","bibtex":"@book{Schlangenotto_2018, title={Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>}, publisher={Universität Paderborn}, author={Schlangenotto, Darius}, year={2018} }","ieee":"D. Schlangenotto, <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018.","chicago":"Schlangenotto, Darius. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-312\">https://doi.org/10.17619/UNIPB/1-312</a>.","ama":"Schlangenotto D. <i>Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-312\">10.17619/UNIPB/1-312</a>"},"title":"Consumer Responses to Paid Search - Empirical Evidence from a Bricks-and-Mortar Retailer","doi":"10.17619/UNIPB/1-312","date_updated":"2022-01-06T06:57:35Z","publisher":"Universität Paderborn","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-05-09T08:34:14Z","author":[{"full_name":"Schlangenotto, Darius","last_name":"Schlangenotto","first_name":"Darius"}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"2712","user_id":"477","department":[{"_id":"276"}]},{"status":"public","type":"dissertation","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"1138","user_id":"477","department":[{"_id":"79"}],"year":"2018","citation":{"chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018."},"title":"Distributed Algorithms for Overlay Networks and Programmable Matter","doi":"10.17619/UNIPB/1-265","date_updated":"2022-01-06T06:51:00Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"}],"date_created":"2018-01-31T06:04:03Z"},{"external_id":{"arxiv":["1710.08128"]},"language":[{"iso":"eng"}],"ddc":["040"],"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"mfeldma2","date_created":"2018-10-31T13:25:37Z","date_updated":"2018-10-31T13:25:37Z","file_name":"08425258.pdf","file_id":"5211","access_level":"closed","file_size":239559}],"abstract":[{"lang":"eng","text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n"}],"date_created":"2018-02-01T13:56:01Z","publisher":"IEEE","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","year":"2018","user_id":"11319","department":[{"_id":"79"},{"_id":"66"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"1163","file_date_updated":"2018-10-31T13:25:37Z","type":"conference","status":"public","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","id":"23538","last_name":"Feldmann"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"date_updated":"2022-01-06T06:51:05Z","doi":"10.1109/IPDPS.2018.00114","conference":{"location":"Vancouver","end_date":"2018-5-24","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"},"has_accepted_license":"1","citation":{"ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>"}},{"author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T06:51:05Z","conference":{"end_date":"2018-5-24","location":"Vancouver","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22"},"doi":"10.1109/IPDPS.2018.00113","has_accepted_license":"1","citation":{"chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>"},"user_id":"23538","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"1164","file_date_updated":"2018-10-31T13:29:26Z","type":"conference","status":"public","date_created":"2018-02-01T14:00:36Z","publisher":"IEEE","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","year":"2018","external_id":{"arxiv":["1802.07504"]},"language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T13:29:26Z","date_created":"2018-10-31T13:29:26Z","creator":"mfeldma2","file_size":218420,"file_id":"5212","file_name":"08425257.pdf","access_level":"closed"}],"abstract":[{"lang":"eng","text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests."}]},{"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"18030","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2020-08-18T08:44:22Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","citation":{"apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn.","short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018."},"year":"2018"},{"title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","author":[{"first_name":"Robin","last_name":"Wulfes","full_name":"Wulfes, Robin"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2020-08-18T08:46:50Z","year":"2018","citation":{"chicago":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ieee":"R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ama":"Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn; 2018.","short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","mla":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"_id":"18033","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","status":"public","type":"bachelorsthesis"},{"year":"2018","citation":{"chicago":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","ieee":"C. Aykanat, <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn, 2018.","ama":"Aykanat C. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn; 2018.","mla":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","bibtex":"@book{Aykanat_2018, title={Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2018} }","short":"C. Aykanat, Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht, Universität Paderborn, 2018.","apa":"Aykanat, C. (2018). <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn."},"title":"Sharing Economy - Chancen und Risiken aus ökonomischer Sicht","date_updated":"2022-01-06T07:03:50Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"date_created":"2019-02-22T09:40:39Z","author":[{"full_name":"Aykanat, Cengiz","last_name":"Aykanat","first_name":"Cengiz"}],"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"8074","user_id":"477","department":[{"_id":"280"}]},{"type":"mastersthesis","status":"public","_id":"8075","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2018","citation":{"apa":"Suvorina, T. (2018). <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn.","mla":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","bibtex":"@book{Suvorina_2018, title={Heterogeneity in Contests, Sources and Implicants}, publisher={Universität Paderborn}, author={Suvorina, Tatiana}, year={2018} }","short":"T. Suvorina, Heterogeneity in Contests, Sources and Implicants, Universität Paderborn, 2018.","ieee":"T. Suvorina, <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","chicago":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","ama":"Suvorina T. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn; 2018."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"author":[{"first_name":"Tatiana","last_name":"Suvorina","full_name":"Suvorina, Tatiana"}],"date_created":"2019-02-22T09:47:28Z","title":"Heterogeneity in Contests, Sources and Implicants"},{"department":[{"_id":"183"}],"user_id":"477","_id":"5772","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"file_date_updated":"2018-11-21T09:46:42Z","language":[{"iso":"eng"}],"ddc":["330"],"publication":"Journal of Wine Economics","type":"journal_article","status":"public","file":[{"date_updated":"2018-11-21T09:46:42Z","date_created":"2018-11-21T09:46:42Z","creator":"bhoyer","file_size":291759,"access_level":"closed","file_id":"5773","file_name":"fanasch_frick_jwe_2018.pdf","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Fanasch","full_name":"Fanasch, Patrizia","first_name":"Patrizia"},{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"}],"date_created":"2018-11-21T09:45:21Z","date_updated":"2022-01-06T07:02:40Z","publisher":"Cambridge University Press (CUP)","doi":"10.1017/jwe.2018.28","title":"What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance","publication_identifier":{"issn":["1931-4361","1931-437X"]},"has_accepted_license":"1","publication_status":"epub_ahead","page":"1-27","citation":{"ama":"Fanasch P, Frick B. What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance. <i>Journal of Wine Economics</i>. 2018:1-27. doi:<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>","ieee":"P. Fanasch and B. Frick, “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance,” <i>Journal of Wine Economics</i>, pp. 1–27, 2018.","chicago":"Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance.” <i>Journal of Wine Economics</i>, 2018, 1–27. <a href=\"https://doi.org/10.1017/jwe.2018.28\">https://doi.org/10.1017/jwe.2018.28</a>.","apa":"Fanasch, P., &#38; Frick, B. (2018). What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance. <i>Journal of Wine Economics</i>, 1–27. <a href=\"https://doi.org/10.1017/jwe.2018.28\">https://doi.org/10.1017/jwe.2018.28</a>","mla":"Fanasch, Patrizia, and Bernd Frick. “What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance.” <i>Journal of Wine Economics</i>, Cambridge University Press (CUP), 2018, pp. 1–27, doi:<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>.","short":"P. Fanasch, B. Frick, Journal of Wine Economics (2018) 1–27.","bibtex":"@article{Fanasch_Frick_2018, title={What Makes Cooperatives Successful? Identifying the Determinants of Their Organizational Performance}, DOI={<a href=\"https://doi.org/10.1017/jwe.2018.28\">10.1017/jwe.2018.28</a>}, journal={Journal of Wine Economics}, publisher={Cambridge University Press (CUP)}, author={Fanasch, Patrizia and Frick, Bernd}, year={2018}, pages={1–27} }"},"year":"2018"},{"type":"bachelorsthesis","status":"public","user_id":"65453","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5967","language":[{"iso":"ger"}],"citation":{"ama":"Koch A. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn; 2018.","ieee":"A. Koch, <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","chicago":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","apa":"Koch, A. (2018). <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn.","bibtex":"@book{Koch_2018, title={Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung}, publisher={Universität Paderborn}, author={Koch, Alexander}, year={2018} }","mla":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","short":"A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung, Universität Paderborn, 2018."},"year":"2018","author":[{"first_name":"Alexander","last_name":"Koch","full_name":"Koch, Alexander"}],"date_created":"2018-11-28T12:07:30Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:48Z","title":"Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung"},{"title":"Preface","date_created":"2018-11-30T08:08:23Z","year":"2018","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2019-01-11T10:20:16Z","creator":"florida","date_updated":"2019-01-11T10:20:16Z","access_level":"closed","file_name":"Preface.pdf","file_id":"6620","file_size":112676}],"publication":"Theor. Comput. Sci.","doi":"10.1016/j.tcs.2018.11.004","volume":751,"author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T07:02:49Z","intvolume":"       751","page":"1","citation":{"short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","mla":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>.","apa":"Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>","chicago":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018): 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>.","ieee":"C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018.","ama":"Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>"},"has_accepted_license":"1","file_date_updated":"2019-01-11T10:20:16Z","alternative_title":["Special Issue of SIROCCO 2015"],"department":[{"_id":"79"}],"user_id":"15504","_id":"5984","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","type":"journal_article"},{"year":"2018","date_created":"2018-09-17T13:12:18Z","publisher":"Springer, Cham","title":"A Self-Stabilizing Hashed Patricia Trie","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":500005,"file_id":"5277","access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","date_updated":"2018-11-02T14:38:37Z","creator":"ups","date_created":"2018-11-02T14:38:37Z"}],"abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"external_id":{"arxiv":["1809.04923"]},"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"has_accepted_license":"1","citation":{"ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>"},"intvolume":"     11201","author":[{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"volume":11201,"date_updated":"2022-01-06T07:01:02Z","doi":"10.1007/978-3-030-03232-6_1","conference":{"start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","location":"Tokyo","end_date":"2018-11-07"},"type":"conference","status":"public","editor":[{"full_name":"Izumi, Taisuke","last_name":"Izumi","first_name":"Taisuke"},{"full_name":"Kuznetsov, Petr","last_name":"Kuznetsov","first_name":"Petr"}],"series_title":"Lecture Notes of Computer Science","user_id":"39241","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4411","file_date_updated":"2018-11-02T14:38:37Z"},{"date_created":"2018-09-19T14:41:49Z","author":[{"last_name":"Neumann","full_name":"Neumann, Jürgen","id":"32456","first_name":"Jürgen"},{"first_name":"Dominik","id":"14368","full_name":"Gutt, Dominik","last_name":"Gutt"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"date_updated":"2022-01-06T07:01:08Z","conference":{"name":"Workshop on IS Design and Economic Behavior (ISDEB)","location":"Lüneburg, Germany"},"title":"The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}, booktitle={Workshop on IS Design and Economic Behavior (ISDEB)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2018} }","short":"J. Neumann, D. Gutt, D. Kundisch, in: Workshop on IS Design and Economic Behavior (ISDEB), 2018.","mla":"Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior.” <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2018.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2018). The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior. In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. Lüneburg, Germany.","ama":"Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>. ; 2018.","ieee":"J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior,” in <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, Lüneburg, Germany, 2018.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior.” In <i>Workshop on IS Design and Economic Behavior (ISDEB)</i>, 2018."},"year":"2018","department":[{"_id":"276"}],"user_id":"477","_id":"4520","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T10:36:41Z","ddc":["330"],"publication":"Workshop on IS Design and Economic Behavior (ISDEB)","type":"conference_abstract","status":"public","file":[{"file_name":"WP_TRP.pdf","access_level":"closed","file_id":"5490","file_size":694342,"date_created":"2018-11-12T10:36:41Z","creator":"d0mi","date_updated":"2018-11-12T10:36:41Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"date_created":"2018-10-02T07:06:05Z","author":[{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Jannik","last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik"}],"date_updated":"2022-01-06T07:01:11Z","publisher":"Springer","conference":{"start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","location":"Helsinki","end_date":"2018-08-24"},"title":"Competitive Routing in Hybrid Communication Networks","has_accepted_license":"1","citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018."},"year":"2018","department":[{"_id":"63"},{"_id":"79"}],"user_id":"38705","_id":"4563","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2019-01-11T10:32:38Z","language":[{"iso":"eng"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"ddc":["000"],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","type":"conference","status":"public","file":[{"file_size":349034,"file_id":"6621","file_name":"23hybrid.pdf","access_level":"closed","date_updated":"2019-01-11T10:32:38Z","creator":"ups","date_created":"2019-01-11T10:32:38Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n"}]},{"doi":"10.1007/s10726-018-9592-8","author":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Sonja","last_name":"Recker","full_name":"Recker, Sonja"}],"volume":27,"date_updated":"2022-01-06T07:01:11Z","citation":{"apa":"Haake, C.-J., &#38; Recker, S. (2018). The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>, <i>27</i>(6), 905–932. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>","short":"C.-J. Haake, S. Recker, Group Decision and Negotiation 27 (2018) 905–932.","bibtex":"@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>}, number={6}, journal={Group Decision and Negotiation}, publisher={Springer}, author={Haake, Claus-Jochen and Recker, Sonja}, year={2018}, pages={905–932} }","mla":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>.","ama":"Haake C-J, Recker S. The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>. 2018;27(6):905-932. doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>","chicago":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i> 27, no. 6 (2018): 905–32. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>.","ieee":"C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information,” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, pp. 905–932, 2018."},"jel":["C78"],"page":"905-932","intvolume":"        27","publication_status":"published","has_accepted_license":"1","file_date_updated":"2018-10-31T07:43:31Z","article_type":"original","user_id":"477","department":[{"_id":"205"},{"_id":"475"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"4564","status":"public","type":"journal_article","title":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information","date_created":"2018-10-02T07:15:26Z","publisher":"Springer","year":"2018","issue":"6","quality_controlled":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"stela","date_created":"2018-10-31T07:43:31Z","date_updated":"2018-10-31T07:43:31Z","access_level":"closed","file_name":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations Under Incomplete Information.pdf","file_id":"5107","file_size":636521}],"abstract":[{"lang":"eng","text":"  In our model two divisions negotiate over type-dependent contracts to\r\n  determine an intrafirm transfer price for an intermediate product. Since the\r\n  upstream division's (seller's) costs and downstream division's (buyer's)\r\n  revenues are supposed to be private information, we formally consider\r\n  cooperative bargaining problems under incomplete information.  This means\r\n  that the two divisions consider allocations of expected utility generated by\r\n  mechanisms that satisfy (interim) individual rationality, incentive\r\n  compatibility and/or ex post efficiency.  Assuming two possible types for\r\n  buyer and seller each, we first establish that the bargaining problem is\r\n  regular, regardless whether or not incentive and/or efficiency constraints\r\n  are imposed. This allows us to apply the generalized Nash bargaining\r\n  solution to determine fair transfer payments and transfer\r\n  quantities. In particular, the generalized Nash bargaining solution tries to\r\n  balance divisional profits, while incentive constraints are still in\r\n  place. In that sense a fair profit division is generated. Furthermore, by\r\n  means of illustrative examples we derive general properties of this solution\r\n  for the transfer pricing problem and compare the model developed here with\r\n  the models existing in the literature. We demonstrate that there is a\r\n  tradeoff between ex post efficiency and fairness.\r\n"}],"publication":"Group Decision and Negotiation"},{"citation":{"short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>"},"year":"2018","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"conference":{"location":"Wien","end_date":"2018-07-18","start_date":"2018-07-17","name":"SPAA'18"},"doi":"10.1145/3210377.3210663","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","author":[{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"id":"43647","full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2018-10-02T07:34:47Z","date_updated":"2022-01-06T07:01:12Z","publisher":"ACM Press","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T13:48:10Z","date_created":"2018-11-02T13:48:10Z","creator":"ups","file_size":1025077,"access_level":"closed","file_name":"p231-jung-1.pdf","file_id":"5254"}],"status":"public","type":"conference","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-11-02T13:48:10Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"38705","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4565"},{"date_updated":"2022-01-06T07:01:23Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"author":[{"id":"47829","full_name":"Wu, Xing","last_name":"Wu","first_name":"Xing"}],"date_created":"2018-10-23T08:13:11Z","title":"Essays on Competition in Health Care Markets","doi":"10.17619/UNIPB/1-358","has_accepted_license":"1","year":"2018","citation":{"apa":"Wu, X. (2018). <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>","mla":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>.","bibtex":"@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>}, publisher={Universität Paderborn}, author={Wu, Xing}, year={2018} }","short":"X. Wu, Essays on Competition in Health Care Markets, Universität Paderborn, 2018.","ama":"Wu X. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>","chicago":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>.","ieee":"X. Wu, <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018."},"_id":"4797","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"477","ddc":["330"],"file_date_updated":"2018-11-06T14:23:51Z","language":[{"iso":"eng"}],"type":"dissertation","status":"public","file":[{"access_level":"closed","file_id":"5381","file_name":"Xing Wu_Essays on Competition in Health Care Markets.pdf","file_size":893726,"date_created":"2018-11-06T14:23:51Z","creator":"xwu","date_updated":"2018-11-06T14:23:51Z","relation":"main_file","content_type":"application/pdf"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"280"}],"user_id":"477","_id":"4802","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"bachelorsthesis","title":"Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"date_created":"2018-10-24T06:41:13Z","author":[{"full_name":"Akcay, Yasemen","last_name":"Akcay","first_name":"Yasemen"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","citation":{"mla":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","bibtex":"@book{Akcay_2018, title={Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}, publisher={Universität Paderborn}, author={Akcay, Yasemen}, year={2018} }","short":"Y. Akcay, Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb, Universität Paderborn, 2018.","apa":"Akcay, Y. (2018). <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn.","ama":"Akcay Y. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn; 2018.","chicago":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","ieee":"Y. Akcay, <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn, 2018."},"year":"2018"},{"year":"2018","citation":{"ama":"Görken E. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn; 2018.","ieee":"E. Görken, <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn, 2018.","chicago":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018.","apa":"Görken, E. (2018). <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn.","mla":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018.","bibtex":"@book{Görken_2018, title={Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern}, publisher={Universität Paderborn}, author={Görken, Emre}, year={2018} }","short":"E. Görken, Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern, Universität Paderborn, 2018."},"title":"Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern","date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","date_created":"2018-10-24T07:05:18Z","author":[{"first_name":"Emre","last_name":"Görken","full_name":"Görken, Emre"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"4804","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"477"}]