[{"title":"Sortieren dynamischer Daten","status":"public","year":"2017","author":[{"last_name":"Nachtigall","first_name":"Simon","full_name":"Nachtigall, Simon"}],"date_updated":"2022-01-06T06:50:50Z","language":[{"iso":"ger"}],"_id":"1073","publisher":"Universität Paderborn","user_id":"14052","supervisor":[{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"citation":{"short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","chicago":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","ieee":"S. Nachtigall, <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","apa":"Nachtigall, S. (2017). <i>Sortieren dynamischer Daten</i>. Universität Paderborn.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }","ama":"Nachtigall S. <i>Sortieren dynamischer Daten</i>. Universität Paderborn; 2017.","mla":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2017-12-19T09:59:32Z","type":"bachelorsthesis","department":[{"_id":"63"},{"_id":"541"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}],"citation":{"ama":"Pukrop S. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn; 2017.","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.","chicago":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","apa":"Pukrop, S. (2017). <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn.","ieee":"S. Pukrop, <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017."},"department":[{"_id":"63"},{"_id":"541"}],"type":"bachelorsthesis","date_created":"2017-12-19T10:00:25Z","date_updated":"2022-01-06T06:50:50Z","author":[{"full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"}],"title":"Robuste Optimierung in Congestion Games","status":"public","year":"2017","user_id":"14052","_id":"1074","language":[{"iso":"ger"}],"publisher":"Universität Paderborn"},{"supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp"}],"citation":{"ama":"Laudage F. <i>Open Innovation - Eine ökonimische Perspektive</i>. Universität Paderborn; 2017.","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.","chicago":"Laudage, Felix. <i>Open Innovation - Eine ökonimische Perspektive</i>. 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."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2017-12-19T10:01:18Z","type":"bachelorsthesis","department":[{"_id":"280"}],"title":"Open Innovation - Eine ökonimische Perspektive","status":"public","year":"2017","author":[{"first_name":"Felix","last_name":"Laudage","full_name":"Laudage, Felix"}],"date_updated":"2022-01-06T06:50:50Z","_id":"1075","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"42447"},{"department":[{"_id":"280"}],"type":"bachelorsthesis","date_created":"2017-12-19T10:03:28Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"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} }","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.","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.","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.","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.","short":"M. Goebel, Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay, Universität Paderborn, 2017."},"supervisor":[{"full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp","id":"37339"}],"user_id":"42447","_id":"1076","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T06:50:50Z","author":[{"first_name":"Marion","last_name":"Goebel","full_name":"Goebel, Marion"}],"status":"public","title":"Marktmacht in zweiseitigen Online-Märkten - Probleme der Bestimmung einer marktbeherrschenden Stellung am Beispiel von eBay","year":"2017"},{"supervisor":[{"last_name":"Hehenkamp","first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339"}],"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} }","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.","apa":"Wagemeyer, M. (2017). <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn.","chicago":"Wagemeyer, Marleen. <i>Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet</i>. Universität Paderborn, 2017.","short":"M. Wagemeyer, Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet, Universität Paderborn, 2017."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2017-12-19T10:04:37Z","department":[{"_id":"280"}],"type":"bachelorsthesis","author":[{"full_name":"Wagemeyer, Marleen","first_name":"Marleen","last_name":"Wagemeyer"}],"year":"2017","title":"Marktabgrenzung in der Internetökonomie - Ein Fallbeispiel zum Fusionsantrag von Immowelt und Immonet","status":"public","date_updated":"2022-01-06T06:50:50Z","_id":"1077","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"42447"},{"user_id":"42447","language":[{"iso":"ger"}],"_id":"1078","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","author":[{"last_name":"Shabani","first_name":"Albana","full_name":"Shabani, Albana"}],"year":"2017","status":"public","title":"Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse","department":[{"_id":"280"}],"type":"bachelorsthesis","date_created":"2017-12-19T10:05:34Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"bibtex":"@book{Shabani_2017, title={Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Shabani, Albana}, year={2017} }","chicago":"Shabani, Albana. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","short":"A. Shabani, Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse, Universität Paderborn, 2017.","ama":"Shabani A. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn; 2017.","ieee":"A. Shabani, <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","mla":"Shabani, Albana. <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","apa":"Shabani, A. (2017). <i>Die Fusion von AOL und Time Warner - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn."},"supervisor":[{"full_name":"Hehenkamp, Burkhard","first_name":"Burkhard","last_name":"Hehenkamp","id":"37339"}]},{"year":"2017","status":"public","title":"Das Zusammenschlussvorhaben von Edeka und Kaiser's Tengelmann - eine ökonomische Analyse","author":[{"full_name":"Hamacher, Dustin Stefan","first_name":"Dustin Stefan","last_name":"Hamacher"}],"date_updated":"2022-01-06T06:50:50Z","publisher":"Universität Paderborn","_id":"1079","language":[{"iso":"ger"}],"user_id":"42447","supervisor":[{"id":"37339","first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard"}],"citation":{"ieee":"D. S. Hamacher, <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. 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.","chicago":"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.","mla":"Hamacher, Dustin Stefan. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn, 2017.","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} }","ama":"Hamacher DS. <i>Das Zusammenschlussvorhaben von Edeka und Kaiser’s Tengelmann - eine ökonomische Analyse</i>. Universität Paderborn; 2017."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2017-12-19T10:06:36Z","type":"bachelorsthesis","department":[{"_id":"280"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander","id":"40384"}],"citation":{"ama":"Bürmann J. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn; 2017.","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017.","chicago":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. 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} }","apa":"Bürmann, J. (2017). <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn.","mla":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","ieee":"J. Bürmann, <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017."},"department":[{"_id":"63"},{"_id":"541"}],"type":"mastersthesis","date_created":"2017-12-19T10:07:35Z","date_updated":"2022-01-06T06:50:50Z","author":[{"full_name":"Bürmann, Jan","last_name":"Bürmann","first_name":"Jan"}],"title":"Complexity of Signalling in Routing Games under Uncertainty","year":"2017","status":"public","user_id":"14052","publisher":"Universität Paderborn","_id":"1080"},{"publisher":"Universität Paderborn","_id":"1081","user_id":"14052","title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","status":"public","year":"2017","author":[{"full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran","last_name":"Vijayalakshmi"}],"date_updated":"2022-01-06T06:50:51Z","date_created":"2017-12-19T10:08:44Z","type":"mastersthesis","department":[{"_id":"63"},{"_id":"541"}],"citation":{"chicago":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","apa":"Vijayalakshmi, V. R. (2017). <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn.","ieee":"V. R. Vijayalakshmi, <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","ama":"Vijayalakshmi VR. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn; 2017.","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} }","mla":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017."},"supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"main_file_link":[{"url":"http://groups.uni-paderborn.de/wp-wiwi/RePEc/pdf/ciepap/WP110.pdf","open_access":"1"}],"series_title":"Working Papers CIE","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:51Z","intvolume":"       110","title":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse","year":"2017","author":[{"id":"42447","full_name":"Hoyer, Britta","first_name":"Britta","last_name":"Hoyer"},{"last_name":"Stroh-Maraun","first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"type":"working_paper","department":[{"_id":"280"},{"_id":"205"},{"_id":"475"}],"file":[{"creator":"nmaraun","date_created":"2018-08-15T07:33:12Z","file_name":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.pdf","access_level":"closed","file_size":346752,"relation":"main_file","date_updated":"2018-08-15T07:33:12Z","file_id":"3911","success":1,"content_type":"application/pdf"}],"date_created":"2017-12-20T16:21:51Z","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"42447","volume":110,"publisher":"CIE Working Paper Series, Paderborn University","_id":"1083","has_accepted_license":"1","status":"public","oa":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-08-15T07:33:12Z","citation":{"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.","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} }","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.","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.","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.","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."}},{"citation":{"chicago":"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.","apa":"N, N. (2017). <i>Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach</i>. Universität Paderborn.","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.","bibtex":"@book{N_2017, title={Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Multi-Dimensional Bargaining Problem and Nash Solution - A Procedural Approach</i>. Universität Paderborn, 2017."},"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-11-28T11:39:28Z","type":"mastersthesis","department":[{"_id":"205"}],"title":"Multi-Dimensional Bargaining Problem and Nash Solution - A procedural approach","year":"2017","status":"public","author":[{"full_name":"N, N","first_name":"N","last_name":"N"}],"date_updated":"2022-11-30T14:16:20Z","language":[{"iso":"eng"}],"_id":"5954","publisher":"Universität Paderborn","user_id":"477"},{"date_created":"2018-11-28T11:46:21Z","type":"mastersthesis","department":[{"_id":"205"}],"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"citation":{"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} }","ama":"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.","chicago":"N, N. <i>Game Theory Solutions for the Transshipment Problem in Logistic Networks</i>. Universität Paderborn, 2017.","short":"N. N, Game Theory Solutions for the Transshipment Problem in Logistic Networks, Universität Paderborn, 2017."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"_id":"5957","publisher":"Universität Paderborn","user_id":"477","year":"2017","status":"public","title":"Game Theory solutions for the Transshipment Problem in Logistic Networks","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"date_updated":"2022-11-30T14:16:55Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"id":"20801","last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"}],"citation":{"ieee":"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.","short":"N. N, Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?, Universität Paderborn, 2017.","chicago":"N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> Universität Paderborn, 2017.","mla":"N, N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> 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} }","ama":"N N. <i>Bitcoin, Ethereum &#38; Co. Was Zeichnet Eine Gute Kryptowährung Aus?</i> Universität Paderborn; 2017."},"type":"mastersthesis","department":[{"_id":"205"}],"date_created":"2018-11-28T11:41:05Z","date_updated":"2022-11-30T14:16:36Z","year":"2017","title":"Bitcoin, Ethereum & Co. Was zeichnet eine gute Kryptowährung aus?","status":"public","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"user_id":"477","language":[{"iso":"eng"}],"_id":"5955","publisher":"Universität Paderborn"},{"date_updated":"2022-11-30T14:22:04Z","author":[{"full_name":"N, N","first_name":"N","last_name":"N"}],"status":"public","title":"Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens","year":"2017","user_id":"477","_id":"5948","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"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.","bibtex":"@book{N_2017, title={Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","apa":"N, N. (2017). <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn.","ieee":"N. N, <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017.","short":"N. N, Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens, Universität Paderborn, 2017.","chicago":"N, N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017."},"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T11:25:19Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"mla":"N, N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2017.","ama":"N N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","apa":"N, N. (2017). <i>Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse</i>. Universität Paderborn.","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.","short":"N. N, Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse, Universität Paderborn, 2017."},"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"type":"bachelorsthesis","department":[{"_id":"205"}],"date_created":"2018-11-28T11:27:27Z","date_updated":"2022-11-30T14:21:49Z","title":"Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse","status":"public","year":"2017","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"user_id":"477","language":[{"iso":"eng"}],"_id":"5949","publisher":"Universität Paderborn"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"citation":{"short":"N. N, Dynamische Multikriterielle Lohnverhandlungen, Universität Paderborn, 2017.","chicago":"N, N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn.","ieee":"N. N, <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","ama":"N N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. 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."},"type":"bachelorsthesis","department":[{"_id":"205"}],"date_created":"2018-11-28T10:45:18Z","date_updated":"2022-11-30T14:21:35Z","year":"2017","status":"public","title":"Dynamische multikriterielle Lohnverhandlungen","author":[{"full_name":"N, N","first_name":"N","last_name":"N"}],"user_id":"477","language":[{"iso":"eng"}],"_id":"5943","publisher":"Universität Paderborn"},{"date_created":"2018-11-28T10:43:55Z","type":"bachelorsthesis","department":[{"_id":"205"}],"citation":{"ieee":"N. N, <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","mla":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Kooperative Standortspiele</i>. Universität Paderborn.","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.","ama":"N N. <i>Kooperative Standortspiele</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017."},"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"_id":"5942","publisher":"Universität Paderborn","user_id":"477","status":"public","title":"Kooperative Standortspiele","year":"2017","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"date_updated":"2022-11-30T14:21:18Z"},{"supervisor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"citation":{"ieee":"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.","short":"N. N, Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung, 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.","mla":"N, N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn, 2017.","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} }","ama":"N N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn; 2017."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-11-28T10:47:20Z","department":[{"_id":"205"}],"type":"bachelorsthesis","author":[{"last_name":"N","first_name":"N","full_name":"N, N"}],"status":"public","title":"Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung","year":"2017","date_updated":"2022-11-30T14:22:56Z","_id":"5944","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"title":"Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -","status":"public","year":"2017","author":[{"full_name":"N, N","first_name":"N","last_name":"N"}],"date_updated":"2022-11-30T14:22:18Z","_id":"5947","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"}],"citation":{"chicago":"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.","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.","bibtex":"@book{N_2017, title={Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","ama":"N N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn; 2017.","mla":"N, N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn, 2017."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-11-28T11:18:01Z","type":"bachelorsthesis","department":[{"_id":"205"}]},{"date_created":"2018-11-28T10:49:30Z","type":"bachelorsthesis","department":[{"_id":"205"}],"citation":{"ieee":"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.","short":"N. N, Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments, Universität Paderborn, 2017.","chicago":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2017.","mla":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. 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} }","ama":"N N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn; 2017."},"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"_id":"5945","publisher":"Universität Paderborn","user_id":"477","title":"Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments","status":"public","year":"2017","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"date_updated":"2022-11-30T14:22:33Z"}]