[{"_id":"1073","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:50:50Z","publisher":"Universität Paderborn","date_created":"2017-12-19T09:59:32Z","author":[{"first_name":"Simon","last_name":"Nachtigall","full_name":"Nachtigall, Simon"}],"supervisor":[{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"title":"Sortieren dynamischer Daten","year":"2017","citation":{"apa":"Nachtigall, S. (2017). <i>Sortieren dynamischer Daten</i>. Universität Paderborn.","mla":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }","ieee":"S. Nachtigall, <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","chicago":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","ama":"Nachtigall S. <i>Sortieren dynamischer Daten</i>. Universität Paderborn; 2017."}},{"citation":{"bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }","mla":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017.","apa":"Pukrop, S. (2017). <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn.","chicago":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","ieee":"S. Pukrop, <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","ama":"Pukrop S. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn; 2017."},"year":"2017","author":[{"first_name":"Simon","full_name":"Pukrop, Simon","last_name":"Pukrop"}],"date_created":"2017-12-19T10:00:25Z","supervisor":[{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Robuste Optimierung in Congestion Games","type":"bachelorsthesis","status":"public","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1074","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}]},{"user_id":"42447","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1075","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Laudage, Felix","last_name":"Laudage","first_name":"Felix"}],"date_created":"2017-12-19T10:01:18Z","supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"date_updated":"2022-01-06T06:50:50Z","publisher":"Universität Paderborn","title":"Open Innovation - Eine ökonimische Perspektive","citation":{"bibtex":"@book{Laudage_2017, title={Open Innovation - Eine ökonimische Perspektive}, publisher={Universität Paderborn}, author={Laudage, Felix}, year={2017} }","mla":"Laudage, Felix. <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn, 2017.","short":"F. Laudage, Open Innovation - Eine ökonimische Perspektive, Universität Paderborn, 2017.","apa":"Laudage, F. (2017). <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn.","ieee":"F. Laudage, <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn, 2017.","chicago":"Laudage, Felix. <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn, 2017.","ama":"Laudage F. <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn; 2017."},"year":"2017"},{"citation":{"chicago":"Goebel, Marion. <i>Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay</i>. Universität Paderborn, 2017.","ieee":"M. Goebel, <i>Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay</i>. Universität Paderborn, 2017.","ama":"Goebel M. <i>Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay</i>. Universität Paderborn; 2017.","mla":"Goebel, Marion. <i>Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay</i>. Universität Paderborn, 2017.","bibtex":"@book{Goebel_2017, title={Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay}, publisher={Universität Paderborn}, author={Goebel, Marion}, year={2017} }","short":"M. Goebel, Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay, Universität Paderborn, 2017.","apa":"Goebel, M. (2017). <i>Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay</i>. Universität Paderborn."},"year":"2017","title":"Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay","date_created":"2017-12-19T10:03:28Z","author":[{"first_name":"Marion","full_name":"Goebel, Marion","last_name":"Goebel"}],"supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"42447","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1076"},{"user_id":"42447","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1077","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"author":[{"first_name":"Marleen","full_name":"Wagemeyer, Marleen","last_name":"Wagemeyer"}],"date_created":"2017-12-19T10:04:37Z","date_updated":"2022-01-06T06:50:50Z","publisher":"Universität Paderborn","title":"Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet","citation":{"mla":"Wagemeyer, Marleen. <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn, 2017.","bibtex":"@book{Wagemeyer_2017, title={Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet}, publisher={Universität Paderborn}, author={Wagemeyer, Marleen}, year={2017} }","short":"M. Wagemeyer, Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet, Universität Paderborn, 2017.","apa":"Wagemeyer, M. (2017). <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn.","ama":"Wagemeyer M. <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn; 2017.","ieee":"M. Wagemeyer, <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn, 2017.","chicago":"Wagemeyer, Marleen. <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn, 2017."},"year":"2017"},{"year":"2017","citation":{"mla":"Shabani, Albana. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","bibtex":"@book{Shabani_2017, title={Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Shabani, Albana}, year={2017} }","short":"A. Shabani, Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse, Universität Paderborn, 2017.","apa":"Shabani, A. (2017). <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","ieee":"A. Shabani, <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","chicago":"Shabani, Albana. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","ama":"Shabani A. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn; 2017."},"title":"Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","author":[{"first_name":"Albana","full_name":"Shabani, Albana","last_name":"Shabani"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"date_created":"2017-12-19T10:05:34Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"1078","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"42447"},{"user_id":"42447","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1079","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_created":"2017-12-19T10:06:36Z","author":[{"full_name":"Hamacher, Dustin Stefan","last_name":"Hamacher","first_name":"Dustin Stefan"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Das Zusammenschlussvorhaben von Edeka und Kaiser's Tengelmann - eine ökonomische Analyse","citation":{"bibtex":"@book{Hamacher_2017, title={Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Hamacher, Dustin Stefan}, year={2017} }","mla":"Hamacher, Dustin Stefan. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","short":"D.S. Hamacher, Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse, Universität Paderborn, 2017.","apa":"Hamacher, D. S. (2017). <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn.","ama":"Hamacher DS. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn; 2017.","chicago":"Hamacher, Dustin Stefan. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","ieee":"D. S. Hamacher, <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017."},"year":"2017"},{"year":"2017","citation":{"short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017.","bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","mla":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","apa":"Bürmann, J. (2017). <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn.","ieee":"J. Bürmann, <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","chicago":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","ama":"Bürmann J. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn; 2017."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-12-19T10:07:35Z","author":[{"first_name":"Jan","full_name":"Bürmann, Jan","last_name":"Bürmann"}],"title":"Complexity of Signalling in Routing Games under Uncertainty","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1080","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}]},{"type":"mastersthesis","status":"public","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1081","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"bibtex":"@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","mla":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","apa":"Vijayalakshmi, V. R. (2017). <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn.","ama":"Vijayalakshmi VR. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn; 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","ieee":"V. R. Vijayalakshmi, <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017."},"year":"2017","date_created":"2017-12-19T10:08:44Z","author":[{"last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran"}],"supervisor":[{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"date_updated":"2022-01-06T06:50:51Z","publisher":"Universität Paderborn","title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation"},{"oa":"1","date_updated":"2022-01-06T06:50:51Z","author":[{"last_name":"Hoyer","full_name":"Hoyer, Britta","id":"42447","first_name":"Britta"},{"full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun","first_name":"Nadja"}],"volume":110,"main_file_link":[{"url":"http://groups.uni-paderborn.de/wp-wiwi/RePEc/pdf/ciepap/WP110.pdf","open_access":"1"}],"has_accepted_license":"1","citation":{"ama":"Hoyer B, Stroh-Maraun N. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol 110. CIE Working Paper Series, Paderborn University; 2017.","ieee":"B. Hoyer and N. Stroh-Maraun, <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>, vol. 110. CIE Working Paper Series, Paderborn University, 2017.","chicago":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2017.","apa":"Hoyer, B., &#38; Stroh-Maraun, N. (2017). <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i> (Vol. 110). CIE Working Paper Series, Paderborn University.","mla":"Hoyer, Britta, and Nadja Stroh-Maraun. <i>Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse</i>. Vol. 110, CIE Working Paper Series, Paderborn University, 2017.","short":"B. Hoyer, N. Stroh-Maraun, Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse, CIE Working Paper Series, Paderborn University, 2017.","bibtex":"@book{Hoyer_Stroh-Maraun_2017, series={Working Papers CIE}, title={Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}, volume={110}, publisher={CIE Working Paper Series, Paderborn University}, author={Hoyer, Britta and Stroh-Maraun, Nadja}, year={2017}, collection={Working Papers CIE} }"},"intvolume":"       110","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1083","series_title":"Working Papers CIE","user_id":"42447","department":[{"_id":"280"},{"_id":"205"},{"_id":"475"}],"file_date_updated":"2018-08-15T07:33:12Z","type":"working_paper","status":"public","publisher":"CIE Working Paper Series, Paderborn University","date_created":"2017-12-20T16:21:51Z","title":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse","year":"2017","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In actual school choice applications the theoretical underpinnings of the Boston School Choice Mechanism (BM) (complete information and rationality of the agents) are often not given. We analyze the actual behavior of agents in such a matching mechanism, using data from the matching mechanism currently used in a clearinghouse at a faculty of Business Administration and Economics at a German university, where a variant of the BM is used, and supplement this data with data generated in a survey among students who participated in the clearinghouse. We find that under the current mechanism over 70% of students act strategically. Controlling for students' limited information, we find that they do act rationally in their decision to act strategically. While students thus seem to react to the incentives to act strategically under the BM, they do not seem to be able to use this to their own advantage. However, those students acting in line with their beliefs manage a significantly better personal outcome than those who do not. We also run simulations by using a variant of the deferred acceptance algorithm, adapted to our situation, to show that the use of a different algorithm may be to the students' advantage."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-08-15T07:33:12Z","creator":"nmaraun","date_updated":"2018-08-15T07:33:12Z","file_name":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.pdf","file_id":"3911","access_level":"closed","file_size":346752}]},{"type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5954","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"year":"2017","citation":{"chicago":"N, N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural Approach</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach</i>. Universität Paderborn, 2017.","ama":"N N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural Approach</i>. Universität Paderborn; 2017.","apa":"N, N. (2017). <i>Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach</i>. Universität Paderborn.","mla":"N, N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural Approach</i>. Universität Paderborn, 2017.","short":"N. N, Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural Approach, Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach}, publisher={Universität Paderborn}, author={N, N}, year={2017} }"},"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:16:20Z","author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T11:39:28Z","title":"Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach"},{"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"author":[{"last_name":"N","full_name":"N, N","first_name":"N"}],"date_created":"2018-11-28T11:46:21Z","date_updated":"2022-11-30T14:16:55Z","publisher":"Universität Paderborn","title":"Game Theory solutions for the Transshipment Problem in Logistic Networks","citation":{"ama":"N N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Game Theory solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Game Theory solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn.","short":"N. N, Game Theory Solutions for the Transshipment Problem in Logistic Networks, Universität Paderborn, 2017.","mla":"N, N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Game Theory solutions for the Transshipment Problem in Logistic Networks}, publisher={Universität Paderborn}, author={N, N}, year={2017} }"},"year":"2017","user_id":"477","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5957","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"date_updated":"2022-11-30T14:16:36Z","publisher":"Universität Paderborn","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T11:41:05Z","title":"Bitcoin, Ethereum & Co. Was zeichnet eine gute Kryptowährung aus?","year":"2017","citation":{"chicago":"N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> Universität Paderborn, 2017.","ieee":"N. N, <i>Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute Kryptowährung aus?</i> Universität Paderborn, 2017.","ama":"N N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> Universität Paderborn; 2017.","apa":"N, N. (2017). <i>Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute Kryptowährung aus?</i> Universität Paderborn.","mla":"N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> Universität Paderborn, 2017.","short":"N. N, Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?, Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Bitcoin, Ethereum &#38; Co. Was zeichnet eine gute Kryptowährung aus?}, publisher={Universität Paderborn}, author={N, N}, year={2017} }"},"_id":"5955","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"205"}],"user_id":"477","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"205"}],"user_id":"477","_id":"5948","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"citation":{"apa":"N, N. (2017). <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","short":"N. N, Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens, Universität Paderborn, 2017.","mla":"N, N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017.","ama":"N N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017."},"year":"2017","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T11:25:19Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:22:04Z","title":"Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens"},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5949","language":[{"iso":"eng"}],"citation":{"ama":"N N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn; 2017.","ieee":"N. N, <i>Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","short":"N. N, Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse, Universität Paderborn, 2017.","mla":"N, N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2017."},"year":"2017","date_created":"2018-11-28T11:27:27Z","supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"author":[{"first_name":"N","full_name":"N, N","last_name":"N"}],"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:21:49Z","title":"Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse"},{"department":[{"_id":"205"}],"user_id":"477","_id":"5943","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-11-28T10:45:18Z","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":"2022-11-30T14:21:35Z","title":"Dynamische multikriterielle Lohnverhandlungen","citation":{"apa":"N, N. (2017). <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn.","short":"N. N, Dynamische Multikriterielle Lohnverhandlungen, Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Dynamische multikriterielle Lohnverhandlungen}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","ama":"N N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn; 2017.","ieee":"N. N, <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017."},"year":"2017"},{"year":"2017","citation":{"ama":"N N. <i>Kooperative Standortspiele</i>. Universität Paderborn; 2017.","apa":"N, N. (2017). <i>Kooperative Standortspiele</i>. Universität Paderborn.","mla":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Kooperative Standortspiele}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","short":"N. N, Kooperative Standortspiele, Universität Paderborn, 2017.","ieee":"N. N, <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017."},"publisher":"Universität Paderborn","date_updated":"2022-11-30T14:21:18Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"date_created":"2018-11-28T10:43:55Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"title":"Kooperative Standortspiele","type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5942","user_id":"477","department":[{"_id":"205"}],"language":[{"iso":"eng"}]},{"citation":{"ieee":"N. N, <i>Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn, 2017.","ama":"N N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn; 2017.","apa":"N, N. (2017). <i>Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn, 2017.","short":"N. N, Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung, Universität Paderborn, 2017."},"year":"2017","title":"Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung","supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"author":[{"last_name":"N","full_name":"N, N","first_name":"N"}],"date_created":"2018-11-28T10:47:20Z","date_updated":"2022-11-30T14:22:56Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5944"},{"year":"2017","citation":{"ama":"N N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -</i>. Universität Paderborn.","mla":"N, N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn, 2017.","short":"N. N, Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -, Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -}, publisher={Universität Paderborn}, author={N, N}, year={2017} }"},"title":"Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -","publisher":"Universität Paderborn","date_updated":"2022-11-30T14:22:18Z","author":[{"last_name":"N","full_name":"N, N","first_name":"N"}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"date_created":"2018-11-28T11:18:01Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"5947","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"477"},{"citation":{"short":"N. N, Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments, Universität Paderborn, 2017.","bibtex":"@book{N_2017, title={Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments</i>. Universität Paderborn.","ama":"N N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments</i>. Universität Paderborn, 2017."},"year":"2017","title":"Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments","supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"date_created":"2018-11-28T10:49:30Z","publisher":"Universität Paderborn","date_updated":"2022-11-30T14:22:33Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"5945","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}]}]