[{"citation":{"ieee":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann, “On Stabilizing Departures in Overlay Networks,” in <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62.","chicago":"Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler, and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.” In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 48--62. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>.","ama":"Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On Stabilizing Departures in Overlay Networks. In: <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. LNCS. ; 2014:48--62. doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>","apa":"Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &#38; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (pp. 48--62). <a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">https://doi.org/10.1007/978-3-319-11764-5_4</a>","mla":"Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” <i>Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2014, pp. 48--62, doi:<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>.","short":"D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.","bibtex":"@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014, series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-11764-5_4\">10.1007/978-3-319-11764-5_4</a>}, booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos, Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim Frederik}, year={2014}, pages={48--62}, collection={LNCS} }"},"page":"48--62","has_accepted_license":"1","doi":"10.1007/978-3-319-11764-5_4","author":[{"full_name":"Foreback, Dianne","last_name":"Foreback","first_name":"Dianne"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"full_name":"Nesterenko, Mikhail","last_name":"Nesterenko","first_name":"Mikhail"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann"}],"date_updated":"2022-01-06T06:59:56Z","status":"public","type":"conference","file_date_updated":"2018-03-20T07:00:28Z","series_title":"LNCS","user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"393","year":"2014","title":"On Stabilizing Departures in Overlay Networks","date_created":"2017-10-17T12:42:08Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1384","file_name":"393-departures.pdf","file_size":287539,"date_created":"2018-03-20T07:00:28Z","creator":"florida","date_updated":"2018-03-20T07:00:28Z"}],"abstract":[{"text":"A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer system are excluded from the overlay network without affecting its connectivity. There are a number of studies for safe node exclusion if the overlay is in a well-defined state initially. Surprisingly, the problem is not formally studied yet for the case in which the overlay network is in an arbitrary initial state, i.e., when looking for a self-stabilizing solution for excluding leaving nodes. We study this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation if necessary. We show that there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous message passing model. To allow a solution, we introduce an oracle called NIDEC and show that it is sufficient even for the asynchronous message passing model by proposing an algorithm that can solve the FDP using NIDEC. We also show that a solution to the FSP does not require an oracle.","lang":"eng"}],"publication":"Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems","language":[{"iso":"eng"}],"ddc":["040"]},{"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","abstract":[{"text":"We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-20T06:59:20Z","creator":"florida","date_created":"2018-03-20T06:59:20Z","file_size":161479,"file_name":"395-WINE2014ACJS.pdf","file_id":"1382","access_level":"closed"}],"date_created":"2017-10-17T12:42:09Z","title":"Multilevel Network Games","year":"2014","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"395","series_title":"LNCS","user_id":"15415","department":[{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-03-20T06:59:20Z","type":"conference","status":"public","date_updated":"2022-01-06T06:59:59Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"doi":"10.1007/978-3-319-13129-0_36","has_accepted_license":"1","citation":{"ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–440.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 435–40. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:435-440. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>","mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–40, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>.","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS} }","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Multilevel Network Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 435–440). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>"},"page":"435-440"},{"title":"Minimum Linear Arrangement of Series-Parallel Graphs","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:09Z","date_updated":"2022-01-06T07:00:02Z","citation":{"bibtex":"@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS} }","mla":"Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180.","short":"C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.","apa":"Scheideler, C., Eikel, M., &#38; Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 168--180).","ama":"Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel Graphs. In: <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>. LNCS. ; 2014:168--180.","chicago":"Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear Arrangement of Series-Parallel Graphs.” In <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 168--180. LNCS, 2014.","ieee":"C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel Graphs,” in <i>Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2014, pp. 168--180."},"page":"168--180","year":"2014","has_accepted_license":"1","file_date_updated":"2018-03-20T06:58:44Z","ddc":["040"],"series_title":"LNCS","user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"397","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T06:58:44Z","creator":"florida","date_updated":"2018-03-20T06:58:44Z","file_id":"1381","access_level":"closed","file_name":"397-WAOA14_01.pdf","file_size":365818}],"status":"public","abstract":[{"lang":"eng","text":"We present a factor $14D^2$ approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where $D$ is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach allows for an effective parallelization. Note that a suitable decomposition can also be computed in time $O(|E|\\log{|E|})$ (or even $O(\\log{|E|}\\log^*{|E|})$ on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation ratio, we use a sophisticated charging method that uses techniques similar to amortized analysis in advanced data structures. On general graphs, the minimum linear arrangement problem is known to be NP-hard. To the best of our knowledge, the minimum linear arrangement problem on series-parallel graphs has not been studied before."}],"type":"conference","publication":"Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA)"},{"citation":{"ama":"Martin Lohre T. <i>Machtverteilungen von Koalitionen im Fokus der politischen Realität</i>. Universität Paderborn; 2014.","chicago":"Martin Lohre, Tobias. <i>Machtverteilungen von Koalitionen im Fokus der politischen Realität</i>. Universität Paderborn, 2014.","ieee":"T. Martin Lohre, <i>Machtverteilungen von Koalitionen im Fokus der politischen Realität</i>. Universität Paderborn, 2014.","short":"T. Martin Lohre, Machtverteilungen von Koalitionen im Fokus der politischen Realität, Universität Paderborn, 2014.","mla":"Martin Lohre, Tobias. <i>Machtverteilungen von Koalitionen im Fokus der politischen Realität</i>. Universität Paderborn, 2014.","bibtex":"@book{Martin Lohre_2014, title={Machtverteilungen von Koalitionen im Fokus der politischen Realität}, publisher={Universität Paderborn}, author={Martin Lohre, Tobias}, year={2014} }","apa":"Martin Lohre, T. (2014). <i>Machtverteilungen von Koalitionen im Fokus der politischen Realität</i>. Universität Paderborn."},"year":"2014","title":"Machtverteilungen von Koalitionen im Fokus der politischen Realität","date_created":"2017-10-17T12:42:10Z","author":[{"first_name":"Tobias","full_name":"Martin Lohre, Tobias","last_name":"Martin Lohre"}],"date_updated":"2022-01-06T07:00:08Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","_id":"403","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"citation":{"apa":"van Straaten, D. (2014). <i>Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse</i>. Universität Paderborn.","bibtex":"@book{van Straaten_2014, title={Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={van Straaten, Dirk}, year={2014} }","short":"D. van Straaten, Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse, Universität Paderborn, 2014.","mla":"van Straaten, Dirk. <i>Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse</i>. Universität Paderborn, 2014.","chicago":"Straaten, Dirk van. <i>Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse</i>. Universität Paderborn, 2014.","ieee":"D. van Straaten, <i>Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse</i>. Universität Paderborn, 2014.","ama":"van Straaten D. <i>Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse</i>. Universität Paderborn; 2014."},"year":"2014","author":[{"last_name":"van Straaten","full_name":"van Straaten, Dirk","id":"10311","first_name":"Dirk"}],"date_created":"2017-10-17T12:42:10Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:08Z","title":"Kooperative Verhandlungen im duopolistischen Wettbewerb - eine spieltheoretische Analyse","type":"mastersthesis","status":"public","user_id":"477","_id":"404","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"ger"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"405","user_id":"477","year":"2014","citation":{"apa":"Degraf, O. (2014). <i>Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn.","bibtex":"@book{Degraf_2014, title={Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Degraf, Olga}, year={2014} }","mla":"Degraf, Olga. <i>Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2014.","short":"O. Degraf, Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2014.","ieee":"O. Degraf, <i>Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2014.","chicago":"Degraf, Olga. <i>Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2014.","ama":"Degraf O. <i>Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn; 2014."},"title":"Koalitionsbildung bei mehrdimensionalen Verhandlungsproblemen","date_updated":"2022-01-06T07:00:10Z","publisher":"Universität Paderborn","author":[{"full_name":"Degraf, Olga","last_name":"Degraf","first_name":"Olga"}],"date_created":"2017-10-17T12:42:10Z"},{"page":"572--594","intvolume":"         7","citation":{"apa":"Jungmann, A., Brangewitz, S., Petrlic, R., &#38; Platenius, M. C. (2014). Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services. <i>International Journal On Advances in Intelligent Systems (IntSys)</i>, <i>7</i>(3&#38;4), 572--594.","mla":"Jungmann, Alexander, et al. “Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services.” <i>International Journal On Advances in Intelligent Systems (IntSys)</i>, vol. 7, no. 3&#38;4, IARIA, 2014, pp. 572--594.","short":"A. Jungmann, S. Brangewitz, R. Petrlic, M.C. Platenius, International Journal On Advances in Intelligent Systems (IntSys) 7 (2014) 572--594.","bibtex":"@article{Jungmann_Brangewitz_Petrlic_Platenius_2014, title={Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services}, volume={7}, number={3&#38;4}, journal={International Journal On Advances in Intelligent Systems (IntSys)}, publisher={IARIA}, author={Jungmann, Alexander and Brangewitz, Sonja and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={572--594} }","ama":"Jungmann A, Brangewitz S, Petrlic R, Platenius MC. Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services. <i>International Journal On Advances in Intelligent Systems (IntSys)</i>. 2014;7(3&#38;4):572--594.","chicago":"Jungmann, Alexander, Sonja Brangewitz, Ronald Petrlic, and Marie Christin Platenius. “Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services.” <i>International Journal On Advances in Intelligent Systems (IntSys)</i> 7, no. 3&#38;4 (2014): 572--594.","ieee":"A. Jungmann, S. Brangewitz, R. Petrlic, and M. C. Platenius, “Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services,” <i>International Journal On Advances in Intelligent Systems (IntSys)</i>, vol. 7, no. 3&#38;4, pp. 572--594, 2014."},"has_accepted_license":"1","main_file_link":[{"url":"http://www.iariajournals.org/intelligent_systems/intsys_v7_n34_2014_paged.pdf"}],"volume":7,"author":[{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"first_name":"Ronald","last_name":"Petrlic","full_name":"Petrlic, Ronald"},{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"}],"date_updated":"2022-01-06T07:00:17Z","status":"public","type":"journal_article","file_date_updated":"2018-03-16T11:34:28Z","department":[{"_id":"205"}],"user_id":"65453","_id":"410","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Project Area B","_id":"3"}],"year":"2014","issue":"3&4","title":"Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services","date_created":"2017-10-17T12:42:11Z","publisher":"IARIA","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:34:28Z","creator":"florida","date_created":"2018-03-16T11:34:28Z","file_size":2590608,"file_name":"410-intsys_v7_n34_2014_18.pdf","access_level":"closed","file_id":"1362"}],"abstract":[{"text":"One goal of service-oriented computing is to realize future markets of composed services. In such markets, service providers offer services that can be flexibly combined with each other. However, although crucial for decision-making, market participants are usually not able to individually estimate the quality of traded services in advance. To overcome this problem, we present a conceptual design for a reputation system that collects and processes user feedback on transactions, and provides this information as a signal for quality to participants in the market. Based on our proposed concept, we describe the incorporation of reputation information into distinct decision-making processes that are crucial in such service markets. In this context, we present a fuzzy service matching approach that takes reputation information into account. Furthermore, we introduce an adaptive service composition approach, and investigate the impact of exchanging immediate user feedback by reputation information. Last but not least, we describe the importance of reputation information for economic decisions of different market participants. The overall output of this paper is a comprehensive view on managing and exploiting reputation information in markets of composed services using the example of On-The-Fly Computing.","lang":"eng"}],"publication":"International Journal On Advances in Intelligent Systems (IntSys)","language":[{"iso":"eng"}],"ddc":["040"]},{"type":"conference","status":"public","user_id":"14052","department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"412","file_date_updated":"2018-03-16T11:34:00Z","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }","short":"M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>.","apa":"Feldotto, M., Scheideler, C., &#38; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i> (pp. 1–10). <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>","ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>. ; 2014:1-10. doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>","ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10.","chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 1–10, 2014. <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>."},"page":"1-10","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_updated":"2022-01-06T07:00:20Z","doi":"10.1109/P2P.2014.6934300","publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)","file":[{"file_size":472321,"access_level":"closed","file_name":"412-FSG2014P2P.pdf","file_id":"1361","date_updated":"2018-03-16T11:34:00Z","date_created":"2018-03-16T11:34:00Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates."}],"external_id":{"arxiv":["1408.0395"]},"ddc":["040"],"year":"2014","date_created":"2017-10-17T12:42:12Z","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths"},{"user_id":"42447","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"413","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:42:12Z","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"first_name":"Fabian","full_name":"Eusterholz, Fabian","last_name":"Eusterholz"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:22Z","title":"Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes","citation":{"ieee":"F. Eusterholz, <i>Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes</i>. Universität Paderborn, 2014.","chicago":"Eusterholz, Fabian. <i>Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes</i>. Universität Paderborn, 2014.","ama":"Eusterholz F. <i>Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes</i>. Universität Paderborn; 2014.","apa":"Eusterholz, F. (2014). <i>Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes</i>. Universität Paderborn.","short":"F. Eusterholz, Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes, Universität Paderborn, 2014.","mla":"Eusterholz, Fabian. <i>Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes</i>. Universität Paderborn, 2014.","bibtex":"@book{Eusterholz_2014, title={Horizontale Fusionen: Theorie und Praxis am Beispiel zweier Entscheidungen des Bundeskartellamtes}, publisher={Universität Paderborn}, author={Eusterholz, Fabian}, year={2014} }"},"year":"2014"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:33:05Z","creator":"florida","date_updated":"2018-03-16T11:33:05Z","access_level":"closed","file_name":"419-Dissertation_Veroeffentlichung_Andre_Kolle_30032014.pdf","file_id":"1359","file_size":3036379}],"status":"public","abstract":[{"text":"The present thesis investigates the prevalence of and the reasons for hiring discrimination against women and ethnic Turks in the German labor market. Subsequent to a discussion of how to reveal discrimination, the literature on wage and employment differences inside and outside the German labor market is reviewed. Afterwards, different (economic) theories explaining inequalities in labor markets are presented. In the empirical analyses a field experiment - the so called correspondence testing - is conducted where matched pairs of (fictitious) male and female as well as German-named and Turkish-named applicants respond to, respectively, 656 and 608 (real) apprenticeship offers in predominantly male-dominated jobs. Descriptive results and econometric analyses using probit regressions on various model specifications indicate that the female applicant has a 19 percent lower callback probability compared to her male counterpart. However, differential treatment is both job- and firm-type driven. While callback rates are not statistically different from zero in female-dominated and “gender-neutral” occupations, they prevail in jobs where men are overrepresented. Furthermore, discrimination is restricted to late recruiters, i.e., companies that advertise their vacancies right before the apprenticeship is supposed to start. Similar conclusions can be drawn from the study investigating ethnic discrimination. The 32 percent lower callback probability of the Turkish-named applicant decreases if early rather than late recruiters are addressed. Apart from that, comparing response and callback rates to the candidates using different experimental designs, i.e., sending out single versus pairs of applications, yields no statistically significant differences demonstrating the unbiasedness of the correspondence approach.","lang":"eng"}],"type":"dissertation","language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:33:05Z","ddc":["040"],"user_id":"477","department":[{"_id":"19"},{"_id":"183"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"419","citation":{"chicago":"Kolle, Andre. <i>Gender and Ethnic Discrimination in Hiring : Evidence from Field Experiments in the German Labor Market</i>. Universität Paderborn, 2014.","ieee":"A. Kolle, <i>Gender and ethnic discrimination in hiring : evidence from field experiments in the German labor market</i>. Universität Paderborn, 2014.","ama":"Kolle A. <i>Gender and Ethnic Discrimination in Hiring : Evidence from Field Experiments in the German Labor Market</i>. Universität Paderborn; 2014.","bibtex":"@book{Kolle_2014, title={Gender and ethnic discrimination in hiring : evidence from field experiments in the German labor market}, publisher={Universität Paderborn}, author={Kolle, Andre}, year={2014} }","short":"A. Kolle, Gender and Ethnic Discrimination in Hiring : Evidence from Field Experiments in the German Labor Market, Universität Paderborn, 2014.","mla":"Kolle, Andre. <i>Gender and Ethnic Discrimination in Hiring : Evidence from Field Experiments in the German Labor Market</i>. Universität Paderborn, 2014.","apa":"Kolle, A. (2014). <i>Gender and ethnic discrimination in hiring : evidence from field experiments in the German labor market</i>. Universität Paderborn."},"year":"2014","has_accepted_license":"1","title":"Gender and ethnic discrimination in hiring : evidence from field experiments in the German labor market","date_created":"2017-10-17T12:42:13Z","supervisor":[{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"}],"author":[{"last_name":"Kolle","full_name":"Kolle, Andre","first_name":"Andre"}],"date_updated":"2022-01-06T07:00:32Z","publisher":"Universität Paderborn"},{"_id":"426","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"15504","type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:43Z","date_created":"2017-10-17T12:42:15Z","author":[{"first_name":"Veit","last_name":"Dornseifer","full_name":"Dornseifer, Veit"}],"title":"Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network","year":"2014","citation":{"ama":"Dornseifer V. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn; 2014.","ieee":"V. Dornseifer, <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","chicago":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","apa":"Dornseifer, V. (2014). <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn.","short":"V. Dornseifer, Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network, Universität Paderborn, 2014.","mla":"Dornseifer, Veit. <i>Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network</i>. Universität Paderborn, 2014.","bibtex":"@book{Dornseifer_2014, title={Evaluation of a Hybrid Packet-/Circuit-Switched Data Center Network}, publisher={Universität Paderborn}, author={Dornseifer, Veit}, year={2014} }"}},{"author":[{"first_name":"Nico","full_name":"Bredenbals, Nico","last_name":"Bredenbals"}],"date_created":"2017-10-17T12:42:16Z","date_updated":"2022-01-06T07:00:54Z","publisher":"Universität Paderborn","title":"Energy-Efficient Queuing with Delayed Deactivation","citation":{"apa":"Bredenbals, N. (2014). <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn.","bibtex":"@book{Bredenbals_2014, title={Energy-Efficient Queuing with Delayed Deactivation}, publisher={Universität Paderborn}, author={Bredenbals, Nico}, year={2014} }","short":"N. Bredenbals, Energy-Efficient Queuing with Delayed Deactivation, Universität Paderborn, 2014.","mla":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","ieee":"N. Bredenbals, <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","chicago":"Bredenbals, Nico. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn, 2014.","ama":"Bredenbals N. <i>Energy-Efficient Queuing with Delayed Deactivation</i>. Universität Paderborn; 2014."},"year":"2014","department":[{"_id":"75"}],"user_id":"15504","_id":"432","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"type":"mastersthesis","status":"public"},{"title":"Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"}],"date_created":"2017-10-17T12:42:16Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:57Z","citation":{"apa":"Luo, L. (2014). <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn.","bibtex":"@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2014} }","short":"L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen, Universität Paderborn, 2014.","mla":"Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","ama":"Luo L. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn; 2014.","ieee":"L. Luo, <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","chicago":"Luo, Linghui. <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014."},"year":"2014","language":[{"iso":"ger"}],"user_id":"477","_id":"434","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","_id":"437","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"280"}],"user_id":"42447","language":[{"iso":"ger"}],"year":"2014","citation":{"apa":"Wemhöner, V. (2014). <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn.","short":"V. Wemhöner, Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells, Universität Paderborn, 2014.","mla":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","bibtex":"@book{Wemhöner_2014, title={Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells}, publisher={Universität Paderborn}, author={Wemhöner, Vanessa}, year={2014} }","chicago":"Wemhöner, Vanessa. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","ieee":"V. Wemhöner, <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn, 2014.","ama":"Wemhöner V. <i>Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells</i>. Universität Paderborn; 2014."},"date_updated":"2022-01-06T07:00:59Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"date_created":"2017-10-17T12:42:17Z","author":[{"last_name":"Wemhöner","full_name":"Wemhöner, Vanessa","first_name":"Vanessa"}],"title":"Die ökonomischen Auswirkungen der Kronzeugenregelung am Beispiel des Kaffeerösterkartells"},{"year":"2014","citation":{"ama":"Kaimann D. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn; 2014.","ieee":"D. Kaimann, <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","chicago":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","short":"D. Kaimann, Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions, Universität Paderborn, 2014.","bibtex":"@book{Kaimann_2014, title={Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions}, publisher={Universität Paderborn}, author={Kaimann, Daniel}, year={2014} }","mla":"Kaimann, Daniel. <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn, 2014.","apa":"Kaimann, D. (2014). <i>Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions</i>. Universität Paderborn."},"has_accepted_license":"1","title":"Decision Making under Asymmetric Information in Markets for Experience Goods: Empirical Evidence of Signaling Effects on Consumer Perceptions","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:01Z","supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"}],"date_created":"2017-10-17T12:42:17Z","author":[{"full_name":"Kaimann, Daniel","id":"18949","last_name":"Kaimann","first_name":"Daniel"}],"status":"public","file":[{"creator":"dkaimann","date_created":"2018-11-08T09:29:04Z","date_updated":"2018-11-08T09:29:04Z","file_id":"5424","file_name":"Dissertation_2014_Kaimann.pdf","access_level":"closed","file_size":531139,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"dissertation","ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-08T09:29:04Z","_id":"440","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"19"},{"_id":"200"},{"_id":"205"},{"_id":"183"}],"user_id":"477"},{"file_date_updated":"2018-08-09T09:49:34Z","user_id":"65453","department":[{"_id":"205"},{"_id":"475"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"2543","status":"public","type":"journal_article","doi":"10.1016/j.econlet.2013.08.013","author":[{"full_name":"Brangewitz, Sonja","last_name":"Brangewitz","first_name":"Sonja"},{"full_name":"Gamp, Jan-Philip","last_name":"Gamp","first_name":"Jan-Philip"}],"volume":121,"date_updated":"2022-01-06T06:57:04Z","citation":{"ama":"Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>. 2013;121(2):224-227. doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i> 121, no. 2 (2013): 224–27. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>.","ieee":"S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” <i>Economics Letters</i>, vol. 121, no. 2, pp. 224–227, 2013.","short":"S. Brangewitz, J.-P. Gamp, Economics Letters 121 (2013) 224–227.","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, vol. 121, no. 2, Elsevier, 2013, pp. 224–27, doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>.","bibtex":"@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, volume={121}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>, <i>121</i>(2), 224–227. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>"},"intvolume":"       121","page":"224-227","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0165-1765"]},"language":[{"iso":"eng"}],"ddc":["040"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-08-09T09:49:34Z","creator":"cjhaake","date_created":"2018-08-09T09:49:34Z","file_size":374977,"access_level":"closed","file_id":"3869","file_name":"Asymmetric Nash bargaining solutions and competitive payoffs.pdf"}],"publication":"Economics Letters","title":"Asymmetric Nash bargaining solutions and competitive payoffs","date_created":"2018-04-26T11:29:16Z","publisher":"Elsevier","year":"2013","issue":"2"},{"language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18000","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","type":"bachelorsthesis","title":"Cliquenbildung in verteilten Systemen","author":[{"first_name":"Fritz","full_name":"Blumentritt, Fritz","last_name":"Blumentritt"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-17T08:14:17Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","citation":{"ieee":"F. Blumentritt, <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","chicago":"Blumentritt, Fritz. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn, 2013.","ama":"Blumentritt F. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn; 2013.","apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn.","mla":"Blumentritt, Fritz. <i>Cliquenbildung in Verteilten Systemen</i>. Universität Paderborn, 2013.","short":"F. Blumentritt, Cliquenbildung in Verteilten Systemen, Universität Paderborn, 2013.","bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }"},"year":"2013"},{"doi":"10.1145/2486001.2491710","title":"Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow","author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2017-10-17T12:42:23Z","date_updated":"2022-01-06T07:01:19Z","citation":{"ieee":"P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow,” in <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–542.","chicago":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” In <i>Proceedings of the ACM SIGCOMM ’13</i>, 541–42. Digital Library, 2013. <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>.","ama":"Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In: <i>Proceedings of the ACM SIGCOMM ’13</i>. Digital Library. ; 2013:541-542. doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>","apa":"Wette, P., &#38; Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In <i>Proceedings of the ACM SIGCOMM ’13</i> (pp. 541–542). <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>","bibtex":"@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}, DOI={<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>}, booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={541–542}, collection={Digital Library} }","mla":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–42, doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>.","short":"P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542."},"page":"541-542","year":"2013","has_accepted_license":"1","file_date_updated":"2018-03-16T11:18:01Z","ddc":["040"],"series_title":"Digital Library","user_id":"15572","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"470","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:18:01Z","creator":"florida","date_updated":"2018-03-16T11:18:01Z","file_name":"470-p541-wette_01.pdf","access_level":"closed","file_id":"1331","file_size":446835}],"status":"public","abstract":[{"text":"In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries.","lang":"eng"}],"type":"conference","publication":"Proceedings of the ACM SIGCOMM '13"},{"_id":"474","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"205"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-16T11:16:59Z","language":[{"iso":"eng"}],"type":"report","abstract":[{"text":"Suppose some individuals are allowed to engage in different groups at the same time and they generate a certain welfare by cooperation. Finding appropriate ways for distributing this welfare is a non-trivial issue. The purpose of this work is to analyze two-stage allocation procedures where first each group receives a share of the welfare which is then, subsequently, distributed among the corresponding members. To study these procedures in a structured way, cooperative games and network games are combined in a general framework by using mathematical hypergraphs. Moreover, several convincing requirements on allocation procedures are discussed and formalized. Thereby it will be shown, for example, that the Position Value and iteratively applying the Myerson Value can be characterized by similar axiomatizations.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":424301,"file_name":"474-WP73.pdf","access_level":"closed","file_id":"1329","date_updated":"2018-03-16T11:16:59Z","date_created":"2018-03-16T11:16:59Z","creator":"florida"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:20Z","author":[{"first_name":"Nils","full_name":"Röhl, Nils","last_name":"Röhl"}],"date_created":"2017-10-17T12:42:24Z","title":"Two-Stage Allocation Procedures","has_accepted_license":"1","year":"2013","citation":{"ieee":"N. Röhl, <i>Two-Stage Allocation Procedures</i>. Universität Paderborn, 2013.","chicago":"Röhl, Nils. <i>Two-Stage Allocation Procedures</i>. Universität Paderborn, 2013.","ama":"Röhl N. <i>Two-Stage Allocation Procedures</i>. Universität Paderborn; 2013.","apa":"Röhl, N. (2013). <i>Two-Stage Allocation Procedures</i>. Universität Paderborn.","mla":"Röhl, Nils. <i>Two-Stage Allocation Procedures</i>. Universität Paderborn, 2013.","short":"N. Röhl, Two-Stage Allocation Procedures, Universität Paderborn, 2013.","bibtex":"@book{Röhl_2013, title={Two-Stage Allocation Procedures}, publisher={Universität Paderborn}, author={Röhl, Nils}, year={2013} }"}},{"abstract":[{"text":"An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.","lang":"eng"}],"file":[{"file_size":264308,"access_level":"closed","file_id":"1326","file_name":"476-tocsrevised3b.pdf","date_updated":"2018-03-15T14:07:18Z","date_created":"2018-03-15T14:07:18Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","ddc":["040"],"file_date_updated":"2018-03-15T14:07:18Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"476","user_id":"477","department":[{"_id":"79"}],"year":"2013","citation":{"ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>. 2013;(2):341-363. doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2 (2013): 341–63. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>.","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” <i>Theory of Computing Systems</i>, no. 2, pp. 341–363, 2013.","short":"P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2, Springer, 2013, pp. 341–63, doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>.","bibtex":"@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>}, number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman, Petr and Scheideler, Christian}, year={2013}, pages={341–363} }","apa":"Kolman, P., &#38; Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>, (2), 341–363. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>"},"page":"341-363","has_accepted_license":"1","issue":"2","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","doi":"10.1007/s00224-013-9454-3","publisher":"Springer","date_updated":"2022-01-06T07:01:21Z","author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:24Z"}]