[{"author":[{"full_name":"Fortmeier, Julia","last_name":"Fortmeier","first_name":"Julia"}],"year":"2019","title":"Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse","status":"public","date_updated":"2023-01-23T09:05:55Z","language":[{"iso":"ger"}],"_id":"38042","user_id":"37953","supervisor":[{"full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp","id":"37339"}],"citation":{"apa":"Fortmeier, J. (2019). <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>.","ieee":"J. Fortmeier, <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>. 2019.","chicago":"Fortmeier, Julia. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>, 2019.","short":"J. Fortmeier, Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse, 2019.","mla":"Fortmeier, Julia. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>. 2019.","ama":"Fortmeier J. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>.; 2019.","bibtex":"@book{Fortmeier_2019, title={Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse}, author={Fortmeier, Julia}, year={2019} }"},"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"}],"date_created":"2023-01-23T08:55:55Z","department":[{"_id":"280"}],"type":"bachelorsthesis"},{"date_created":"2023-01-23T09:22:37Z","type":"mastersthesis","department":[{"_id":"280"}],"citation":{"chicago":"Hagedorn, Carolin. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>, 2019.","short":"C. Hagedorn, The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers, 2019.","apa":"Hagedorn, C. (2019). <i>The intersection of privacy and competition law - Lessons from data-driven mergers</i>.","ieee":"C. Hagedorn, <i>The intersection of privacy and competition law - Lessons from data-driven mergers</i>. 2019.","ama":"Hagedorn C. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>.; 2019.","bibtex":"@book{Hagedorn_2019, title={The intersection of privacy and competition law - Lessons from data-driven mergers}, author={Hagedorn, Carolin}, year={2019} }","mla":"Hagedorn, Carolin. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>. 2019."},"supervisor":[{"id":"37339","first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard"}],"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":"38045","language":[{"iso":"eng"}],"user_id":"37953","title":"The intersection of privacy and competition law - Lessons from data-driven mergers","status":"public","year":"2019","author":[{"last_name":"Hagedorn","first_name":"Carolin","full_name":"Hagedorn, Carolin"}],"date_updated":"2023-01-23T09:24:30Z"},{"user_id":"37953","_id":"38097","language":[{"iso":"ger"}],"date_updated":"2023-01-23T11:39:50Z","author":[{"full_name":"Ayyildiz, Berfin","first_name":"Berfin","last_name":"Ayyildiz"}],"title":"Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse","status":"public","year":"2019","department":[{"_id":"280"}],"type":"bachelorsthesis","date_created":"2023-01-23T11:39:35Z","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"}],"citation":{"ama":"Ayyildiz B. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>.; 2019.","bibtex":"@book{Ayyildiz_2019, title={Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse}, author={Ayyildiz, Berfin}, year={2019} }","mla":"Ayyildiz, Berfin. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>. 2019.","chicago":"Ayyildiz, Berfin. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>, 2019.","short":"B. Ayyildiz, Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse, 2019.","apa":"Ayyildiz, B. (2019). <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>.","ieee":"B. Ayyildiz, <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>. 2019."},"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}]},{"_id":"38093","language":[{"iso":"eng"}],"user_id":"37953","author":[{"full_name":"Shelepova, Ekaterina","first_name":"Ekaterina","last_name":"Shelepova"}],"year":"2019","title":"Merger Analysis in Data-Driven Markets - An Economic Policy Perspective","status":"public","date_updated":"2023-01-23T11:34:15Z","date_created":"2023-01-23T11:34:00Z","department":[{"_id":"280"}],"type":"mastersthesis","supervisor":[{"last_name":"Hehenkamp","first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339"}],"citation":{"chicago":"Shelepova, Ekaterina. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>, 2019.","short":"E. Shelepova, Merger Analysis in Data-Driven Markets - An Economic Policy Perspective, 2019.","apa":"Shelepova, E. (2019). <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>.","ieee":"E. Shelepova, <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>. 2019.","ama":"Shelepova E. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>.; 2019.","bibtex":"@book{Shelepova_2019, title={Merger Analysis in Data-Driven Markets - An Economic Policy Perspective}, author={Shelepova, Ekaterina}, year={2019} }","mla":"Shelepova, Ekaterina. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>. 2019."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}]},{"year":"2019","title":"Marktmacht in digitalen Märkten","status":"public","author":[{"full_name":"Shanmugaratnam, Suganya","last_name":"Shanmugaratnam","first_name":"Suganya"}],"date_updated":"2023-01-23T11:36:29Z","language":[{"iso":"ger"}],"_id":"38096","user_id":"37953","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp"}],"citation":{"apa":"Shanmugaratnam, S. (2019). <i>Marktmacht in digitalen Märkten</i>.","ieee":"S. Shanmugaratnam, <i>Marktmacht in digitalen Märkten</i>. 2019.","short":"S. Shanmugaratnam, Marktmacht in digitalen Märkten, 2019.","chicago":"Shanmugaratnam, Suganya. <i>Marktmacht in digitalen Märkten</i>, 2019.","mla":"Shanmugaratnam, Suganya. <i>Marktmacht in digitalen Märkten</i>. 2019.","ama":"Shanmugaratnam S. <i>Marktmacht in digitalen Märkten</i>.; 2019.","bibtex":"@book{Shanmugaratnam_2019, title={Marktmacht in digitalen Märkten}, author={Shanmugaratnam, Suganya}, year={2019} }"},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-01-23T11:36:24Z","type":"mastersthesis","department":[{"_id":"280"}]},{"author":[{"first_name":"Ahmed","last_name":"Faizan","full_name":"Faizan, Ahmed"}],"title":"The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities","year":"2019","status":"public","date_updated":"2023-01-23T11:48:33Z","_id":"38099","language":[{"iso":"eng"}],"user_id":"37953","citation":{"apa":"Faizan, A. (2019). <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>.","ieee":"A. Faizan, <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>. 2019.","short":"A. Faizan, The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities, 2019.","chicago":"Faizan, Ahmed. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>, 2019.","mla":"Faizan, Ahmed. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>. 2019.","ama":"Faizan A. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>.; 2019.","bibtex":"@book{Faizan_2019, title={The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities}, author={Faizan, Ahmed}, year={2019} }"},"supervisor":[{"full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp","id":"37339"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-01-23T11:43:52Z","department":[{"_id":"280"}],"type":"mastersthesis"},{"status":"public","user_id":"14931","volume":30,"page":"631-652","_id":"35756","publisher":"Emerald","citation":{"chicago":"Khan, Gohar, Manar Mohaisen, and Matthias Trier. “The Network ROI.” <i>Internet Research</i> 30, no. 2 (2019): 631–52. <a href=\"https://doi.org/10.1108/intr-07-2018-0346\">https://doi.org/10.1108/intr-07-2018-0346</a>.","short":"G. Khan, M. Mohaisen, M. Trier, Internet Research 30 (2019) 631–652.","ieee":"G. Khan, M. Mohaisen, and M. Trier, “The network ROI,” <i>Internet Research</i>, vol. 30, no. 2, pp. 631–652, 2019, doi: <a href=\"https://doi.org/10.1108/intr-07-2018-0346\">10.1108/intr-07-2018-0346</a>.","apa":"Khan, G., Mohaisen, M., &#38; Trier, M. (2019). The network ROI. <i>Internet Research</i>, <i>30</i>(2), 631–652. <a href=\"https://doi.org/10.1108/intr-07-2018-0346\">https://doi.org/10.1108/intr-07-2018-0346</a>","bibtex":"@article{Khan_Mohaisen_Trier_2019, title={The network ROI}, volume={30}, DOI={<a href=\"https://doi.org/10.1108/intr-07-2018-0346\">10.1108/intr-07-2018-0346</a>}, number={2}, journal={Internet Research}, publisher={Emerald}, author={Khan, Gohar and Mohaisen, Manar and Trier, Matthias}, year={2019}, pages={631–652} }","ama":"Khan G, Mohaisen M, Trier M. The network ROI. <i>Internet Research</i>. 2019;30(2):631-652. doi:<a href=\"https://doi.org/10.1108/intr-07-2018-0346\">10.1108/intr-07-2018-0346</a>","mla":"Khan, Gohar, et al. “The Network ROI.” <i>Internet Research</i>, vol. 30, no. 2, Emerald, 2019, pp. 631–52, doi:<a href=\"https://doi.org/10.1108/intr-07-2018-0346\">10.1108/intr-07-2018-0346</a>."},"publication_status":"published","date_updated":"2023-01-29T23:04:53Z","intvolume":"        30","title":"The network ROI","year":"2019","publication_identifier":{"issn":["1066-2243"]},"author":[{"last_name":"Khan","first_name":"Gohar","full_name":"Khan, Gohar"},{"full_name":"Mohaisen, Manar","last_name":"Mohaisen","first_name":"Manar"},{"first_name":"Matthias","last_name":"Trier","full_name":"Trier, Matthias","id":"72744"}],"doi":"10.1108/intr-07-2018-0346","alternative_title":["Concept, metrics, and measurement of social media returns (a Facebook experiment)"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:sec>\r\n<jats:title content-type=\"abstract-subheading\">Purpose</jats:title>\r\n<jats:p>Leveraging social action theory, social network theory and the notion of network externality, the purpose of this paper is to model two different return on investment (ROI) measures: the networked ROI which captures the network effect originating from a social media investment, and the discrete ROI which focuses social media discrete returns from individual users.</jats:p>\r\n</jats:sec>\r\n<jats:sec>\r\n<jats:title content-type=\"abstract-subheading\">Design/methodology/approach</jats:title>\r\n<jats:p>A field experiment was set up over a period of three months to test the effects of two variants of an advertisement campaign (a social vs a discrete ad) on the modeled networked and discrete ROIs.</jats:p>\r\n</jats:sec>\r\n<jats:sec>\r\n<jats:title content-type=\"abstract-subheading\">Findings</jats:title>\r\n<jats:p>The authors find that emphasizing discrete user actions leads to lower network gains, but higher monetary returns while the social action emphasis produces higher network gains, but lower monetary returns. The study further suggests that social action focus is preferable for brand promotion and engagement, whereas the discrete action focus is suitable for boosting sales and website traffic.</jats:p>\r\n</jats:sec>\r\n<jats:sec>\r\n<jats:title content-type=\"abstract-subheading\">Practical implications</jats:title>\r\n<jats:p>Several potential implications for social media researchers and marketers are also discussed.</jats:p>\r\n</jats:sec>\r\n<jats:sec>\r\n<jats:title content-type=\"abstract-subheading\">Originality/value</jats:title>\r\n<jats:p>The authors for the first time showed that that the social media returns are derived not only from individual actions taken by the user (e.g. likes and shares) but also from users’ social interdependencies and the additional exposure that results from network effects.</jats:p>\r\n</jats:sec>"}],"issue":"2","publication":"Internet Research","type":"journal_article","keyword":["Economics and Econometrics","Sociology and Political Science","Communication"],"department":[{"_id":"198"}],"date_created":"2023-01-10T10:25:13Z"},{"date_updated":"2023-05-23T12:46:23Z","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"year":"2019","title":"Intermediaries in Networks","status":"public","user_id":"477","_id":"42296","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"citation":{"bibtex":"@book{N._2019, title={Intermediaries in Networks}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Intermediaries in Networks</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","short":"N. N., Intermediaries in Networks, Universität Paderborn, 2019.","chicago":"N., N. <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Intermediaries in Networks</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Intermediaries in Networks</i>. Universität Paderborn."},"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","date_created":"2023-02-22T11:08:43Z"},{"type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T10:59:24Z","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"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"citation":{"apa":"N., N. (2019). <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn.","ieee":"N. N., <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","short":"N. N., Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode, Universität Paderborn, 2019.","chicago":"N., N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","mla":"N., N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }"},"user_id":"477","_id":"42286","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2023-05-23T12:47:33Z","title":"Logrolling-Prozess: Theorie und formale Darstellung einer verhandlungsunterstützenden Methode","status":"public","year":"2019","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}]},{"date_updated":"2023-05-23T12:47:20Z","status":"public","title":"Stability in two-sided matchings with asymmetric information","year":"2019","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"user_id":"477","_id":"42290","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"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"}],"citation":{"bibtex":"@book{N._2019, title={Stability in two-sided matchings with asymmetric information}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn, 2019.","chicago":"N., N. <i>Stability in Two-Sided Matchings with Asymmetric Information</i>. Universität Paderborn, 2019.","short":"N. N., Stability in Two-Sided Matchings with Asymmetric Information, Universität Paderborn, 2019.","ieee":"N. N., <i>Stability in two-sided matchings with asymmetric information</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Stability in two-sided matchings with asymmetric information</i>. Universität Paderborn."},"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"type":"mastersthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T11:02:24Z"},{"year":"2019","status":"public","title":"Sincere and Sophisticated Players in Matching Markets","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"date_updated":"2023-05-23T12:47:13Z","_id":"42289","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"citation":{"mla":"N., N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Sincere and Sophisticated Players in Matching Markets}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn; 2019.","ieee":"N. N., <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn.","chicago":"N., N. <i>Sincere and Sophisticated Players in Matching Markets</i>. Universität Paderborn, 2019.","short":"N. N., Sincere and Sophisticated Players in Matching Markets, Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"date_created":"2023-02-22T11:01:30Z","type":"mastersthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}]},{"date_updated":"2023-05-23T12:47:05Z","title":"Mechanismen zur Informationsgewinnung in Verhandlungen","status":"public","year":"2019","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"user_id":"477","language":[{"iso":"ger"}],"_id":"42291","publisher":"Universität Paderborn","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"}],"citation":{"bibtex":"@book{N._2019, title={Mechanismen zur Informationsgewinnung in Verhandlungen}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","short":"N. N., Mechanismen zur Informationsgewinnung in Verhandlungen, Universität Paderborn, 2019.","chicago":"N., N. <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Mechanismen zur Informationsgewinnung in Verhandlungen</i>. Universität Paderborn."},"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"}],"type":"mastersthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-22T11:03:32Z"},{"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"}],"citation":{"mla":"N., N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Die faire Verteilung unteilbarer Güter}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn; 2019.","ieee":"N. N., <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn.","short":"N. N., Die faire Verteilung unteilbarer Güter, Universität Paderborn, 2019.","chicago":"N., N. <i>Die faire Verteilung unteilbarer Güter</i>. Universität Paderborn, 2019."},"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis","date_created":"2023-02-22T11:00:16Z","date_updated":"2023-05-23T12:47:26Z","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"status":"public","year":"2019","title":"Die faire Verteilung unteilbarer Güter","user_id":"477","publisher":"Universität Paderborn","_id":"42288","language":[{"iso":"ger"}]},{"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"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"citation":{"mla":"N., N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Axiomatisierungen des Banzhaf-Wertes}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","apa":"N., N. (2019). <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn.","ieee":"N. N., <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019.","short":"N. N., Axiomatisierungen des Banzhaf-Wertes, Universität Paderborn, 2019.","chicago":"N., N. <i>Axiomatisierungen des Banzhaf-Wertes</i>. Universität Paderborn, 2019."},"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"bachelorsthesis","date_created":"2023-02-22T11:07:53Z","date_updated":"2023-05-23T12:46:37Z","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"title":"Axiomatisierungen des Banzhaf-Wertes","year":"2019","status":"public","user_id":"477","language":[{"iso":"ger"}],"_id":"42295","publisher":"Universität Paderborn"},{"author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"year":"2019","status":"public","title":"Compatibilities in Matching Mechanisms","date_updated":"2023-05-23T12:46:51Z","publisher":"Universität Paderborn","_id":"42293","language":[{"iso":"eng"}],"user_id":"477","citation":{"ama":"N. N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Compatibilities in Matching Mechanisms}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019.","short":"N. N., Compatibilities in Matching Mechanisms, Universität Paderborn, 2019.","chicago":"N., N. <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn.","ieee":"N. N., <i>Compatibilities in Matching Mechanisms</i>. Universität Paderborn, 2019."},"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"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"}],"date_created":"2023-02-22T11:05:59Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis"},{"year":"2019","title":"Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit","status":"public","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"date_updated":"2023-05-23T12:47:46Z","_id":"42284","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"477","supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"citation":{"ama":"N. N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn; 2019.","bibtex":"@book{N._2019, title={Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","mla":"N., N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019.","short":"N. N., Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit, Universität Paderborn, 2019.","chicago":"N., N. <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn.","ieee":"N. N., <i>Faire Aufteilung von unteilbaren Gütern: Untersuchung von Algorithmen auf Effizienz und Neidfreiheit</i>. Universität Paderborn, 2019."},"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"}],"date_created":"2023-02-22T10:56:40Z","type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}]},{"user_id":"477","language":[{"iso":"ger"}],"_id":"42280","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:48:04Z","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"year":"2019","title":"Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem","status":"public","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","date_created":"2023-02-22T10:52:19Z","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"}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"citation":{"chicago":"N., N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019.","short":"N. N., Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem, Universität Paderborn, 2019.","ieee":"N. N., <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn.","bibtex":"@book{N._2019, title={Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","ama":"N. N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn; 2019.","mla":"N., N. <i>Anwendung und Vergleich von Verhandlungslösungen auf das Netzwerk-Design-Problem</i>. Universität Paderborn, 2019."}},{"date_created":"2023-02-22T10:58:10Z","type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"citation":{"chicago":"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.","apa":"N., N. (2019). <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn.","ieee":"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.","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} }","mla":"N., N. <i>Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse</i>. Universität Paderborn, 2019."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42285","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"477","year":"2019","title":"Verhandlungen mit Intermediären in IT-Märkten: eine spieltheoretische Analyse","status":"public","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"date_updated":"2023-05-23T12:47:40Z"},{"publisher":"Universität Paderborn","_id":"42281","language":[{"iso":"eng"}],"user_id":"477","author":[{"last_name":"N.","first_name":"N.","full_name":"N., N."}],"status":"public","title":"A bargaining model for relative profit and market share delegation contracts","year":"2019","date_updated":"2023-05-23T12:47:58Z","date_created":"2023-02-22T10:53:58Z","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"type":"mastersthesis","citation":{"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.","mla":"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.","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.","apa":"N., N. (2019). <i>A bargaining model for relative profit and market share delegation contracts</i>. Universität Paderborn."},"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}]},{"type":"bachelorsthesis","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"date_created":"2023-02-09T09:23:13Z","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"}],"citation":{"ieee":"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.","short":"N. N., Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden, Universität Paderborn, 2019.","mla":"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} }","ama":"N. N. <i>Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden</i>. Universität Paderborn; 2019."},"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"user_id":"477","language":[{"iso":"ger"}],"_id":"41926","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:48:17Z","status":"public","year":"2019","title":"Wettbewerb in Märkten für Dienstleitungen mit uninformierten Kunden","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}]}]