[{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"280"}],"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"_id":"4805","language":[{"iso":"eng"}],"citation":{"mla":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","short":"A. Dalkiran, Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen, Universität Paderborn, 2018.","bibtex":"@book{Dalkiran_2018, title={Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}, publisher={Universität Paderborn}, author={Dalkiran, Alpaslan}, year={2018} }","apa":"Dalkiran, A. (2018). <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn.","ieee":"A. Dalkiran, <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn, 2018.","chicago":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","ama":"Dalkiran A. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn; 2018."},"year":"2018","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_created":"2018-10-24T07:09:05Z","author":[{"first_name":"Alpaslan","full_name":"Dalkiran, Alpaslan","last_name":"Dalkiran"}],"date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","title":"Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen"},{"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"first_name":"Gerrit","last_name":"Gräper","full_name":"Gräper, Gerrit"}],"date_created":"2018-10-24T07:13:33Z","date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","title":"The Suitability of Equilibrium Concepts to evaluate competitive behaviour","citation":{"apa":"Gräper, G. (2018). <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn.","bibtex":"@book{Gräper_2018, title={The Suitability of Equilibrium Concepts to evaluate competitive behaviour}, publisher={Universität Paderborn}, author={Gräper, Gerrit}, year={2018} }","short":"G. Gräper, The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour, Universität Paderborn, 2018.","mla":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018.","ieee":"G. Gräper, <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn, 2018.","chicago":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018.","ama":"Gräper G. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn; 2018."},"year":"2018","user_id":"477","department":[{"_id":"280"}],"project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901","_id":"1"}],"_id":"4806","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"title":"Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft","date_created":"2018-10-24T07:17:10Z","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"author":[{"first_name":"Hüssein","full_name":"Hammo, Hüssein","last_name":"Hammo"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","citation":{"apa":"Hammo, H. (2018). <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn.","short":"H. Hammo, Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft, Universität Paderborn, 2018.","bibtex":"@book{Hammo_2018, title={Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft}, publisher={Universität Paderborn}, author={Hammo, Hüssein}, year={2018} }","mla":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018.","ama":"Hammo H. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn; 2018.","ieee":"H. Hammo, <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn, 2018.","chicago":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018."},"year":"2018","language":[{"iso":"eng"}],"department":[{"_id":"280"}],"user_id":"477","_id":"4807","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"status":"public","type":"mastersthesis"},{"citation":{"bibtex":"@book{Brachmann_2018, title={Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Brachmann, Jessica}, year={2018} }","mla":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","short":"J. Brachmann, Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018.","apa":"Brachmann, J. (2018). <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","ama":"Brachmann J. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018.","ieee":"J. Brachmann, <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","chicago":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018."},"year":"2018","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"date_created":"2018-10-24T08:27:02Z","author":[{"last_name":"Brachmann","full_name":"Brachmann, Jessica","first_name":"Jessica"}],"date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","title":"Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse","type":"bachelorsthesis","status":"public","department":[{"_id":"280"}],"user_id":"477","_id":"4821","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"1","name":"SFB 901"}],"language":[{"iso":"eng"}]},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"280"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"_id":"4822","language":[{"iso":"eng"}],"citation":{"chicago":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ieee":"N. Förstenberg, <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ama":"Förstenberg N. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018.","short":"N. Förstenberg, Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018.","mla":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","bibtex":"@book{Förstenberg_2018, title={Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Förstenberg, Niklas}, year={2018} }","apa":"Förstenberg, N. (2018). <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn."},"year":"2018","author":[{"full_name":"Förstenberg, Niklas","last_name":"Förstenberg","first_name":"Niklas"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"date_created":"2018-10-24T08:34:27Z","date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","title":"Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse"},{"department":[{"_id":"280"}],"user_id":"477","_id":"4827","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-10-24T10:02:54Z","author":[{"last_name":"Khan","full_name":"Khan, Zohaib Ahmad","first_name":"Zohaib Ahmad"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","title":"How can choice sets be architectured to nudge People into certain decisions?","citation":{"apa":"Khan, Z. A. (2018). <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn.","mla":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018.","bibtex":"@book{Khan_2018, title={How can choice sets be architectured to nudge People into certain decisions?}, publisher={Universität Paderborn}, author={Khan, Zohaib Ahmad}, year={2018} }","short":"Z.A. Khan, How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?, Universität Paderborn, 2018.","ama":"Khan ZA. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn; 2018.","ieee":"Z. A. Khan, <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn, 2018.","chicago":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018."},"year":"2018"},{"author":[{"first_name":"Thomas","last_name":"Kusch","full_name":"Kusch, Thomas"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_created":"2018-10-24T10:05:50Z","date_updated":"2022-01-06T07:01:25Z","publisher":"Universität Paderborn","title":"Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse","citation":{"apa":"Kusch, T. (2018). <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. Universität Paderborn.","bibtex":"@book{Kusch_2018, title={Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Kusch, Thomas}, year={2018} }","short":"T. Kusch, Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse, Universität Paderborn, 2018.","mla":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","ieee":"T. Kusch, <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. Universität Paderborn, 2018.","chicago":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","ama":"Kusch T. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn; 2018."},"year":"2018","department":[{"_id":"280"}],"user_id":"477","_id":"4828","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"date_created":"2018-10-29T10:27:40Z","publisher":"MDPI","title":" Determinants of Equilibrium Selection in Network Formation - An Experiment","issue":"4","year":"2018","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Games","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:15:21Z","creator":"ups","date_created":"2018-11-02T15:15:21Z","file_size":492018,"file_name":"games-09-00089.pdf","access_level":"closed","file_id":"5296"}],"volume":9,"author":[{"id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer","first_name":"Britta"},{"last_name":"Rosenkranz","full_name":"Rosenkranz, Stephanie","first_name":"Stephanie"}],"date_updated":"2022-01-06T07:01:33Z","oa":"1","main_file_link":[{"url":"http://www.mdpi.com/2073-4336/9/4/89/","open_access":"1"}],"has_accepted_license":"1","intvolume":"         9","citation":{"apa":"Hoyer, B., &#38; Rosenkranz, S. (2018).  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>, <i>9</i>(4).","mla":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i>, vol. 9, no. 4, 89, MDPI, 2018.","bibtex":"@article{Hoyer_Rosenkranz_2018, title={ Determinants of Equilibrium Selection in Network Formation - An Experiment}, volume={9}, number={489}, journal={Games}, publisher={MDPI}, author={Hoyer, Britta and Rosenkranz, Stephanie}, year={2018} }","short":"B. Hoyer, S. Rosenkranz, Games 9 (2018).","ama":"Hoyer B, Rosenkranz S.  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>. 2018;9(4).","ieee":"B. Hoyer and S. Rosenkranz, “ Determinants of Equilibrium Selection in Network Formation - An Experiment,” <i>Games</i>, vol. 9, no. 4, 2018.","chicago":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i> 9, no. 4 (2018)."},"department":[{"_id":"280"},{"_id":"475"}],"user_id":"42447","_id":"4982","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-11-02T15:15:21Z","article_number":"89","type":"journal_article","status":"public"},{"publication_status":"published","has_accepted_license":"1","publication_identifier":{"eissn":["1932-6203"]},"citation":{"apa":"Mir Djawadi, B., Fahr, R., Haake, C.-J., &#38; Recker, S. (2018). Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>, <i>13</i>(11). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>","short":"B. Mir Djawadi, R. Fahr, C.-J. Haake, S. Recker, PLoS ONE 13 (2018).","mla":"Mir Djawadi, Behnud, et al. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i>, vol. 13, no. 11, e0207172, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>.","bibtex":"@article{Mir Djawadi_Fahr_Haake_Recker_2018, title={Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate}, volume={13}, DOI={<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>}, number={11e0207172}, journal={PLoS ONE}, publisher={Public Library of Science}, author={Mir Djawadi, Behnud and Fahr, Rene and Haake, Claus-Jochen and Recker, Sonja}, year={2018} }","ama":"Mir Djawadi B, Fahr R, Haake C-J, Recker S. Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate. <i>PLoS ONE</i>. 2018;13(11). doi:<a href=\"https://doi.org/10.1371/journal.pone.0207172\">10.1371/journal.pone.0207172</a>","ieee":"B. Mir Djawadi, R. Fahr, C.-J. Haake, and S. Recker, “Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate,” <i>PLoS ONE</i>, vol. 13, no. 11, 2018.","chicago":"Mir Djawadi, Behnud, Rene Fahr, Claus-Jochen Haake, and Sonja Recker. “Maintaining vs. Milking Good Reputation When Customer Feedback Is Inaccurate.” <i>PLoS ONE</i> 13, no. 11 (2018). <a href=\"https://doi.org/10.1371/journal.pone.0207172\">https://doi.org/10.1371/journal.pone.0207172</a>."},"intvolume":"        13","date_updated":"2022-01-06T07:01:50Z","author":[{"first_name":"Behnud","orcid":"0000-0002-6271-5912","last_name":"Mir Djawadi","full_name":"Mir Djawadi, Behnud","id":"26032"},{"last_name":"Fahr","full_name":"Fahr, Rene","id":"111","first_name":"Rene"},{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"},{"last_name":"Recker","full_name":"Recker, Sonja","first_name":"Sonja"}],"volume":13,"doi":"10.1371/journal.pone.0207172","type":"journal_article","status":"public","project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"5330","user_id":"477","department":[{"_id":"205"},{"_id":"475"}],"article_number":"e0207172","article_type":"review","funded_apc":"1","file_date_updated":"2018-11-13T20:51:34Z","issue":"11","year":"2018","publisher":"Public Library of Science","date_created":"2018-11-03T11:51:48Z","title":"Maintaining vs. Milking Good Reputation when Customer Feedback is Inaccurate","publication":"PLoS ONE","abstract":[{"lang":"eng","text":"In Internet transactions, customers and service providers often interact once and anonymously.\r\nTo prevent deceptive behavior a reputation system is particularly important to\r\nreduce information asymmetries about the quality of the offered product or service. In this\r\nstudy we examine the effectiveness of a reputation system to reduce information asymmetries\r\nwhen customers may make mistakes in judging the provided service quality. In our model,\r\na service provider makes strategic quality choices and short-lived customers are asked to\r\nevaluate the observed quality by providing ratings to a reputation system. The customer is\r\nnot able to always evaluate the service quality correctly and possibly submits an erroneous\r\nrating according to a predefined probability. Considering reputation profiles of the last three\r\nsales, within the theoretical model we derive that the service provider’s dichotomous quality\r\ndecisions are independent of the reputation profile and depend only on the probabilities of\r\nreceiving positive and negative ratings when providing low or high quality. Thus, a service\r\nprovider optimally either maintains a good reputation or completely refrains from any reputation\r\nbuilding process. However, when mapping our theoretical model to an experimental\r\ndesign we find that a significant share of subjects in the role of the service provider deviates\r\nfrom optimal behavior and chooses actions which are conditional on the current reputation\r\nprofile. With respect to these individual quality choices we see that subjects use milking\r\nstrategies which means that they exploit a good reputation. In particular, if the sales price\r\nis high, low quality is delivered until the price drops below a certain threshold, and then\r\nhigh quality is chosen until the price increases again."}],"file":[{"file_name":"Maintaining_vs_Milking.pdf","file_id":"5542","access_level":"closed","file_size":1107189,"date_created":"2018-11-13T20:51:34Z","creator":"cjhaake","date_updated":"2018-11-13T20:51:34Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["330"],"language":[{"iso":"eng"}]},{"file_date_updated":"2018-10-31T16:57:32Z","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"669","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","type":"journal_article","doi":"10.1007/s10878-017-0189-y","volume":36,"author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"date_updated":"2022-01-06T07:03:15Z","page":"1145-1167","intvolume":"        36","citation":{"bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>"},"publication_identifier":{"issn":["1382-6905","1573-2886"]},"has_accepted_license":"1","publication_status":"published","language":[{"iso":"eng"}],"ddc":["000"],"external_id":{"arxiv":["1607.05143"]},"file":[{"file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","access_level":"closed","file_id":"5226","file_size":605207,"date_created":"2018-10-31T16:57:32Z","creator":"feldi","date_updated":"2018-10-31T16:57:32Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"publication":"Journal of Combinatorial Optimization","title":"Congestion games with mixed objectives","date_created":"2017-10-26T14:11:04Z","publisher":"Springer Nature","year":"2018","issue":"4"},{"has_accepted_license":"1","citation":{"chicago":"Stroh-Maraun, Nadja, Daniel Kaimann, and Joe Cox. “More than Skills: A Novel Matching Proposal for Multiplayer Video Games.” <i>Entertainment Computing</i> 25 (2018): 26–36. <a href=\"https://doi.org/10.1016/j.entcom.2017.12.002\">https://doi.org/10.1016/j.entcom.2017.12.002</a>.","ieee":"N. Stroh-Maraun, D. Kaimann, and J. Cox, “More than skills: A novel matching proposal for multiplayer video games,” <i>Entertainment Computing</i>, vol. 25, pp. 26–36, 2018.","ama":"Stroh-Maraun N, Kaimann D, Cox J. More than skills: A novel matching proposal for multiplayer video games. <i>Entertainment Computing</i>. 2018;25:26-36. doi:<a href=\"https://doi.org/10.1016/j.entcom.2017.12.002\">10.1016/j.entcom.2017.12.002</a>","apa":"Stroh-Maraun, N., Kaimann, D., &#38; Cox, J. (2018). More than skills: A novel matching proposal for multiplayer video games. <i>Entertainment Computing</i>, <i>25</i>, 26–36. <a href=\"https://doi.org/10.1016/j.entcom.2017.12.002\">https://doi.org/10.1016/j.entcom.2017.12.002</a>","short":"N. Stroh-Maraun, D. Kaimann, J. Cox, Entertainment Computing 25 (2018) 26–36.","bibtex":"@article{Stroh-Maraun_Kaimann_Cox_2018, title={More than skills: A novel matching proposal for multiplayer video games}, volume={25}, DOI={<a href=\"https://doi.org/10.1016/j.entcom.2017.12.002\">10.1016/j.entcom.2017.12.002</a>}, journal={Entertainment Computing}, publisher={Elsevier}, author={Stroh-Maraun, Nadja and Kaimann, Daniel and Cox, Joe}, year={2018}, pages={26–36} }","mla":"Stroh-Maraun, Nadja, et al. “More than Skills: A Novel Matching Proposal for Multiplayer Video Games.” <i>Entertainment Computing</i>, vol. 25, Elsevier, 2018, pp. 26–36, doi:<a href=\"https://doi.org/10.1016/j.entcom.2017.12.002\">10.1016/j.entcom.2017.12.002</a>."},"intvolume":"        25","page":"26-36","date_updated":"2022-01-06T06:50:49Z","author":[{"last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja","first_name":"Nadja"},{"first_name":"Daniel","last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel"},{"first_name":"Joe","full_name":"Cox, Joe","last_name":"Cox"}],"volume":25,"doi":"10.1016/j.entcom.2017.12.002","type":"journal_article","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"1063","user_id":"13264","department":[{"_id":"205"},{"_id":"183"}],"file_date_updated":"2018-08-15T07:14:40Z","year":"2018","publisher":"Elsevier","date_created":"2017-12-18T10:35:17Z","title":"More than skills: A novel matching proposal for multiplayer video games","publication":"Entertainment Computing","file":[{"creator":"nmaraun","date_created":"2018-08-15T07:14:40Z","date_updated":"2018-08-15T07:14:40Z","file_id":"3906","access_level":"closed","file_name":"More than skills - A novel matching proposal for multiplayer video games.pdf","title":"More than skills: A novel matching proposal for multiplayer video games","file_size":297649,"content_type":"application/pdf","relation":"main_file"}],"ddc":["040"],"language":[{"iso":"eng"}]},{"citation":{"short":"L. Rumert, Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells, Universität Paderborn, 2018.","bibtex":"@book{Rumert_2018, title={Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells}, publisher={Universität Paderborn}, author={Rumert, Luis}, year={2018} }","mla":"Rumert, Luis. <i>Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells</i>. Universität Paderborn, 2018.","apa":"Rumert, L. (2018). <i>Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells</i>. Universität Paderborn.","ieee":"L. Rumert, <i>Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells</i>. Universität Paderborn, 2018.","chicago":"Rumert, Luis. <i>Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells</i>. Universität Paderborn, 2018.","ama":"Rumert L. <i>Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells</i>. Universität Paderborn; 2018."},"year":"2018","date_created":"2017-12-19T09:40:44Z","author":[{"full_name":"Rumert, Luis","last_name":"Rumert","first_name":"Luis"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:49Z","title":"Zu den Anreizwirkungen der Kronzeugenregelung - eine wettbewerbspolitische Analyse des Bierkartells","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1064","language":[{"iso":"ger"}]},{"_id":"1066","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"}],"user_id":"42447","type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:49Z","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"author":[{"first_name":"Muhammad Fahad","full_name":"Arfeen, Muhammad Fahad","last_name":"Arfeen"}],"date_created":"2017-12-19T09:43:41Z","title":"How effective are leniency programs in cartel deterrence - An overview of the empirical and experimental literature","year":"2018","citation":{"ama":"Arfeen MF. <i>How Effective Are Leniency Programs in Cartel Deterrence - An Overview of the Empirical and Experimental Literature</i>. Universität Paderborn; 2018.","ieee":"M. F. Arfeen, <i>How effective are leniency programs in cartel deterrence - An overview of the empirical and experimental literature</i>. Universität Paderborn, 2018.","chicago":"Arfeen, Muhammad Fahad. <i>How Effective Are Leniency Programs in Cartel Deterrence - An Overview of the Empirical and Experimental Literature</i>. Universität Paderborn, 2018.","apa":"Arfeen, M. F. (2018). <i>How effective are leniency programs in cartel deterrence - An overview of the empirical and experimental literature</i>. Universität Paderborn.","short":"M.F. Arfeen, How Effective Are Leniency Programs in Cartel Deterrence - An Overview of the Empirical and Experimental Literature, Universität Paderborn, 2018.","bibtex":"@book{Arfeen_2018, title={How effective are leniency programs in cartel deterrence - An overview of the empirical and experimental literature}, publisher={Universität Paderborn}, author={Arfeen, Muhammad Fahad}, year={2018} }","mla":"Arfeen, Muhammad Fahad. <i>How Effective Are Leniency Programs in Cartel Deterrence - An Overview of the Empirical and Experimental Literature</i>. Universität Paderborn, 2018."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"280"}],"user_id":"42447","_id":"1067","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"apa":"Kersting, F. (2018). <i>Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht</i>. Universität Paderborn.","bibtex":"@book{Kersting_2018, title={Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht}, publisher={Universität Paderborn}, author={Kersting, Florian}, year={2018} }","short":"F. Kersting, Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht, Universität Paderborn, 2018.","mla":"Kersting, Florian. <i>Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht</i>. Universität Paderborn, 2018.","ama":"Kersting F. <i>Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht</i>. Universität Paderborn; 2018.","ieee":"F. Kersting, <i>Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht</i>. Universität Paderborn, 2018.","chicago":"Kersting, Florian. <i>Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht</i>. Universität Paderborn, 2018."},"year":"2018","title":"Die Deutsche Fußball Liga GmbH - ein Syndikat? Die Zentralvermarktung der Live-TV-Übertragungsrechte aus wettbewerbspolitischer Sicht","date_created":"2017-12-19T09:45:21Z","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"last_name":"Kersting","full_name":"Kersting, Florian","first_name":"Florian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:49Z"},{"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"date_created":"2017-12-19T09:46:28Z","author":[{"full_name":"Beichl, Philipp","last_name":"Beichl","first_name":"Philipp"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:49Z","title":"Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse","citation":{"chicago":"Beichl, Philipp. <i>Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ieee":"P. Beichl, <i>Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ama":"Beichl P. <i>Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018.","apa":"Beichl, P. (2018). <i>Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","mla":"Beichl, Philipp. <i>Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","bibtex":"@book{Beichl_2018, title={Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Beichl, Philipp}, year={2018} }","short":"P. Beichl, Das Zusammenschlussvorhaben der REWE Markt GmbH und Coop eG - eine wettbewerbspolitische Analyse, Universität Paderborn, 2018."},"year":"2018","user_id":"42447","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1068","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"has_accepted_license":"1","publication_status":"published","intvolume":"        17","page":"290 - 301","citation":{"ama":"Kaimann D, Stroh-Maraun N, Cox J. A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption. <i>Journal of Consumer Behaviour</i>. 2018;17(3):290-301. doi:<a href=\"https://doi.org/10.1002/cb.1711\">10.1002/cb.1711</a>","chicago":"Kaimann, Daniel, Nadja Stroh-Maraun, and Joe Cox. “A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption.” <i>Journal of Consumer Behaviour</i> 17, no. 3 (2018): 290–301. <a href=\"https://doi.org/10.1002/cb.1711\">https://doi.org/10.1002/cb.1711</a>.","ieee":"D. Kaimann, N. Stroh-Maraun, and J. Cox, “A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption,” <i>Journal of Consumer Behaviour</i>, vol. 17, no. 3, pp. 290–301, 2018.","bibtex":"@article{Kaimann_Stroh-Maraun_Cox_2018, title={A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption}, volume={17}, DOI={<a href=\"https://doi.org/10.1002/cb.1711\">10.1002/cb.1711</a>}, number={3}, journal={Journal of Consumer Behaviour}, publisher={Wiley Online Library}, author={Kaimann, Daniel and Stroh-Maraun, Nadja and Cox, Joe}, year={2018}, pages={290–301} }","mla":"Kaimann, Daniel, et al. “A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption.” <i>Journal of Consumer Behaviour</i>, vol. 17, no. 3, Wiley Online Library, 2018, pp. 290–301, doi:<a href=\"https://doi.org/10.1002/cb.1711\">10.1002/cb.1711</a>.","short":"D. Kaimann, N. Stroh-Maraun, J. Cox, Journal of Consumer Behaviour 17 (2018) 290–301.","apa":"Kaimann, D., Stroh-Maraun, N., &#38; Cox, J. (2018). A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption. <i>Journal of Consumer Behaviour</i>, <i>17</i>(3), 290–301. <a href=\"https://doi.org/10.1002/cb.1711\">https://doi.org/10.1002/cb.1711</a>"},"volume":17,"author":[{"first_name":"Daniel","last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel"},{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"},{"last_name":"Cox","full_name":"Cox, Joe","first_name":"Joe"}],"date_updated":"2022-01-06T06:51:08Z","doi":"10.1002/cb.1711","type":"journal_article","status":"public","department":[{"_id":"205"},{"_id":"183"}],"user_id":"65453","_id":"1173","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"file_date_updated":"2018-08-15T07:23:38Z","issue":"3","year":"2018","date_created":"2018-02-14T12:30:36Z","publisher":"Wiley Online Library","title":"A Duration Model Analysis of Consumer Preferences and Determinants of Video Game Consumption","publication":"Journal of Consumer Behaviour","file":[{"relation":"main_file","content_type":"application/pdf","file_size":425823,"access_level":"closed","file_id":"3908","file_name":"A duration model analysis of consumer preferences and determinants of video game consumption.pdf","date_updated":"2018-08-15T07:23:38Z","creator":"nmaraun","date_created":"2018-08-15T07:23:38Z"}],"language":[{"iso":"eng"}],"ddc":["040"]},{"citation":{"apa":"Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn.","bibtex":"@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }","short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","mla":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","ama":"Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn; 2018.","ieee":"A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","chicago":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018."},"year":"2018","date_created":"2018-03-02T13:47:57Z","supervisor":[{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"author":[{"first_name":"Arne","last_name":"Kemper","full_name":"Kemper, Arne"}],"date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","type":"mastersthesis","status":"public","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1186"},{"title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"author":[{"last_name":"Nachtigall","full_name":"Nachtigall, Marcel","first_name":"Marcel"}],"date_created":"2018-03-02T13:49:39Z","year":"2018","citation":{"bibtex":"@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall, Marcel}, year={2018} }","mla":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","apa":"Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn.","ama":"Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn; 2018.","ieee":"M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn, 2018.","chicago":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1187","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","_id":"1188","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","year":"2018","citation":{"short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.","bibtex":"@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }","mla":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn, 2018.","apa":"Kempf, J. (2018). <i>Learning deterministic bandit behaviour form compositions</i>. Universität Paderborn.","ieee":"J. Kempf, <i>Learning deterministic bandit behaviour form compositions</i>. Universität Paderborn, 2018.","chicago":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn, 2018.","ama":"Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn; 2018."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:11Z","date_created":"2018-03-02T13:51:14Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"author":[{"first_name":"Jérôme","last_name":"Kempf","full_name":"Kempf, Jérôme"}],"title":"Learning deterministic bandit behaviour form compositions"},{"file_date_updated":"2019-11-28T10:07:24Z","series_title":"Working Papers CIE","user_id":"65453","department":[{"_id":"205"},{"_id":"475"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"15206","status":"public","type":"working_paper","author":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja"}],"volume":111,"date_updated":"2022-01-06T06:52:17Z","citation":{"chicago":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. <i>A Note on Manipulability in School Choice with Reciprocal Preferences</i>. Vol. 111. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2018.","ieee":"C.-J. Haake and N. Stroh-Maraun, <i>A Note on Manipulability in School Choice with Reciprocal Preferences</i>, vol. 111. CIE Working Paper Series, Paderborn University, 2018.","ama":"Haake C-J, Stroh-Maraun N. <i>A Note on Manipulability in School Choice with Reciprocal Preferences</i>. Vol 111. CIE Working Paper Series, Paderborn University; 2018.","mla":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. <i>A Note on Manipulability in School Choice with Reciprocal Preferences</i>. Vol. 111, CIE Working Paper Series, Paderborn University, 2018.","bibtex":"@book{Haake_Stroh-Maraun_2018, series={Working Papers CIE}, title={A Note on Manipulability in School Choice with Reciprocal Preferences}, volume={111}, publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen and Stroh-Maraun, Nadja}, year={2018}, collection={Working Papers CIE} }","short":"C.-J. Haake, N. Stroh-Maraun, A Note on Manipulability in School Choice with Reciprocal Preferences, CIE Working Paper Series, Paderborn University, 2018.","apa":"Haake, C.-J., &#38; Stroh-Maraun, N. (2018). <i>A Note on Manipulability in School Choice with Reciprocal Preferences</i> (Vol. 111). CIE Working Paper Series, Paderborn University."},"intvolume":"       111","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_updated":"2019-11-28T10:07:24Z","creator":"stela","date_created":"2019-11-28T10:07:24Z","file_size":328319,"access_level":"closed","file_id":"15209","file_name":"WP - A Note on Manipulability in Scho ol Choice with Reciprocal Preferences.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"We show that the Boston school choice mechanism (BM), the student proposing deferred acceptance algorithm (DA) and the top trading cycles algorithm (TTC) generate the same outcome when the colleges’ priorities are modified according to students’ preferences in a “first preferences first” manner. This outcome coincides with the BM outcome under original priorities. As a result, the DA and TTC mechanism that are non-manipulable under original priorities become vulnerable to strategic behavior."}],"title":"A Note on Manipulability in School Choice with Reciprocal Preferences","date_created":"2019-11-28T10:03:40Z","publisher":"CIE Working Paper Series, Paderborn University","year":"2018"}]