[{"citation":{"ieee":"N. N., <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019.","short":"N. N., Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse, Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn."},"year":"2019","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2023-02-22T10:58:10Z","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"date_updated":"2023-05-23T12:47:40Z","publisher":"Universität Paderborn","title":"Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse","type":"bachelorsthesis","status":"public","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"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42285","language":[{"iso":"ger"}]},{"user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42281","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2023-02-22T10:53:58Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:47:58Z","title":"A bargaining model for relative profit and market share delegation contracts","citation":{"apa":"N., N. (2019). <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn.","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} }","short":"N. N., A Bargaining Model for Relative Profit and Market Share Delegation Contracts, Universität Paderborn, 2019.","ieee":"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.","ama":"N. N. <i>A Bargaining Model for Relative Profit and Market Share Delegation Contracts</i>. Universität Paderborn; 2019."},"year":"2019"},{"title":"Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:48:17Z","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"}],"year":"2019","citation":{"ama":"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.","chicago":"N., N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. 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.","short":"N. N., Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden, Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn."},"language":[{"iso":"ger"}],"_id":"41926","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","status":"public","type":"bachelorsthesis"},{"title":"Der Shapley-Wert als Index für phylogenetische Diversität","date_created":"2023-02-22T10:49:08Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2023-05-23T12:48:10Z","publisher":"Universität Paderborn","citation":{"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.","ama":"N. N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn; 2019.","short":"N. N., Der Shapley-Wert als Index für phylogenetische Diversität, Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Der Shapley-Wert als Index für phylogenetische Diversität}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Der Shapley-Wert als Index für phylogenetische Diversität</i>. Universität Paderborn."},"year":"2019","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":"42277","status":"public","type":"bachelorsthesis"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"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","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"year":"2019","citation":{"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.","chicago":"N., N. <i>Student’s School Matching Mechanisms in the US</i>. Universität Paderborn, 2019.","ieee":"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."},"title":"Student's school matching mechanisms in the US","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:47:52Z","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"date_created":"2023-02-22T10:55:19Z"},{"publisher":"Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik","date_created":"2018-04-24T15:21:56Z","title":"Fully-Dynamic Bin Packing with Little Repacking","year":"2018","external_id":{"arxiv":["1711.01231"]},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","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":[{"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"}],"date_updated":"2022-01-06T06:56:39Z","volume":107,"author":[{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"},{"full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"full_name":"Gupta, Anupam","last_name":"Gupta","first_name":"Anupam"},{"last_name":"Guruganesh","full_name":"Guruganesh, Guru","first_name":"Guru"},{"first_name":"Amit ","full_name":"Kumar, Amit ","last_name":"Kumar"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"full_name":"Wajc, David","last_name":"Wajc","first_name":"David"}],"doi":"10.4230/LIPIcs.ICALP.2018.51","conference":{"end_date":"2018-07-13","location":"Prag","name":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)","start_date":"2018-07-10"},"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-076-7"]},"has_accepted_license":"1","publication_status":"published","place":"Dagstuhl, Germany","page":"51:1-51:24","intvolume":"       107","citation":{"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)} }","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>.","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>"},"_id":"2484","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"541"},{"_id":"63"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"14052","file_date_updated":"2018-10-31T16:58:18Z","type":"conference","editor":[{"first_name":"Ioannis","last_name":"Chatzigiannakis","full_name":"Chatzigiannakis, Ioannis"},{"last_name":"Kaklamanis","full_name":"Kaklamanis, Christos","first_name":"Christos"},{"first_name":"Dániel","last_name":"Marx","full_name":"Marx, Dániel"},{"first_name":"Donald","last_name":"Sannella","full_name":"Sannella, Donald"}],"status":"public"},{"publication_identifier":{"isbn":["978-1-4503-5916-0"]},"has_accepted_license":"1","publication_status":"published","page":"5:1-5:6","citation":{"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.","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>","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>","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>."},"author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"},{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"}],"date_updated":"2022-01-06T06:58:01Z","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"},"doi":"10.1145/3230654.3230659","type":"conference","status":"public","department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"user_id":"14052","_id":"2831","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"file_date_updated":"2018-08-15T07:30:50Z","year":"2018","date_created":"2018-05-22T10:28:51Z","title":"Disaggregating User Evaluations Using the Shapley Value","publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","file":[{"creator":"nmaraun","date_created":"2018-08-15T07:30:50Z","date_updated":"2018-08-15T07:30:50Z","access_level":"closed","file_id":"3910","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","file_size":1450171,"content_type":"application/pdf","relation":"main_file","success":1}],"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."}],"language":[{"iso":"eng"}],"ddc":["040"]},{"file_date_updated":"2018-09-13T07:29:48Z","_id":"2565","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"},{"_id":"475"}],"user_id":"65453","series_title":"Working Papers CIE","status":"public","type":"working_paper","date_updated":"2022-01-06T06:57:09Z","volume":112,"author":[{"full_name":"Hoof, Simon","id":"59676","last_name":"Hoof","first_name":"Simon"}],"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.","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.","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} }","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":[{"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.","lang":"eng"}],"file":[{"date_updated":"2018-09-13T07:29:48Z","date_created":"2018-09-13T07:29:48Z","creator":"stela","file_size":263766,"file_name":"WP - Feedback Pareto weights in cooperative NTU differential games.pdf","file_id":"4382","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"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"},{"title":"Outcome Equivalence in School Choice with Reciprocal Preferences","publisher":"Elsevier","date_created":"2018-05-03T07:53:56Z","year":"2018","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-08-09T09:15:07Z","creator":"cjhaake","date_created":"2018-08-09T08:08:17Z","title":"Outcome equivalence in school choice with reciprocal preferences","file_size":261888,"access_level":"closed","file_name":"1-s2.0-S016517651830212X-main.pdf","file_id":"3854"}],"publication":"Economics Letters","doi":"10.1016/j.econlet.2018.05.033","date_updated":"2022-01-06T06:57:09Z","volume":170,"author":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Nadja","id":"13264","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun"}],"intvolume":"       170","page":"39 - 41","citation":{"short":"C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.","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>.","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>."},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2018-08-09T09:15:07Z","_id":"2566","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"477","urn":"25669","status":"public","type":"journal_article"},{"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2363-8516","2363-8524"],"isbn":["9783319929873","9783319929880"]},"place":"Cham","citation":{"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>","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} }","short":"S. Hoof, in: Static &#38; Dynamic Game Theory: Foundations &#38; Applications, Springer International Publishing, Cham, 2018, pp. 13–23.","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>.","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>.","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>"},"page":"13-23","date_updated":"2022-01-06T06:59:34Z","author":[{"full_name":"Hoof, Simon","id":"59676","last_name":"Hoof","first_name":"Simon"}],"doi":"10.1007/978-3-319-92988-0_2","type":"book_chapter","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_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","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","publication":"Static & Dynamic Game Theory: Foundations & Applications","file":[{"date_created":"2018-11-02T16:10:34Z","creator":"ups","date_updated":"2018-11-02T16:10:34Z","file_name":"Hoof2018_Chapter_DynamicVoluntaryProvisionOfPub.pdf","access_level":"closed","file_id":"5325","file_size":199568,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["000"],"language":[{"iso":"eng"}]},{"supervisor":[{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"date_created":"2018-08-08T11:56:37Z","author":[{"first_name":"Samuel","full_name":"Koop, Samuel","last_name":"Koop"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:45Z","title":"Congestion Games mit gewichteten Strategien","citation":{"apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn.","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} }","mla":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","ama":"Koop S. <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.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018."},"year":"2018","user_id":"14052","department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"3851","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"date_created":"2018-05-28T07:00:28Z","publisher":"CIE Working Paper Series, Paderborn University","title":"On unification of solutions to the bargaining problem","year":"2018","language":[{"iso":"eng"}],"keyword":["Bargaining problem","CES Function","Normalized CES Function","Nash solution","Kalai-Smorodinsky Solution","Egalitarian Solution."],"ddc":["040"],"file":[{"date_updated":"2018-08-09T09:14:52Z","date_created":"2018-08-09T08:15:31Z","creator":"cjhaake","file_size":469001,"title":"On unification of solutions to the bargaining problem","access_level":"closed","file_id":"3855","file_name":"On unification of solutions to the bargaining problem.pdf","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","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."}],"volume":113,"author":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Cheng-Zhong","last_name":"Qin","full_name":"Qin, Cheng-Zhong"}],"date_updated":"2022-01-06T06:58:48Z","has_accepted_license":"1","intvolume":"       113","citation":{"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.","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.","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.","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} }","short":"C.-J. Haake, C.-Z. Qin, On Unification of Solutions to the Bargaining Problem, CIE Working Paper Series, Paderborn University, Paderborn University, 2018.","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."},"place":"Paderborn University","department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","_id":"2933","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-08-09T09:14:52Z","type":"working_paper","status":"public","urn":"29332"},{"_id":"3098","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"},{"_id":"475"}],"user_id":"477","series_title":"Studies in Economic Design","file_date_updated":"2018-08-09T09:14:11Z","type":"book_chapter","editor":[{"last_name":"Laslier","full_name":"Laslier, Jean-Francois","first_name":"Jean-Francois"},{"first_name":"Herve","full_name":"Moulin, Herve","last_name":"Moulin"},{"last_name":"Sanver","full_name":"Sanver, Remzi","first_name":"Remzi"},{"first_name":"William","last_name":"Zwicker","full_name":"Zwicker, William"}],"urn":"30987","status":"public","date_updated":"2022-01-06T06:58:55Z","volume":"(n.d.)","author":[{"first_name":"Walter","full_name":"Trockel, Walter","last_name":"Trockel"},{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"has_accepted_license":"1","publication_identifier":{"issn":["2510-3970"]},"publication_status":"accepted","place":"Heidelberg","citation":{"apa":"Trockel, W., &#38; Haake, C.-J. (n.d.). Thoughts on Social Design. In J.-F. Laslier, H. Moulin, R. Sanver, &#38; W. Zwicker (Eds.), <i>Studies in Economic Design</i> (Vol. (n.d.)). Heidelberg: Springer.","short":"W. Trockel, C.-J. Haake, in: J.-F. Laslier, H. Moulin, R. Sanver, W. Zwicker (Eds.), Studies in Economic Design, Springer, Heidelberg, n.d.","bibtex":"@inbook{Trockel_Haake, place={Heidelberg}, series={Studies in Economic Design}, title={Thoughts on Social Design}, volume={(n.d.)}, booktitle={Studies in Economic Design}, publisher={Springer}, author={Trockel, Walter and Haake, Claus-Jochen}, editor={Laslier, Jean-Francois and Moulin, Herve and Sanver, Remzi and Zwicker, WilliamEditors}, collection={Studies in Economic Design} }","mla":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier et al., vol. (n.d.), Springer.","ama":"Trockel W, Haake C-J. Thoughts on Social Design. In: Laslier J-F, Moulin H, Sanver R, Zwicker W, eds. <i>Studies in Economic Design</i>. Vol (n.d.). Studies in Economic Design. Heidelberg: Springer.","ieee":"W. Trockel and C.-J. Haake, “Thoughts on Social Design,” in <i>Studies in Economic Design</i>, vol. (n.d.), J.-F. Laslier, H. Moulin, R. Sanver, and W. Zwicker, Eds. Heidelberg: Springer.","chicago":"Trockel, Walter, and Claus-Jochen Haake. “Thoughts on Social Design.” In <i>Studies in Economic Design</i>, edited by Jean-Francois Laslier, Herve Moulin, Remzi Sanver, and William Zwicker, Vol. (n.d.). Studies in Economic Design. Heidelberg: Springer, n.d."},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Studies in Economic Design","abstract":[{"lang":"eng","text":"One of the fundamental problems in applications of methods and results\r\nfrom mechanism design and implementation theory is the effective enforcement of\r\ntheoretically established equilibria by which social choice rules are implemented.\r\nHurwicz (2008) and Myerson (2009) introduce different concepts of formalizing\r\nenforcement of institutional rules via the introduction of legal and illegal games. In\r\nthis note the relation of their concepts with that of a social system defined inDebreu\r\n(1952) is analyzed and its potential of being instrumental for modelling institution\r\ndesign is discussed. The existence proof for such a system, also known as generalized\r\ngame or abstract economy had been the basis for the existence proof of a\r\ncompetitive equilibrium of an economy."}],"file":[{"access_level":"closed","file_id":"3857","file_name":"WP - Thoughts on Social Design.pdf","file_size":141983,"title":"Thoughts on Social Design","date_created":"2018-08-09T08:36:24Z","creator":"cjhaake","date_updated":"2018-08-09T09:14:11Z","relation":"main_file","content_type":"application/pdf"}],"publisher":"Springer","date_created":"2018-06-06T17:07:28Z","title":"Thoughts on Social Design","quality_controlled":"1","year":"2018"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"8074","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"}],"user_id":"477","year":"2018","citation":{"ama":"Aykanat C. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn; 2018.","chicago":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","ieee":"C. Aykanat, <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn, 2018.","apa":"Aykanat, C. (2018). <i>Sharing Economy - Chancen und Risiken aus ökonomischer Sicht</i>. Universität Paderborn.","bibtex":"@book{Aykanat_2018, title={Sharing Economy - Chancen und Risiken aus ökonomischer Sicht}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2018} }","mla":"Aykanat, Cengiz. <i>Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht</i>. Universität Paderborn, 2018.","short":"C. Aykanat, Sharing Economy - Chancen Und Risiken Aus Ökonomischer Sicht, Universität Paderborn, 2018."},"title":"Sharing Economy - Chancen und Risiken aus ökonomischer Sicht","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:50Z","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"date_created":"2019-02-22T09:40:39Z","author":[{"first_name":"Cengiz","last_name":"Aykanat","full_name":"Aykanat, Cengiz"}]},{"title":"Heterogeneity in Contests, Sources and Implicants","date_updated":"2022-01-06T07:03:50Z","publisher":"Universität Paderborn","author":[{"full_name":"Suvorina, Tatiana","last_name":"Suvorina","first_name":"Tatiana"}],"supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"date_created":"2019-02-22T09:47:28Z","year":"2018","citation":{"chicago":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","ieee":"T. Suvorina, <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","ama":"Suvorina T. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn; 2018.","bibtex":"@book{Suvorina_2018, title={Heterogeneity in Contests, Sources and Implicants}, publisher={Universität Paderborn}, author={Suvorina, Tatiana}, year={2018} }","mla":"Suvorina, Tatiana. <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn, 2018.","short":"T. Suvorina, Heterogeneity in Contests, Sources and Implicants, Universität Paderborn, 2018.","apa":"Suvorina, T. (2018). <i>Heterogeneity in Contests, Sources and Implicants</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"_id":"8075","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"}],"user_id":"477","status":"public","type":"mastersthesis"},{"type":"bachelorsthesis","status":"public","_id":"5967","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"65453","language":[{"iso":"ger"}],"year":"2018","citation":{"ama":"Koch A. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn; 2018.","chicago":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","ieee":"A. Koch, <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","mla":"Koch, Alexander. <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn, 2018.","bibtex":"@book{Koch_2018, title={Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung}, publisher={Universität Paderborn}, author={Koch, Alexander}, year={2018} }","short":"A. Koch, Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung, Universität Paderborn, 2018.","apa":"Koch, A. (2018). <i>Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","date_created":"2018-11-28T12:07:30Z","author":[{"full_name":"Koch, Alexander","last_name":"Koch","first_name":"Alexander"}],"supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"title":"Reduzierung des Energieverlustes im Smart Grid mittels Koalitionsbildung"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"4564","user_id":"477","department":[{"_id":"205"},{"_id":"475"}],"article_type":"original","file_date_updated":"2018-10-31T07:43:31Z","type":"journal_article","status":"public","date_updated":"2022-01-06T07:01:11Z","author":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Sonja","full_name":"Recker, Sonja","last_name":"Recker"}],"volume":27,"doi":"10.1007/s10726-018-9592-8","publication_status":"published","has_accepted_license":"1","jel":["C78"],"citation":{"bibtex":"@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>}, number={6}, journal={Group Decision and Negotiation}, publisher={Springer}, author={Haake, Claus-Jochen and Recker, Sonja}, year={2018}, pages={905–932} }","short":"C.-J. Haake, S. Recker, Group Decision and Negotiation 27 (2018) 905–932.","mla":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>.","apa":"Haake, C.-J., &#38; Recker, S. (2018). The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>, <i>27</i>(6), 905–932. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>","chicago":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i> 27, no. 6 (2018): 905–32. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>.","ieee":"C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information,” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, pp. 905–932, 2018.","ama":"Haake C-J, Recker S. The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>. 2018;27(6):905-932. doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>"},"page":"905-932","intvolume":"        27","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Group Decision and Negotiation","abstract":[{"lang":"eng","text":"  In our model two divisions negotiate over type-dependent contracts to\r\n  determine an intrafirm transfer price for an intermediate product. Since the\r\n  upstream division's (seller's) costs and downstream division's (buyer's)\r\n  revenues are supposed to be private information, we formally consider\r\n  cooperative bargaining problems under incomplete information.  This means\r\n  that the two divisions consider allocations of expected utility generated by\r\n  mechanisms that satisfy (interim) individual rationality, incentive\r\n  compatibility and/or ex post efficiency.  Assuming two possible types for\r\n  buyer and seller each, we first establish that the bargaining problem is\r\n  regular, regardless whether or not incentive and/or efficiency constraints\r\n  are imposed. This allows us to apply the generalized Nash bargaining\r\n  solution to determine fair transfer payments and transfer\r\n  quantities. In particular, the generalized Nash bargaining solution tries to\r\n  balance divisional profits, while incentive constraints are still in\r\n  place. In that sense a fair profit division is generated. Furthermore, by\r\n  means of illustrative examples we derive general properties of this solution\r\n  for the transfer pricing problem and compare the model developed here with\r\n  the models existing in the literature. We demonstrate that there is a\r\n  tradeoff between ex post efficiency and fairness.\r\n"}],"file":[{"file_size":636521,"access_level":"closed","file_name":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations Under Incomplete Information.pdf","file_id":"5107","date_updated":"2018-10-31T07:43:31Z","creator":"stela","date_created":"2018-10-31T07:43:31Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publisher":"Springer","date_created":"2018-10-02T07:15:26Z","title":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information","quality_controlled":"1","issue":"6","year":"2018"},{"doi":"10.17619/UNIPB/1-358","title":"Essays on Competition in Health Care Markets","author":[{"last_name":"Wu","id":"47829","full_name":"Wu, Xing","first_name":"Xing"}],"supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2018-10-23T08:13:11Z","date_updated":"2022-01-06T07:01:23Z","publisher":"Universität Paderborn","citation":{"mla":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>.","bibtex":"@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>}, publisher={Universität Paderborn}, author={Wu, Xing}, year={2018} }","short":"X. Wu, Essays on Competition in Health Care Markets, Universität Paderborn, 2018.","apa":"Wu, X. (2018). <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>","chicago":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>.","ieee":"X. Wu, <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018.","ama":"Wu X. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>"},"year":"2018","has_accepted_license":"1","file_date_updated":"2018-11-06T14:23:51Z","language":[{"iso":"eng"}],"ddc":["330"],"department":[{"_id":"280"}],"user_id":"477","_id":"4797","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","file":[{"file_name":"Xing Wu_Essays on Competition in Health Care Markets.pdf","access_level":"closed","file_id":"5381","file_size":893726,"creator":"xwu","date_created":"2018-11-06T14:23:51Z","date_updated":"2018-11-06T14:23:51Z","relation":"main_file","content_type":"application/pdf"}],"type":"dissertation"},{"year":"2018","citation":{"ieee":"Y. Akcay, <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn, 2018.","chicago":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","ama":"Akcay Y. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn; 2018.","apa":"Akcay, Y. (2018). <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn.","short":"Y. Akcay, Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb, Universität Paderborn, 2018.","mla":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","bibtex":"@book{Akcay_2018, title={Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}, publisher={Universität Paderborn}, author={Akcay, Yasemen}, year={2018} }"},"title":"Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","date_created":"2018-10-24T06:41:13Z","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"author":[{"first_name":"Yasemen","full_name":"Akcay, Yasemen","last_name":"Akcay"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"4802","user_id":"477","department":[{"_id":"280"}]},{"citation":{"ama":"Görken E. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn; 2018.","chicago":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018.","ieee":"E. Görken, <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn, 2018.","apa":"Görken, E. (2018). <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn.","short":"E. Görken, Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern, Universität Paderborn, 2018.","bibtex":"@book{Görken_2018, title={Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern}, publisher={Universität Paderborn}, author={Görken, Emre}, year={2018} }","mla":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018."},"year":"2018","author":[{"last_name":"Görken","full_name":"Görken, Emre","first_name":"Emre"}],"supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"date_created":"2018-10-24T07:05:18Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","title":"Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern","type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"4804","language":[{"iso":"eng"}]}]