[{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"42281","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","year":"2019","citation":{"apa":"N., N. (2019). <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn.","short":"N. N., A Bargaining Model for Relative Profit and Market Share Delegation Contracts, Universität Paderborn, 2019.","mla":"N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={A bargaining model for relative profit and market share delegation contracts}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn; 2019.","chicago":"N., N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn, 2019."},"title":"A bargaining model for relative profit and market share delegation contracts","date_updated":"2023-05-23T12:47:58Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_created":"2023-02-22T10:53:58Z"},{"citation":{"short":"N. N., Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden, Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn.","chicago":"N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn; 2019."},"year":"2019","title":"Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden","date_created":"2023-02-09T09:23:13Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2023-05-23T12:48:17Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"41926"},{"_id":"42277","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2023-05-23T12:48:10Z","publisher":"Universität Paderborn","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2023-02-22T10:49:08Z","supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"title":"Der Shapley-Wert als Index für phylogenetische Diversität","year":"2019","citation":{"apa":"N., N. (2019). <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn.","bibtex":"@book{N._2019, title={Der Shapley-Wert als Index für phylogenetische Diversität}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","short":"N. N., Der Shapley-Wert als Index für phylogenetische Diversität, Universität Paderborn, 2019.","mla":"N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn; 2019.","chicago":"N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42283","citation":{"ieee":"N. N., <i>Student’s school matching mechanisms in the US</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn; 2019.","apa":"N., N. (2019). <i>Student’s school matching mechanisms in the US</i>. Universität Paderborn.","mla":"N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Student’s school matching mechanisms in the US}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","short":"N. N., Student’s School Matching Mechanisms in the US, Universität Paderborn, 2019."},"year":"2019","title":"Student's school matching mechanisms in the US","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_created":"2023-02-22T10:55:19Z","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:47:52Z"},{"title":"Fully-Dynamic Bin Packing with Little Repacking","publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-04-24T15:21:56Z","year":"2018","ddc":["000"],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.01231"]},"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."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5227","access_level":"closed","file_name":"LIPIcs-ICALP-2018-51.pdf","file_size":723824,"date_created":"2018-10-31T16:58:18Z","creator":"feldi","date_updated":"2018-10-31T16:58:18Z"}],"publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","doi":"10.4230/LIPIcs.ICALP.2018.51","conference":{"location":"Prag","end_date":"2018-07-13","start_date":"2018-07-10","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)"},"date_updated":"2022-01-06T06:56:39Z","author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Anupam","last_name":"Gupta","full_name":"Gupta, Anupam"},{"first_name":"Guru","full_name":"Guruganesh, Guru","last_name":"Guruganesh"},{"first_name":"Amit ","last_name":"Kumar","full_name":"Kumar, Amit "},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"first_name":"David","last_name":"Wajc","full_name":"Wajc, David"}],"volume":107,"place":"Dagstuhl, Germany","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>.","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>","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.","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>.","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)} }"},"page":"51:1-51:24","intvolume":"       107","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-3-95977-076-7"],"issn":["1868-8969"]},"file_date_updated":"2018-10-31T16:58:18Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"2484","user_id":"14052","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"541"},{"_id":"63"}],"editor":[{"last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis","first_name":"Ioannis"},{"full_name":"Kaklamanis, Christos","last_name":"Kaklamanis","first_name":"Christos"},{"last_name":"Marx","full_name":"Marx, Dániel","first_name":"Dániel"},{"full_name":"Sannella, Donald","last_name":"Sannella","first_name":"Donald"}],"status":"public","type":"conference"},{"user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2485","file_date_updated":"2018-11-02T14:42:33Z","type":"conference","status":"public","author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:56:39Z","doi":"10.1145/3210377.3210389","conference":{"name":"SPAA'18","location":"Wien"},"publication_status":"published","has_accepted_license":"1","citation":{"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} }","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.","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>.","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>","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."},"page":"373 - 381 ","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1207546,"file_name":"p373-feldkord.pdf","file_id":"5280","access_level":"closed","date_updated":"2018-11-02T14:42:33Z","date_created":"2018-11-02T14:42:33Z","creator":"ups"}],"date_created":"2018-04-25T08:49:43Z","publisher":"ACM","title":"Online Facility Location with Mobile Facilities","year":"2018"},{"doi":"10.1145/3230654.3230659","conference":{"name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)","start_date":"2018-06-18","end_date":"2018-06-18","location":"Irvine, California, USA"},"author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"},{"first_name":"Nadja","last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja"}],"date_updated":"2022-01-06T06:58:01Z","page":"5:1-5:6","citation":{"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.","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>.","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>","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>","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>.","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} }","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","file_date_updated":"2018-08-15T07:30:50Z","department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"user_id":"14052","_id":"2831","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"conference","title":"Disaggregating User Evaluations Using the Shapley Value","date_created":"2018-05-22T10:28:51Z","year":"2018","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"file_id":"3910","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","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"}],"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."}],"publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)"},{"type":"journal_article","publication":"Theory of Computing Systems","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1371624,"file_name":"ApproximationAndHeuristicAlgor.pdf","access_level":"closed","file_id":"5301","date_updated":"2018-11-02T15:24:32Z","creator":"ups","date_created":"2018-11-02T15:24:32Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"2849","user_id":"477","department":[{"_id":"63"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:24:32Z","has_accepted_license":"1","publication_identifier":{"unknown":["1432-4350"]},"year":"2018","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>","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>","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.","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>."},"publisher":"Springer","date_updated":"2022-01-06T06:58:06Z","date_created":"2018-05-24T08:39:15Z","author":[{"first_name":"Faisal N. ","last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. "},{"first_name":"Christine","full_name":"Markarian, Christine","id":"37612","last_name":"Markarian"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Michael","full_name":"Schubert, Michael","last_name":"Schubert"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","doi":"10.1007/s00224-017-9836-z"},{"has_accepted_license":"1","year":"2018","citation":{"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>","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.","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>.","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>.","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} }","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","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>"},"date_updated":"2022-01-06T06:58:07Z","date_created":"2018-05-24T08:41:48Z","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Markarian, Christine","id":"37612","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Wahby, Mostafa","last_name":"Wahby","first_name":"Mostafa"}],"title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","doi":"10.4230/LIPIcs.FUN.2018.22","publication":"Ninth International Conference on Fun with Algorithms (FUN)","type":"conference","status":"public","file":[{"date_created":"2018-11-13T13:15:19Z","creator":"feldi","date_updated":"2018-11-13T13:15:19Z","file_id":"5536","file_name":"LIPIcs-FUN-2018-22.pdf","access_level":"closed","file_size":554298,"content_type":"application/pdf","relation":"main_file","success":1}],"_id":"2850","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-13T13:15:19Z"},{"publication_status":"published","has_accepted_license":"1","citation":{"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.","short":"D. Gutt, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 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.","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} }","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."},"year":"2018","author":[{"id":"14368","full_name":"Gutt, Dominik","last_name":"Gutt","first_name":"Dominik"}],"date_created":"2018-05-02T13:10:34Z","date_updated":"2022-01-06T06:57:08Z","conference":{"start_date":"2018-06-23","name":"25th European Conference on Information Systems (ECIS)","location":"Portsmouth, UK","end_date":"2018-06-28"},"title":"In the Eye of the Beholder? – Empirically Decomposing Different Economic Implications of the Online Rating Variance","type":"conference","publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-12T09:56:27Z","creator":"d0mi","date_updated":"2018-11-12T09:56:27Z","access_level":"closed","file_name":"1359-doc.pdf","file_id":"5475","file_size":553078}],"status":"public","user_id":"16205","department":[{"_id":"276"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"2564","file_date_updated":"2018-11-12T09:56:27Z","language":[{"iso":"eng"}],"ddc":["330"]},{"file_date_updated":"2018-09-13T07:29:48Z","_id":"2565","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","status":"public","type":"working_paper","date_updated":"2022-01-06T06:57:09Z","volume":112,"author":[{"first_name":"Simon","full_name":"Hoof, Simon","id":"59676","last_name":"Hoof"}],"intvolume":"       112","citation":{"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.","apa":"Hoof, S. (2018). <i>Feedback Pareto weights in cooperative NTU differential games</i> (Vol. 112). CIE Working Paper Series, Paderborn University.","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."},"has_accepted_license":"1","keyword":["NTU differential games","variable Pareto weights","agreeability"],"ddc":["040"],"language":[{"iso":"eng"}],"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."}],"file":[{"creator":"stela","date_created":"2018-09-13T07:29:48Z","date_updated":"2018-09-13T07:29:48Z","access_level":"closed","file_name":"WP - Feedback Pareto weights in cooperative NTU differential games.pdf","file_id":"4382","file_size":263766,"content_type":"application/pdf","relation":"main_file","success":1}],"title":"Feedback Pareto weights in cooperative NTU differential games","publisher":"CIE Working Paper Series, Paderborn University","date_created":"2018-05-03T07:50:57Z","year":"2018"},{"publication_status":"published","has_accepted_license":"1","citation":{"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} }","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>.","short":"C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.","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>","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>","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>."},"intvolume":"       170","page":"39 - 41","date_updated":"2022-01-06T06:57:09Z","author":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun","first_name":"Nadja"}],"volume":170,"doi":"10.1016/j.econlet.2018.05.033","type":"journal_article","urn":"25669","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"2566","user_id":"477","department":[{"_id":"205"}],"file_date_updated":"2018-08-09T09:15:07Z","year":"2018","publisher":"Elsevier","date_created":"2018-05-03T07:53:56Z","title":"Outcome Equivalence in School Choice with Reciprocal Preferences","publication":"Economics Letters","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"}],"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_name":"1-s2.0-S016517651830212X-main.pdf","file_id":"3854","file_size":261888,"title":"Outcome equivalence in school choice with reciprocal preferences"}],"ddc":["040"],"language":[{"iso":"eng"}]},{"department":[{"_id":"276"}],"user_id":"477","_id":"2660","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"file_date_updated":"2018-11-12T10:37:12Z","language":[{"iso":"eng"}],"ddc":["330"],"publication":"Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)","type":"conference_abstract","status":"public","file":[{"creator":"d0mi","date_created":"2018-11-12T10:37:12Z","date_updated":"2018-11-12T10:37:12Z","access_level":"closed","file_name":"WP_TRP.pdf","file_id":"5491","file_size":694342,"content_type":"application/pdf","relation":"main_file","success":1}],"date_created":"2018-05-04T12:39:06Z","author":[{"first_name":"Jürgen","full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann"},{"last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik","first_name":"Dominik"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"}],"date_updated":"2022-01-06T06:57:23Z","conference":{"name":"Symposium on Statistical Challenges in Electronic Commerce Research (SCECR)","location":"Rotterdam, Netherland"},"title":"The Traveling Reviewer Problem - Exploring the Relationship Between Offline Locations and Online Rating Behavior","has_accepted_license":"1","citation":{"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.","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.","short":"J. Neumann, D. Gutt, D. Kundisch, in: Conference Abstracts of the Symposium on Statistical Challenges in Electronic Commerce Research (SCECR), 2018.","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.","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."},"year":"2018"},{"status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"3313","user_id":"477","department":[{"_id":"183"}],"year":"2018","citation":{"ama":"Maurer A. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn; 2018.","chicago":"Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","ieee":"A. Maurer, <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","mla":"Maurer, Alexandra. <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn, 2018.","bibtex":"@book{Maurer_2018, title={Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Maurer, Alexandra}, year={2018} }","short":"A. Maurer, Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse, Universität Paderborn, 2018.","apa":"Maurer, A. (2018). <i>Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse</i>. Universität Paderborn."},"title":"Kundenbewertungen und Produktnachfrage: Eine ökonomische Analyse","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","author":[{"first_name":"Alexandra","full_name":"Maurer, Alexandra","last_name":"Maurer"}],"date_created":"2018-06-22T12:19:02Z","supervisor":[{"last_name":"Frick","full_name":"Frick, Bernd","first_name":"Bernd"}]},{"year":"2018","citation":{"ieee":"L. J. Michels, <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","chicago":"Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","ama":"Michels LJ. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn; 2018.","bibtex":"@book{Michels_2018, title={The Segmentation of Video-On-Demand Consumers}, publisher={Universität Paderborn}, author={Michels, Luisa Juliane}, year={2018} }","mla":"Michels, Luisa Juliane. <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn, 2018.","short":"L.J. Michels, The Segmentation of Video-On-Demand Consumers, Universität Paderborn, 2018.","apa":"Michels, L. J. (2018). <i>The Segmentation of Video-On-Demand Consumers</i>. Universität Paderborn."},"title":"The Segmentation of Video-On-Demand Consumers","date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","date_created":"2018-06-22T12:20:47Z","supervisor":[{"first_name":"Bernd","full_name":"Frick, Bernd","last_name":"Frick"},{"id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann","first_name":"Daniel"}],"author":[{"last_name":"Michels","full_name":"Michels, Luisa Juliane","first_name":"Luisa Juliane"}],"status":"public","type":"mastersthesis","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"3314","user_id":"477","department":[{"_id":"183"}]},{"supervisor":[{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"},{"first_name":"Daniel","full_name":"Kaimann, Daniel","last_name":"Kaimann"}],"author":[{"last_name":"Walter","full_name":"Walter, Miriam","first_name":"Miriam"}],"date_created":"2018-06-22T12:22:31Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z","title":"Sentiment Analysis of User-generated Ratings in the Sharing Economy ","citation":{"apa":"Walter, M. (2018). <i>Sentiment Analysis of User-generated Ratings in the Sharing Economy </i>. Universität Paderborn.","mla":"Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","short":"M. Walter, Sentiment Analysis of User-Generated Ratings in the Sharing Economy , Universität Paderborn, 2018.","bibtex":"@book{Walter_2018, title={Sentiment Analysis of User-generated Ratings in the Sharing Economy }, publisher={Universität Paderborn}, author={Walter, Miriam}, year={2018} }","chicago":"Walter, Miriam. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","ieee":"M. Walter, <i>Sentiment Analysis of User-generated Ratings in the Sharing Economy </i>. Universität Paderborn, 2018.","ama":"Walter M. <i>Sentiment Analysis of User-Generated Ratings in the Sharing Economy </i>. Universität Paderborn; 2018."},"year":"2018","user_id":"477","department":[{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"3315","type":"mastersthesis","status":"public"},{"status":"public","type":"mastersthesis","_id":"3316","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"183"}],"user_id":"477","year":"2018","citation":{"ama":"Korn H. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn; 2018.","ieee":"H. Korn, <i>Restaurant reputation and meal prices: empricial evidence from the German restaurant industry</i>. Universität Paderborn, 2018.","chicago":"Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn, 2018.","short":"H. Korn, Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry, Universität Paderborn, 2018.","bibtex":"@book{Korn_2018, title={Restaurant reputation and meal prices: empricial evidence from the German restaurant industry}, publisher={Universität Paderborn}, author={Korn, Hanna}, year={2018} }","mla":"Korn, Hanna. <i>Restaurant Reputation and Meal Prices: Empricial Evidence from the German Restaurant Industry</i>. Universität Paderborn, 2018.","apa":"Korn, H. (2018). <i>Restaurant reputation and meal prices: empricial evidence from the German restaurant industry</i>. Universität Paderborn."},"title":"Restaurant reputation and meal prices: empricial evidence from the German restaurant industry","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z","author":[{"full_name":"Korn, Hanna","last_name":"Korn","first_name":"Hanna"}],"date_created":"2018-06-22T12:24:16Z","supervisor":[{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"}]},{"publication":"Static & Dynamic Game Theory: Foundations & Applications","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T16:10:34Z","date_updated":"2018-11-02T16:10:34Z","access_level":"closed","file_name":"Hoof2018_Chapter_DynamicVoluntaryProvisionOfPub.pdf","file_id":"5325","file_size":199568}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Springer International Publishing","date_created":"2018-08-01T09:51:57Z","title":"Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution","type":"book_chapter","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"3742","user_id":"477","department":[{"_id":"205"}],"file_date_updated":"2018-11-02T16:10:34Z","publication_status":"published","publication_identifier":{"issn":["2363-8516","2363-8524"],"isbn":["9783319929873","9783319929880"]},"has_accepted_license":"1","place":"Cham","citation":{"ama":"Hoof S. Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution. In: <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>. Cham: Springer International Publishing; 2018:13-23. doi:<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>","ieee":"S. Hoof, “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution,” in <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, Cham: Springer International Publishing, 2018, pp. 13–23.","chicago":"Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution.” In <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, 13–23. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">https://doi.org/10.1007/978-3-319-92988-0_2</a>.","apa":"Hoof, S. (2018). Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution. In <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i> (pp. 13–23). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">https://doi.org/10.1007/978-3-319-92988-0_2</a>","mla":"Hoof, Simon. “Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution.” <i>Static &#38; Dynamic Game Theory: Foundations &#38; Applications</i>, Springer International Publishing, 2018, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>.","short":"S. Hoof, in: Static &#38; Dynamic Game Theory: Foundations &#38; Applications, Springer International Publishing, Cham, 2018, pp. 13–23.","bibtex":"@inbook{Hoof_2018, place={Cham}, title={Dynamic Voluntary Provision of Public Goods: The Recursive Nash Bargaining Solution}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92988-0_2\">10.1007/978-3-319-92988-0_2</a>}, booktitle={Static &#38; Dynamic Game Theory: Foundations &#38; Applications}, publisher={Springer International Publishing}, author={Hoof, Simon}, year={2018}, pages={13–23} }"},"page":"13-23","date_updated":"2022-01-06T06:59:34Z","author":[{"first_name":"Simon","full_name":"Hoof, Simon","id":"59676","last_name":"Hoof"}],"doi":"10.1007/978-3-319-92988-0_2"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"3851","user_id":"14052","department":[{"_id":"541"},{"_id":"63"}],"year":"2018","citation":{"ama":"Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn; 2018.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","chicago":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","mla":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn."},"title":"Congestion Games mit gewichteten Strategien","date_updated":"2022-01-06T06:59:45Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"author":[{"full_name":"Koop, Samuel","last_name":"Koop","first_name":"Samuel"}],"date_created":"2018-08-08T11:56:37Z"},{"citation":{"ama":"Haake C-J, Qin C-Z. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol 113. Paderborn University: CIE Working Paper Series, Paderborn University; 2018.","chicago":"Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol. 113. Working Papers CIE. Paderborn University: CIE Working Paper Series, Paderborn University, 2018.","ieee":"C.-J. Haake and C.-Z. Qin, <i>On unification of solutions to the bargaining problem</i>, vol. 113. Paderborn University: CIE Working Paper Series, Paderborn University, 2018.","bibtex":"@book{Haake_Qin_2018, place={Paderborn University}, series={Working Papers CIE}, title={On unification of solutions to the bargaining problem}, volume={113}, publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen and Qin, Cheng-Zhong}, year={2018}, collection={Working Papers CIE} }","mla":"Haake, Claus-Jochen, and Cheng-Zhong Qin. <i>On Unification of Solutions to the Bargaining Problem</i>. Vol. 113, CIE Working Paper Series, Paderborn University, 2018.","short":"C.-J. Haake, C.-Z. Qin, On Unification of Solutions to the Bargaining Problem, CIE Working Paper Series, Paderborn University, Paderborn University, 2018.","apa":"Haake, C.-J., &#38; Qin, C.-Z. (2018). <i>On unification of solutions to the bargaining problem</i> (Vol. 113). Paderborn University: CIE Working Paper Series, Paderborn University."},"intvolume":"       113","place":"Paderborn University","has_accepted_license":"1","author":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"full_name":"Qin, Cheng-Zhong","last_name":"Qin","first_name":"Cheng-Zhong"}],"volume":113,"date_updated":"2022-01-06T06:58:48Z","status":"public","urn":"29332","type":"working_paper","file_date_updated":"2018-08-09T09:14:52Z","user_id":"65453","series_title":"Working Papers CIE","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":"2933","year":"2018","title":"On unification of solutions to the bargaining problem","date_created":"2018-05-28T07:00:28Z","publisher":"CIE Working Paper Series, Paderborn University","file":[{"relation":"main_file","content_type":"application/pdf","file_size":469001,"title":"On unification of solutions to the bargaining problem","file_name":"On unification of solutions to the bargaining problem.pdf","access_level":"closed","file_id":"3855","date_updated":"2018-08-09T09:14:52Z","date_created":"2018-08-09T08:15:31Z","creator":"cjhaake"}],"abstract":[{"text":"We establish axioms under which a bargaining solution can be found by the maximization of the CES function and is unique up to specification of the distribution and elasticity parameters. This solution is referred to as the CES solution which includes the NASH and egalitarian solutions as special cases. Next, we consider a normalization of the CES function and establish axioms, under which a bargaining solution can be found by the maximization of the normalized CES and is unique up to the specifications of the distribution and its substitution parameters. We refer to this solution as the normalized CES solution, which includes the Nash and Kalai-Smorodinsky solutions as special cases. Our paper contributes to bargaining theory by establishing unified characterizations of existing as well as a great variety of new bargaining solutions.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["040"],"keyword":["Bargaining problem","CES Function","Normalized CES Function","Nash solution","Kalai-Smorodinsky Solution","Egalitarian Solution."]}]