[{"author":[{"id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler","first_name":"Sevil"},{"first_name":"Manuel","id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster"},{"first_name":"Marvin","last_name":"Illian","full_name":"Illian, Marvin"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-01-06T06:56:37Z","oa":"1","conference":{"location":"Montreal","end_date":"2018-07-29","start_date":"2018-07-25","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},"doi":"10.1109/NETSOFT.2018.8460029","has_accepted_license":"1","page":"318--322","citation":{"apa":"Dräxler, S., Peuster, M., Illian, M., &#38; Karl, H. (2018). Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i> (pp. 318--322). Montreal: IEEE. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">https://doi.org/10.1109/NETSOFT.2018.8460029</a>","mla":"Dräxler, Sevil, et al. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, IEEE, 2018, pp. 318--322, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>.","short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 318--322.","bibtex":"@inproceedings{Dräxler_Peuster_Illian_Karl_2018, title={Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, pages={318--322} }","ama":"Dräxler S, Peuster M, Illian M, Karl H. Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. IEEE; 2018:318--322. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">10.1109/NETSOFT.2018.8460029</a>","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, 318--322. IEEE, 2018. <a href=\"https://doi.org/10.1109/NETSOFT.2018.8460029\">https://doi.org/10.1109/NETSOFT.2018.8460029</a>.","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, “Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal, 2018, pp. 318--322."},"department":[{"_id":"75"}],"user_id":"31764","_id":"2480","project":[{"_id":"23","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2019-01-24T10:17:00Z","type":"conference","status":"public","date_created":"2018-04-24T12:11:36Z","publisher":"IEEE","title":"Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case","year":"2018","language":[{"iso":"eng"}],"ddc":["004"],"publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","file":[{"file_size":2211450,"file_name":"08460029.pdf","access_level":"closed","file_id":"6195","date_updated":"2018-12-12T15:18:12Z","date_created":"2018-12-12T15:18:12Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"},{"file_name":"NetSoft18_RIS.pdf","file_id":"6968","access_level":"open_access","file_size":3445650,"date_created":"2019-01-24T10:17:00Z","creator":"sevilmeh","date_updated":"2019-01-24T10:17:00Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available.","lang":"eng"}]},{"year":"2018","date_created":"2018-04-24T12:14:00Z","publisher":"IEEE","title":" Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions","publication":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)","file":[{"content_type":"application/pdf","relation":"main_file","creator":"sevilmeh","date_created":"2018-06-25T07:40:57Z","date_updated":"2018-06-25T07:40:57Z","access_level":"open_access","file_id":"3319","file_name":"RIS.pdf","file_size":1471937}],"abstract":[{"lang":"eng","text":"Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches."}],"language":[{"iso":"eng"}],"ddc":["040"],"publication_status":"published","has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Dräxler_Schneider_Karl_2018, title={ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}, booktitle={4th IEEE International Conference on Network Softwarization (NetSoft 2018)}, publisher={IEEE}, author={Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}, year={2018}, pages={123--131} }","short":"S. Dräxler, S.B. Schneider, H. Karl, in: 4th IEEE International Conference on Network Softwarization (NetSoft 2018), IEEE, 2018, pp. 123--131.","mla":"Dräxler, Sevil, et al. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, IEEE, 2018, pp. 123--131.","apa":"Dräxler, S., Schneider, S. B., &#38; Karl, H. (2018).  Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i> (pp. 123--131). Montreal: IEEE.","ama":"Dräxler S, Schneider SB, Karl H.  Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions. In: <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>. IEEE; 2018:123--131.","chicago":"Dräxler, Sevil, Stefan Balthasar Schneider, and Holger Karl. “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions.” In <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, 123--131. IEEE, 2018.","ieee":"S. Dräxler, S. B. Schneider, and H. Karl, “ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions,” in <i>4th IEEE International Conference on Network Softwarization (NetSoft 2018)</i>, Montreal, 2018, pp. 123--131."},"page":"123--131","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"id":"35343","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T06:56:38Z","oa":"1","conference":{"location":"Montreal","name":"4th IEEE International Conference on Network Softwarization (NetSoft 2018)"},"type":"conference","status":"public","urn":"24814","user_id":"477","department":[{"_id":"75"}],"project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"2481","file_date_updated":"2018-06-25T07:40:57Z"},{"type":"report","abstract":[{"text":"Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available.","lang":"eng"}],"status":"public","_id":"2483","project":[{"grant_number":"762057","name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"series_title":"KuVS-Fachgespräch Fog Computing 2018","user_id":"31764","ddc":["000"],"language":[{"iso":"eng"}],"publication_status":"published","related_material":{"link":[{"url":"http://repositum.tuwien.ac.at/obvutwoa/content/titleinfo/2514843","relation":"confirmation"}]},"place":"Wien, Darmstadt","year":"2018","citation":{"apa":"Dräxler, S., Peuster, M., Illian, M., &#38; Karl, H. (2018). <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt.","mla":"Dräxler, Sevil, et al. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. 2018.","bibtex":"@book{Dräxler_Peuster_Illian_Karl_2018, place={Wien, Darmstadt}, series={KuVS-Fachgespräch Fog Computing 2018}, title={Towards Predicting Resource Demands and Performance of Distributed Cloud Services}, author={Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}, year={2018}, collection={KuVS-Fachgespräch Fog Computing 2018} }","short":"S. Dräxler, M. Peuster, M. Illian, H. Karl, Towards Predicting Resource Demands and Performance of Distributed Cloud Services, Wien, Darmstadt, 2018.","chicago":"Dräxler, Sevil, Manuel Peuster, Marvin Illian, and Holger Karl. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. KuVS-Fachgespräch Fog Computing 2018. Wien, Darmstadt, 2018.","ieee":"S. Dräxler, M. Peuster, M. Illian, and H. Karl, <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt, 2018.","ama":"Dräxler S, Peuster M, Illian M, Karl H. <i>Towards Predicting Resource Demands and Performance of Distributed Cloud Services</i>. Wien, Darmstadt; 2018."},"oa":"1","date_updated":"2022-01-06T06:56:38Z","date_created":"2018-04-24T12:22:40Z","author":[{"last_name":"Dräxler","id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil"},{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"last_name":"Illian","full_name":"Illian, Marvin","first_name":"Marvin"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"title":"Towards Predicting Resource Demands and Performance of Distributed Cloud Services","main_file_link":[{"open_access":"1","url":"http://www.infosys.tuwien.ac.at/docs/proceedings.pdf#page=14"}]},{"user_id":"14052","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"541"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"2484","file_date_updated":"2018-10-31T16:58:18Z","type":"conference","status":"public","editor":[{"first_name":"Ioannis","last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis"},{"first_name":"Christos","last_name":"Kaklamanis","full_name":"Kaklamanis, Christos"},{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"},{"first_name":"Donald","full_name":"Sannella, Donald","last_name":"Sannella"}],"author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"first_name":"Anupam","full_name":"Gupta, Anupam","last_name":"Gupta"},{"full_name":"Guruganesh, Guru","last_name":"Guruganesh","first_name":"Guru"},{"first_name":"Amit ","full_name":"Kumar, Amit ","last_name":"Kumar"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"full_name":"Wajc, David","last_name":"Wajc","first_name":"David"}],"volume":107,"date_updated":"2022-01-06T06:56:39Z","conference":{"name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","start_date":"2018-07-10","end_date":"2018-07-13","location":"Prag"},"doi":"10.4230/LIPIcs.ICALP.2018.51","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"citation":{"ama":"Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>. Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>","ieee":"B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,” in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.","chicago":"Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar, Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.” In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.","bibtex":"@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>}, booktitle={45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors}, year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.” <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">10.4230/LIPIcs.ICALP.2018.51</a>.","short":"B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers, D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp. 51:1-51:24.","apa":"Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers, S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i> (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2018.51\">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>"},"intvolume":"       107","page":"51:1-51:24","place":"Dagstuhl, Germany","external_id":{"arxiv":["1711.01231"]},"language":[{"iso":"eng"}],"ddc":["000"],"publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","file":[{"access_level":"closed","file_id":"5227","file_name":"LIPIcs-ICALP-2018-51.pdf","file_size":723824,"creator":"feldi","date_created":"2018-10-31T16:58:18Z","date_updated":"2018-10-31T16:58:18Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure."}],"date_created":"2018-04-24T15:21:56Z","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","title":"Fully-Dynamic Bin Packing with Little Repacking","year":"2018"},{"publisher":"ACM","date_created":"2018-04-25T08:49:43Z","title":"Online Facility Location with Mobile Facilities","year":"2018","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"date_updated":"2018-11-02T14:42:33Z","date_created":"2018-11-02T14:42:33Z","creator":"ups","file_size":1207546,"file_name":"p373-feldkord.pdf","file_id":"5280","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_updated":"2022-01-06T06:56:39Z","author":[{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"conference":{"location":"Wien","name":"SPAA'18"},"doi":"10.1145/3210377.3210389","publication_status":"published","has_accepted_license":"1","citation":{"ama":"Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href=\"https://doi.org/10.1145/3210377.3210389\">https://doi.org/10.1145/3210377.3210389</a>.","ieee":"B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility Location with Mobile Facilities}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2018}, pages={373–381} }","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href=\"https://doi.org/10.1145/3210377.3210389\">10.1145/3210377.3210389</a>.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href=\"https://doi.org/10.1145/3210377.3210389\">https://doi.org/10.1145/3210377.3210389</a>"},"page":"373 - 381 ","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2485","user_id":"477","department":[{"_id":"63"}],"file_date_updated":"2018-11-02T14:42:33Z","type":"conference","status":"public"},{"has_accepted_license":"1","citation":{"ama":"Szopinski D, Kundisch D. Business model idea generation: An exploratory study on changing perspectives. In: <i>2nd Business Model Conference</i>. ; 2018.","ieee":"D. Szopinski and D. Kundisch, “Business model idea generation: An exploratory study on changing perspectives,” in <i>2nd Business Model Conference</i>, Florence, Italy, 2018.","chicago":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” In <i>2nd Business Model Conference</i>, 2018.","apa":"Szopinski, D., &#38; Kundisch, D. (2018). Business model idea generation: An exploratory study on changing perspectives. In <i>2nd Business Model Conference</i>. Florence, Italy.","bibtex":"@inproceedings{Szopinski_Kundisch_2018, title={Business model idea generation: An exploratory study on changing perspectives}, booktitle={2nd Business Model Conference}, author={Szopinski, Daniel and Kundisch, Dennis}, year={2018} }","short":"D. Szopinski, D. Kundisch, in: 2nd Business Model Conference, 2018.","mla":"Szopinski, Daniel, and Dennis Kundisch. “Business Model Idea Generation: An Exploratory Study on Changing Perspectives.” <i>2nd Business Model Conference</i>, 2018."},"year":"2018","author":[{"first_name":"Daniel","id":"36372","full_name":"Szopinski, Daniel","last_name":"Szopinski"},{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2018-04-25T13:03:08Z","date_updated":"2022-01-06T06:56:40Z","conference":{"name":"2nd Business Model Conference","start_date":"2018-06-06","end_date":"2018-06-07","location":"Florence, Italy"},"title":"Business model idea generation: An exploratory study on changing perspectives","publication":"2nd Business Model Conference","type":"conference_abstract","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-12T13:24:21Z","creator":"dsz","date_updated":"2018-11-12T13:24:21Z","access_level":"closed","file_name":"BuMoCo2018_Standardization.pdf","file_id":"5505","file_size":589100}],"department":[{"_id":"276"}],"user_id":"477","_id":"2490","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"file_date_updated":"2018-11-12T13:24:21Z","language":[{"iso":"eng"}],"ddc":["040"]},{"conference":{"start_date":"2018-06-06","name":"2nd Business Model Conference","location":"Florence, Italy","end_date":"2018-06-07"},"title":"How to teach business model innovation to 300+ students: An experience report","author":[{"full_name":"Szopinski, Daniel","id":"36372","last_name":"Szopinski","first_name":"Daniel"}],"date_created":"2018-04-25T13:22:19Z","date_updated":"2022-01-06T06:56:41Z","citation":{"apa":"Szopinski, D. (2018). How to teach business model innovation to 300+ students: An experience report. In <i>2nd Business Model Conference</i>. Florence, Italy.","short":"D. Szopinski, in: 2nd Business Model Conference, 2018.","bibtex":"@inproceedings{Szopinski_2018, title={How to teach business model innovation to 300+ students: An experience report}, booktitle={2nd Business Model Conference}, author={Szopinski, Daniel}, year={2018} }","mla":"Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students: An Experience Report.” <i>2nd Business Model Conference</i>, 2018.","chicago":"Szopinski, Daniel. “How to Teach Business Model Innovation to 300+ Students: An Experience Report.” In <i>2nd Business Model Conference</i>, 2018.","ieee":"D. Szopinski, “How to teach business model innovation to 300+ students: An experience report,” in <i>2nd Business Model Conference</i>, Florence, Italy, 2018.","ama":"Szopinski D. How to teach business model innovation to 300+ students: An experience report. In: <i>2nd Business Model Conference</i>. ; 2018."},"year":"2018","has_accepted_license":"1","file_date_updated":"2018-11-12T13:24:39Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"276"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"2491","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5506","file_name":"BuMoCo2018_Teaching.pdf","file_size":966252,"date_created":"2018-11-12T13:24:39Z","creator":"dsz","date_updated":"2018-11-12T13:24:39Z"}],"status":"public","type":"conference_abstract","publication":"2nd Business Model Conference"},{"_id":"2559","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"user_id":"16205","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:57:07Z","author":[{"last_name":"Arendt","full_name":"Arendt, Lukas Sebastian","first_name":"Lukas Sebastian"}],"supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2018-04-27T08:56:59Z","title":"Datengetriebene Geschäftsmodelle: Ein Literaturüberblick","place":"Universität Paderborn","year":"2018","citation":{"short":"L.S. Arendt, Datengetriebene Geschäftsmodelle: Ein Literaturüberblick, Universität Paderborn, 2018.","mla":"Arendt, Lukas Sebastian. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. 2018.","bibtex":"@book{Arendt_2018, place={Universität Paderborn}, title={Datengetriebene Geschäftsmodelle: Ein Literaturüberblick}, author={Arendt, Lukas Sebastian}, year={2018} }","apa":"Arendt, L. S. (2018). <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn.","ama":"Arendt LS. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn; 2018.","chicago":"Arendt, Lukas Sebastian. <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn, 2018.","ieee":"L. S. Arendt, <i>Datengetriebene Geschäftsmodelle: Ein Literaturüberblick</i>. Universität Paderborn, 2018."}},{"year":"2018","title":"Disaggregating User Evaluations Using the Shapley Value","date_created":"2018-05-22T10:28:51Z","abstract":[{"lang":"eng","text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete."}],"file":[{"file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","file_id":"3910","access_level":"closed","file_size":1450171,"creator":"nmaraun","date_created":"2018-08-15T07:30:50Z","date_updated":"2018-08-15T07:30:50Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","ddc":["040"],"language":[{"iso":"eng"}],"page":"5:1-5:6","citation":{"ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>","chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 5:1-5:6, 2018. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>.","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine, California, USA, 2018, pp. 5:1-5:6.","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6). Irvine, California, USA. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>.","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6."},"publication_identifier":{"isbn":["978-1-4503-5916-0"]},"has_accepted_license":"1","publication_status":"published","conference":{"location":"Irvine, California, USA","end_date":"2018-06-18","start_date":"2018-06-18","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)"},"doi":"10.1145/3230654.3230659","date_updated":"2022-01-06T06:58:01Z","author":[{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto"},{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"},{"first_name":"Nadja","last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja"}],"status":"public","type":"conference","file_date_updated":"2018-08-15T07:30:50Z","_id":"2831","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"user_id":"14052"},{"year":"2018","page":"1556–1574","intvolume":"        80","citation":{"apa":"Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i> 80, no. 5 (2018): 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>.","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574, 2018.","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>"},"has_accepted_license":"1","issue":"5","title":"Towards Flexible Demands in Online Leasing Problems. ","doi":"10.1007/s00453-018-0420-y","date_updated":"2022-01-06T06:58:06Z","publisher":"Springer","volume":80,"date_created":"2018-05-24T08:32:38Z","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"id":"37612","full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":600583,"access_level":"closed","file_id":"5298","file_name":"TowardsFlexibleDemandsInOnline.pdf","date_updated":"2018-11-02T15:18:16Z","creator":"ups","date_created":"2018-11-02T15:18:16Z"}],"publication":"Algorithmica","type":"journal_article","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:18:16Z","_id":"2848","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"63"}],"user_id":"477"},{"user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"2849","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:24:32Z","ddc":["000"],"type":"journal_article","publication":"Theory of Computing Systems","file":[{"creator":"ups","date_created":"2018-11-02T15:24:32Z","date_updated":"2018-11-02T15:24:32Z","file_id":"5301","access_level":"closed","file_name":"ApproximationAndHeuristicAlgor.pdf","file_size":1371624,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","date_created":"2018-05-24T08:39:15Z","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. "},{"first_name":"Christine","last_name":"Markarian","id":"37612","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schubert, Michael","last_name":"Schubert","first_name":"Michael"}],"publisher":"Springer","date_updated":"2022-01-06T06:58:06Z","doi":"10.1007/s00224-017-9836-z","title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","publication_identifier":{"unknown":["1432-4350"]},"has_accepted_license":"1","citation":{"mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>.","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>.","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” <i>Theory of Computing Systems</i>, 2018.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>"},"year":"2018"},{"_id":"2850","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","ddc":["000"],"file_date_updated":"2018-11-13T13:15:19Z","language":[{"iso":"eng"}],"publication":"Ninth International Conference on Fun with Algorithms (FUN)","type":"conference","status":"public","file":[{"file_size":554298,"file_id":"5536","file_name":"LIPIcs-FUN-2018-22.pdf","access_level":"closed","date_updated":"2018-11-13T13:15:19Z","creator":"feldi","date_created":"2018-11-13T13:15:19Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:58:07Z","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Mostafa","last_name":"Wahby","full_name":"Wahby, Mostafa"}],"date_created":"2018-05-24T08:41:48Z","title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","doi":"10.4230/LIPIcs.FUN.2018.22","has_accepted_license":"1","year":"2018","citation":{"chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018.","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018). Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>.","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018."}},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"wever","date_created":"2018-11-06T15:18:26Z","date_updated":"2018-11-06T15:18:26Z","access_level":"closed","file_name":"Mohr18ProgrammaticPlanning.pdf","file_id":"5384","file_size":349958}],"publication":"Proceedings of the 1st ICAPS Workshop on Hierarchical Planning","ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","title":"Programmatic Task Network Planning","publisher":"AAAI","date_created":"2018-05-24T09:00:20Z","status":"public","type":"conference","file_date_updated":"2018-11-06T15:18:26Z","_id":"2857","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"department":[{"_id":"355"}],"user_id":"315","page":"31-39","citation":{"ama":"Mohr F, Lettmann T, Hüllermeier E, Wever MD. Programmatic Task Network Planning. In: <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>. AAAI; 2018:31-39.","ieee":"F. Mohr, T. Lettmann, E. Hüllermeier, and M. D. Wever, “Programmatic Task Network Planning,” in <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, Delft, Netherlands, 2018, pp. 31–39.","chicago":"Mohr, Felix, Theodor Lettmann, Eyke Hüllermeier, and Marcel Dominik Wever. “Programmatic Task Network Planning.” In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, 31–39. AAAI, 2018.","apa":"Mohr, F., Lettmann, T., Hüllermeier, E., &#38; Wever, M. D. (2018). Programmatic Task Network Planning. In <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i> (pp. 31–39). Delft, Netherlands: AAAI.","bibtex":"@inproceedings{Mohr_Lettmann_Hüllermeier_Wever_2018, title={Programmatic Task Network Planning}, booktitle={Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}, publisher={AAAI}, author={Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}, year={2018}, pages={31–39} }","mla":"Mohr, Felix, et al. “Programmatic Task Network Planning.” <i>Proceedings of the 1st ICAPS Workshop on Hierarchical Planning</i>, AAAI, 2018, pp. 31–39.","short":"F. Mohr, T. Lettmann, E. Hüllermeier, M.D. Wever, in: Proceedings of the 1st ICAPS Workshop on Hierarchical Planning, AAAI, 2018, pp. 31–39."},"has_accepted_license":"1","conference":{"location":"Delft, Netherlands","end_date":"2018-06-29","start_date":"2018-06-24","name":"28th International Conference on Automated Planning and Scheduling"},"main_file_link":[{"open_access":"1","url":"http://icaps18.icaps-conference.org/fileadmin/alg/conferences/icaps18/workshops/workshop08/docs/Mohr18ProgrammaticPlanning.pdf"}],"oa":"1","date_updated":"2022-01-06T06:58:08Z","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"first_name":"Theodor","last_name":"Lettmann","orcid":"0000-0001-5859-2457","full_name":"Lettmann, Theodor","id":"315"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"}]},{"publication":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings","file":[{"file_id":"5253","access_level":"closed","file_name":"PracticalAnonymousAndPubliclyL.pdf","file_size":3371773,"creator":"ups","date_created":"2018-11-02T13:45:40Z","date_updated":"2018-11-02T13:45:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["004"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Springer International Publishing","date_created":"2018-05-24T11:14:02Z","title":"Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems","type":"conference","status":"public","_id":"2862","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"7"},{"_id":"64"}],"user_id":"477","file_date_updated":"2018-11-02T13:45:40Z","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319769523","9783319769530"]},"publication_status":"published","place":"Cham","page":"470-490","citation":{"short":"J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.","bibtex":"@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>}, booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing}, author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490} }","mla":"Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing, 2018, pp. 470–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>.","apa":"Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i> (pp. 470–490). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>","ama":"Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>. Cham: Springer International Publishing; 2018:470-490. doi:<a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">10.1007/978-3-319-76953-0_25</a>","chicago":"Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-76953-0_25\">https://doi.org/10.1007/978-3-319-76953-0_25</a>.","ieee":"J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>, San Francisco, CA, USA, 2018, pp. 470–490."},"oa":"1","date_updated":"2022-01-06T06:58:12Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Fabian","last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian"},{"id":"48090","full_name":"Juhnke, Jakob","last_name":"Juhnke","first_name":"Jakob"}],"conference":{"start_date":"2018-04-16","name":"Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018","location":"San Francisco, CA, USA","end_date":"2018-04-20"},"doi":"10.1007/978-3-319-76953-0_25","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/029"}]},{"main_file_link":[{"open_access":"1","url":"https://ieeexplore.ieee.org/abstract/document/8456422"}],"conference":{"location":"San Francisco, CA, USA","end_date":"2018-07-07","start_date":"2018-07-02","name":"IEEE International Conference on Services Computing, SCC 2018"},"doi":"10.1109/SCC.2018.00036","date_updated":"2022-01-06T06:56:32Z","oa":"1","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176","first_name":"Marcel Dominik"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}],"place":"San Francisco, CA, USA","citation":{"chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “On-The-Fly Service Construction with Prototypes.” In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society, 2018. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “On-The-Fly Service Construction with Prototypes,” in <i>SCC</i>, San Francisco, CA, USA, 2018.","ama":"Mohr F, Wever MD, Hüllermeier E. On-The-Fly Service Construction with Prototypes. In: <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society; 2018. doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>","bibtex":"@inproceedings{Mohr_Wever_Hüllermeier_2018, place={San Francisco, CA, USA}, title={On-The-Fly Service Construction with Prototypes}, DOI={<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>}, booktitle={SCC}, publisher={IEEE Computer Society}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","mla":"Mohr, Felix, et al. “On-The-Fly Service Construction with Prototypes.” <i>SCC</i>, IEEE Computer Society, 2018, doi:<a href=\"https://doi.org/10.1109/SCC.2018.00036\">10.1109/SCC.2018.00036</a>.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, in: SCC, IEEE Computer Society, San Francisco, CA, USA, 2018.","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). On-The-Fly Service Construction with Prototypes. In <i>SCC</i>. San Francisco, CA, USA: IEEE Computer Society. <a href=\"https://doi.org/10.1109/SCC.2018.00036\">https://doi.org/10.1109/SCC.2018.00036</a>"},"has_accepted_license":"1","file_date_updated":"2018-11-06T15:15:38Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"2471","user_id":"49109","department":[{"_id":"355"}],"status":"public","type":"conference","title":"On-The-Fly Service Construction with Prototypes","publisher":"IEEE Computer Society","date_created":"2018-04-23T11:40:20Z","year":"2018","ddc":["000"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2018-11-06T15:15:38Z","creator":"wever","date_created":"2018-11-06T15:15:38Z","file_size":356132,"file_name":"08456422.pdf","access_level":"closed","file_id":"5383","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"SCC"},{"_id":"2472","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"126","ddc":["000"],"file_date_updated":"2018-04-24T08:04:02Z","type":"conference","status":"public","file":[{"access_level":"closed","file_id":"2473","file_name":"p2262-auroux.pdf","file_size":371352,"date_created":"2018-04-24T08:04:02Z","creator":"tabu","date_updated":"2018-04-24T08:04:02Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T06:56:33Z","publisher":"Proc. of IEEE Wireless Communications and Networking Conference (WCNC)","date_created":"2018-04-24T08:04:28Z","author":[{"full_name":"Auroux, Sébastien","last_name":"Auroux","first_name":"Sébastien"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"title":"Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks","doi":" 10.1109/WCNC.2018.8377335","has_accepted_license":"1","year":"2018","citation":{"ama":"Auroux S, Karl H. Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. In: Proc. of IEEE Wireless Communications and Networking Conference (WCNC); 2018. doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>","ieee":"S. Auroux and H. Karl, “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks,” 2018.","chicago":"Auroux, Sébastien, and Holger Karl. “Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks.” Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018. <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>.","short":"S. Auroux, H. Karl, in: Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018.","bibtex":"@inproceedings{Auroux_Karl_2018, title={Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}, DOI={<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>}, publisher={Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}, author={Auroux, Sébastien and Karl, Holger}, year={2018} }","mla":"Auroux, Sébastien, and Holger Karl. <i>Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks</i>. Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2018, doi:<a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\"> 10.1109/WCNC.2018.8377335</a>.","apa":"Auroux, S., &#38; Karl, H. (2018). Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks. Proc. of IEEE Wireless Communications and Networking Conference (WCNC). <a href=\"https://doi.org/ 10.1109/WCNC.2018.8377335\">https://doi.org/ 10.1109/WCNC.2018.8377335</a>"}},{"ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T09:56:27Z","_id":"2564","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"department":[{"_id":"276"}],"user_id":"16205","status":"public","file":[{"access_level":"closed","file_id":"5475","file_name":"1359-doc.pdf","file_size":553078,"creator":"d0mi","date_created":"2018-11-12T09:56:27Z","date_updated":"2018-11-12T09:56:27Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","type":"conference","title":"In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance","conference":{"end_date":"2018-06-28","location":"Portsmouth, UK","name":"25th European Conference on Information Systems (ECIS)","start_date":"2018-06-23"},"date_updated":"2022-01-06T06:57:08Z","author":[{"first_name":"Dominik","last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik"}],"date_created":"2018-05-02T13:10:34Z","year":"2018","citation":{"bibtex":"@inproceedings{Gutt_2018, title={In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={Gutt, Dominik}, year={2018} }","mla":"Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance.” <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2018.","short":"D. Gutt, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2018.","apa":"Gutt, D. (2018). In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance. In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>. Portsmouth, UK.","ieee":"D. Gutt, “In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance,” in <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, Portsmouth, UK, 2018.","chicago":"Gutt, Dominik. “In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance.” In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2018.","ama":"Gutt D. In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance. In: <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>. ; 2018."},"has_accepted_license":"1","publication_status":"published"},{"volume":112,"author":[{"full_name":"Hoof, Simon","id":"59676","last_name":"Hoof","first_name":"Simon"}],"date_updated":"2022-01-06T06:57:09Z","has_accepted_license":"1","intvolume":"       112","citation":{"apa":"Hoof, S. (2018). <i>Feedback Pareto weights in cooperative NTU differential games</i> (Vol. 112). CIE Working Paper Series, Paderborn University.","bibtex":"@book{Hoof_2018, series={Working Papers CIE}, title={Feedback Pareto weights in cooperative NTU differential games}, volume={112}, publisher={CIE Working Paper Series, Paderborn University}, author={Hoof, Simon}, year={2018}, collection={Working Papers CIE} }","short":"S. Hoof, Feedback Pareto Weights in Cooperative NTU Differential Games, CIE Working Paper Series, Paderborn University, 2018.","mla":"Hoof, Simon. <i>Feedback Pareto Weights in Cooperative NTU Differential Games</i>. Vol. 112, CIE Working Paper Series, Paderborn University, 2018.","chicago":"Hoof, Simon. <i>Feedback Pareto Weights in Cooperative NTU Differential Games</i>. Vol. 112. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2018.","ieee":"S. Hoof, <i>Feedback Pareto weights in cooperative NTU differential games</i>, vol. 112. CIE Working Paper Series, Paderborn University, 2018.","ama":"Hoof S. <i>Feedback Pareto Weights in Cooperative NTU Differential Games</i>. Vol 112. CIE Working Paper Series, Paderborn University; 2018."},"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","_id":"2565","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-09-13T07:29:48Z","type":"working_paper","status":"public","date_created":"2018-05-03T07:50:57Z","publisher":"CIE Working Paper Series, Paderborn University","title":"Feedback Pareto weights in cooperative NTU differential games","year":"2018","language":[{"iso":"eng"}],"keyword":["NTU differential games","variable Pareto weights","agreeability"],"ddc":["040"],"file":[{"file_size":263766,"file_name":"WP - Feedback Pareto weights in cooperative NTU differential games.pdf","access_level":"closed","file_id":"4382","date_updated":"2018-09-13T07:29:48Z","creator":"stela","date_created":"2018-09-13T07:29:48Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"This note deals with agreeability in nontransferable utility (NTU) differential games. We introduce state feedback Pareto weights to enrich the set of efficient cooperative solutions. The framework is particularly useful if constant weights fail to support agreeability, but cooperation is desired nonetheless. The concept is applied to an adverting differential game."}]},{"volume":170,"author":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"},{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun"}],"date_updated":"2022-01-06T06:57:09Z","doi":"10.1016/j.econlet.2018.05.033","has_accepted_license":"1","publication_status":"published","page":"39 - 41","intvolume":"       170","citation":{"apa":"Haake, C.-J., &#38; Stroh-Maraun, N. (2018). Outcome Equivalence in School Choice with Reciprocal Preferences. <i>Economics Letters</i>, <i>170</i>, 39–41. <a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">https://doi.org/10.1016/j.econlet.2018.05.033</a>","mla":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School Choice with Reciprocal Preferences.” <i>Economics Letters</i>, vol. 170, Elsevier, 2018, pp. 39–41, doi:<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>.","bibtex":"@article{Haake_Stroh-Maraun_2018, title={Outcome Equivalence in School Choice with Reciprocal Preferences}, volume={170}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>}, journal={Economics Letters}, publisher={Elsevier}, author={Haake, Claus-Jochen and Stroh-Maraun, Nadja}, year={2018}, pages={39–41} }","short":"C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.","ieee":"C.-J. Haake and N. Stroh-Maraun, “Outcome Equivalence in School Choice with Reciprocal Preferences,” <i>Economics Letters</i>, vol. 170, pp. 39–41, 2018.","chicago":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School Choice with Reciprocal Preferences.” <i>Economics Letters</i> 170 (2018): 39–41. <a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">https://doi.org/10.1016/j.econlet.2018.05.033</a>.","ama":"Haake C-J, Stroh-Maraun N. Outcome Equivalence in School Choice with Reciprocal Preferences. <i>Economics Letters</i>. 2018;170:39-41. doi:<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>"},"department":[{"_id":"205"}],"user_id":"477","_id":"2566","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-08-09T09:15:07Z","type":"journal_article","status":"public","urn":"25669","date_created":"2018-05-03T07:53:56Z","publisher":"Elsevier","title":"Outcome Equivalence in School Choice with Reciprocal Preferences","year":"2018","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Economics Letters","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-08-09T08:08:17Z","creator":"cjhaake","date_updated":"2018-08-09T09:15:07Z","access_level":"closed","file_id":"3854","file_name":"1-s2.0-S016517651830212X-main.pdf","file_size":261888,"title":"Outcome equivalence in school choice with reciprocal preferences"}],"abstract":[{"text":"We show that the Boston school choice mechanism (BM), the student proposing deferred acceptance algorithm (DA) and the top trading cycles algorithm (TTC) generate the same outcome when the colleges’ priorities are modified according to students’ preferences in a “first preferences first” manner. This outcome coincides with the BM outcome under original priorities. As a result, the DA and TTC mechanism that are non-manipulable under original priorities become vulnerable to strategic behavior.","lang":"eng"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"2660","user_id":"477","department":[{"_id":"276"}],"ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T10:37:12Z","type":"conference_abstract","publication":"Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-12T10:37:12Z","date_created":"2018-11-12T10:37:12Z","creator":"d0mi","file_size":694342,"access_level":"closed","file_id":"5491","file_name":"WP_TRP.pdf"}],"status":"public","date_updated":"2022-01-06T06:57:23Z","author":[{"last_name":"Neumann","id":"32456","full_name":"Neumann, Jürgen","first_name":"Jürgen"},{"first_name":"Dominik","full_name":"Gutt, Dominik","id":"14368","last_name":"Gutt"},{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-05-04T12:39:06Z","title":"The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior","conference":{"location":"Rotterdam, Netherland","name":"Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)"},"has_accepted_license":"1","year":"2018","citation":{"ama":"Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</i>. ; 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>Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</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>Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</i>, Rotterdam, Netherland, 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>Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</i>. Rotterdam, Netherland.","bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2018, title={The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior}, booktitle={Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2018} }","mla":"Neumann, Jürgen, et al. “The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior.” <i>Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)</i>, 2018.","short":"J. Neumann, D. Gutt, D. Kundisch, in: Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR), 2018."}}]