[{"title":"Weighted school choice problems and the weighted top trading cycles mechanism","date_created":"2024-10-08T11:52:59Z","publisher":"Elsevier BV","year":"2024","language":[{"iso":"eng"}],"keyword":["Matching","School choice","College admission problems","Top trading cycles","Pareto efficiency","Strategy-proofness"],"ddc":["330"],"file":[{"date_updated":"2024-10-08T11:53:39Z","date_created":"2024-10-08T11:53:39Z","creator":"nmaraun","file_size":611017,"file_id":"56421","file_name":"1-s2.0-S0165489624000817-main.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"There are a number of school choice problems in which students are heterogeneous according to the number of seats they occupy at the school they are assigned to. We propose a weighted school choice problem by assigning each student a so-called weight and formulate the weighted top trading cycles algorithm (WTTC) to find a matching. The WTTC is strategy-proof and results in a Pareto efficient matching. While the WTTC is a robust extension of the TTC when weights are introduced, it is no longer guaranteed that each student gets a seat at a school even if the overall capacity exceeds the sum of weights. Additionally, the WTTC introduces a trade-off between weights and priorities as a student with a higher weight has a disadvantage to be matched to a particular school compared to a student with the same schools’ priorities but a smaller weight."}],"publication":"Mathematical Social Sciences","doi":"10.1016/j.mathsocsci.2024.09.001","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0165489624000817?via%3Dihub"}],"volume":132,"author":[{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"}],"date_updated":"2025-02-28T11:33:48Z","oa":"1","page":"49-56","intvolume":"       132","citation":{"mla":"Stroh-Maraun, Nadja. “Weighted School Choice Problems and the Weighted Top Trading Cycles Mechanism.” <i>Mathematical Social Sciences</i>, vol. 132, Elsevier BV, 2024, pp. 49–56, doi:<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>.","bibtex":"@article{Stroh-Maraun_2024, title={Weighted school choice problems and the weighted top trading cycles mechanism}, volume={132}, DOI={<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>}, journal={Mathematical Social Sciences}, publisher={Elsevier BV}, author={Stroh-Maraun, Nadja}, year={2024}, pages={49–56} }","short":"N. Stroh-Maraun, Mathematical Social Sciences 132 (2024) 49–56.","apa":"Stroh-Maraun, N. (2024). Weighted school choice problems and the weighted top trading cycles mechanism. <i>Mathematical Social Sciences</i>, <i>132</i>, 49–56. <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">https://doi.org/10.1016/j.mathsocsci.2024.09.001</a>","ieee":"N. Stroh-Maraun, “Weighted school choice problems and the weighted top trading cycles mechanism,” <i>Mathematical Social Sciences</i>, vol. 132, pp. 49–56, 2024, doi: <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>.","chicago":"Stroh-Maraun, Nadja. “Weighted School Choice Problems and the Weighted Top Trading Cycles Mechanism.” <i>Mathematical Social Sciences</i> 132 (2024): 49–56. <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">https://doi.org/10.1016/j.mathsocsci.2024.09.001</a>.","ama":"Stroh-Maraun N. Weighted school choice problems and the weighted top trading cycles mechanism. <i>Mathematical Social Sciences</i>. 2024;132:49-56. doi:<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>"},"jel":["C78","D47"],"publication_identifier":{"issn":["0165-4896"]},"has_accepted_license":"1","publication_status":"published","file_date_updated":"2024-10-08T11:53:39Z","funded_apc":"1","article_type":"original","department":[{"_id":"200"}],"user_id":"477","_id":"56420","project":[{"grant_number":"160364472","_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Teilprojekt A3)"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Projektbereich A: Algorithmische und ökonomische Grundlagen für die Organisation großer, dynamischer Märkte","_id":"2"}],"status":"public","type":"journal_article"},{"citation":{"ieee":"N. Stroh-Maraun, <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020.","chicago":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>.","ama":"Stroh-Maraun N. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>","bibtex":"@book{Stroh-Maraun_2020, title={Mechanisms, Preferences, and Heterogeneity in Matching Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2020} }","mla":"Stroh-Maraun, Nadja. <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-958\">10.17619/UNIPB/1-958</a>.","short":"N. Stroh-Maraun, Mechanisms, Preferences, and Heterogeneity in Matching Markets, Universität Paderborn, 2020.","apa":"Stroh-Maraun, N. (2020). <i>Mechanisms, Preferences, and Heterogeneity in Matching Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-958\">https://doi.org/10.17619/UNIPB/1-958</a>"},"year":"2020","doi":"10.17619/UNIPB/1-958","title":"Mechanisms, Preferences, and Heterogeneity in Matching Markets","date_created":"2020-04-29T08:29:45Z","author":[{"full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun","first_name":"Nadja"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:58Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"205"}],"user_id":"477","_id":"16910","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"date_updated":"2022-01-06T06:52:49Z","volume":121,"author":[{"id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer","first_name":"Britta"},{"full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun","first_name":"Nadja"}],"date_created":"2020-03-24T08:05:53Z","title":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse","doi":"10.1016/j.geb.2020.03.006","publication_status":"published","year":"2020","page":"453 - 481","intvolume":"       121","citation":{"apa":"Hoyer, B., &#38; Stroh-Maraun, N. (2020). Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse. <i>Games and Economic Behavior</i>, <i>121</i>, 453–481. <a href=\"https://doi.org/10.1016/j.geb.2020.03.006\">https://doi.org/10.1016/j.geb.2020.03.006</a>","bibtex":"@article{Hoyer_Stroh-Maraun_2020, title={Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}, volume={121}, DOI={<a href=\"https://doi.org/10.1016/j.geb.2020.03.006\">10.1016/j.geb.2020.03.006</a>}, journal={Games and Economic Behavior}, author={Hoyer, Britta and Stroh-Maraun, Nadja}, year={2020}, pages={453–481} }","mla":"Hoyer, Britta, and Nadja Stroh-Maraun. “Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.” <i>Games and Economic Behavior</i>, vol. 121, 2020, pp. 453–81, doi:<a href=\"https://doi.org/10.1016/j.geb.2020.03.006\">10.1016/j.geb.2020.03.006</a>.","short":"B. Hoyer, N. Stroh-Maraun, Games and Economic Behavior 121 (2020) 453–481.","chicago":"Hoyer, Britta, and Nadja Stroh-Maraun. “Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.” <i>Games and Economic Behavior</i> 121 (2020): 453–81. <a href=\"https://doi.org/10.1016/j.geb.2020.03.006\">https://doi.org/10.1016/j.geb.2020.03.006</a>.","ieee":"B. Hoyer and N. Stroh-Maraun, “Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse,” <i>Games and Economic Behavior</i>, vol. 121, pp. 453–481, 2020.","ama":"Hoyer B, Stroh-Maraun N. Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse. <i>Games and Economic Behavior</i>. 2020;121:453-481. doi:<a href=\"https://doi.org/10.1016/j.geb.2020.03.006\">10.1016/j.geb.2020.03.006</a>"},"_id":"16334","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"},{"_id":"475"},{"_id":"205"},{"_id":"368"}],"user_id":"42447","article_type":"original","language":[{"iso":"eng"}],"publication":"Games and Economic Behavior","type":"journal_article","abstract":[{"lang":"eng","text":"We analyze the actual behavior of agents in a matching mechanism, using data from a clearinghouse at the Faculty of Business Administration and Economics at a German university, where a variant of the Boston mechanism is used. We supplement this data with data generated in a survey among the students who participated in the clearinghouse. We find that under the current mechanism over 74% of students act strategically by misrepresenting at least one of their preferences. Nevertheless, not all students are able to improve their outcome by doing so. We show that this is mainly due to the incomplete information of students and naiveté. Sophisticated students actually reach significantly better outcomes than naive students. Thus, we find evidence that naive students are exploited by sophisticated students in an incomplete information setting."}],"status":"public"},{"_id":"2831","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"user_id":"14052","file_date_updated":"2018-08-15T07:30:50Z","type":"conference","status":"public","date_updated":"2022-01-06T06:58:01Z","author":[{"full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"},{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"conference":{"location":"Irvine, California, USA","end_date":"2018-06-18","start_date":"2018-06-18","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)"},"doi":"10.1145/3230654.3230659","publication_identifier":{"isbn":["978-1-4503-5916-0"]},"has_accepted_license":"1","publication_status":"published","page":"5:1-5:6","citation":{"ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>","ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine, California, USA, 2018, pp. 5:1-5:6.","chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 5:1-5:6, 2018. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>.","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6.","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>.","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6). Irvine, California, USA. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>"},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","abstract":[{"text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-08-15T07:30:50Z","creator":"nmaraun","date_created":"2018-08-15T07:30:50Z","file_size":1450171,"file_id":"3910","access_level":"closed","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf"}],"date_created":"2018-05-22T10:28:51Z","title":"Disaggregating User Evaluations Using the Shapley Value","year":"2018"},{"ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"file":[{"file_size":261888,"title":"Outcome equivalence in school choice with reciprocal preferences","file_name":"1-s2.0-S016517651830212X-main.pdf","access_level":"closed","file_id":"3854","date_updated":"2018-08-09T09:15:07Z","date_created":"2018-08-09T08:08:17Z","creator":"cjhaake","relation":"main_file","content_type":"application/pdf"}],"publication":"Economics Letters","title":"Outcome Equivalence in School Choice with Reciprocal Preferences","publisher":"Elsevier","date_created":"2018-05-03T07:53:56Z","year":"2018","file_date_updated":"2018-08-09T09:15:07Z","_id":"2566","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"}],"user_id":"477","urn":"25669","status":"public","type":"journal_article","doi":"10.1016/j.econlet.2018.05.033","date_updated":"2022-01-06T06:57:09Z","volume":170,"author":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"},{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"page":"39 - 41","intvolume":"       170","citation":{"mla":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School Choice with Reciprocal Preferences.” <i>Economics Letters</i>, vol. 170, Elsevier, 2018, pp. 39–41, doi:<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>.","bibtex":"@article{Haake_Stroh-Maraun_2018, title={Outcome Equivalence in School Choice with Reciprocal Preferences}, volume={170}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>}, journal={Economics Letters}, publisher={Elsevier}, author={Haake, Claus-Jochen and Stroh-Maraun, Nadja}, year={2018}, pages={39–41} }","short":"C.-J. Haake, N. Stroh-Maraun, Economics Letters 170 (2018) 39–41.","apa":"Haake, C.-J., &#38; Stroh-Maraun, N. (2018). Outcome Equivalence in School Choice with Reciprocal Preferences. <i>Economics Letters</i>, <i>170</i>, 39–41. <a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">https://doi.org/10.1016/j.econlet.2018.05.033</a>","chicago":"Haake, Claus-Jochen, and Nadja Stroh-Maraun. “Outcome Equivalence in School Choice with Reciprocal Preferences.” <i>Economics Letters</i> 170 (2018): 39–41. <a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">https://doi.org/10.1016/j.econlet.2018.05.033</a>.","ieee":"C.-J. Haake and N. Stroh-Maraun, “Outcome Equivalence in School Choice with Reciprocal Preferences,” <i>Economics Letters</i>, vol. 170, pp. 39–41, 2018.","ama":"Haake C-J, Stroh-Maraun N. Outcome Equivalence in School Choice with Reciprocal Preferences. <i>Economics Letters</i>. 2018;170:39-41. doi:<a href=\"https://doi.org/10.1016/j.econlet.2018.05.033\">10.1016/j.econlet.2018.05.033</a>"},"has_accepted_license":"1","publication_status":"published"},{"title":"More than skills: A novel matching proposal for multiplayer video games","publisher":"Elsevier","date_created":"2017-12-18T10:35:17Z","year":"2018","ddc":["040"],"language":[{"iso":"eng"}],"file":[{"date_updated":"2018-08-15T07:14:40Z","date_created":"2018-08-15T07:14:40Z","creator":"nmaraun","file_size":297649,"title":"More than skills: A novel matching proposal for multiplayer video games","access_level":"closed","file_id":"3906","file_name":"More than skills - A novel matching proposal for multiplayer video games.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"Entertainment Computing","doi":"10.1016/j.entcom.2017.12.002","date_updated":"2022-01-06T06:50:49Z","author":[{"first_name":"Nadja","last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja"},{"last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949","first_name":"Daniel"},{"first_name":"Joe","last_name":"Cox","full_name":"Cox, Joe"}],"volume":25,"citation":{"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>","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} }","short":"N. Stroh-Maraun, D. Kaimann, J. Cox, Entertainment Computing 25 (2018) 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>.","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>"},"page":"26-36","intvolume":"        25","has_accepted_license":"1","file_date_updated":"2018-08-15T07:14:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"1063","user_id":"13264","department":[{"_id":"205"},{"_id":"183"}],"status":"public","type":"journal_article"},{"department":[{"_id":"205"},{"_id":"183"}],"user_id":"65453","_id":"1173","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"file_date_updated":"2018-08-15T07:23:38Z","type":"journal_article","status":"public","volume":17,"author":[{"first_name":"Daniel","last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949"},{"id":"13264","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun","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","has_accepted_license":"1","publication_status":"published","page":"290 - 301","intvolume":"        17","citation":{"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>","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>","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.","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>."},"language":[{"iso":"eng"}],"ddc":["040"],"publication":"Journal of Consumer Behaviour","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"3908","file_name":"A duration model analysis of consumer preferences and determinants of video game consumption.pdf","access_level":"closed","file_size":425823,"date_created":"2018-08-15T07:23:38Z","creator":"nmaraun","date_updated":"2018-08-15T07:23:38Z"}],"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","issue":"3","year":"2018"},{"issue":"3","year":"2018","date_created":"2017-12-06T15:16:58Z","publisher":"Wiley-Blackwell","title":"Variety in the video game industry: An empirical study of the Wundt curve","publication":"Managerial and Decision Economics","file":[{"file_name":"Variety in the video game industry - An empirical study of the Wundt curve.pdf","file_id":"3907","access_level":"closed","file_size":434901,"date_created":"2018-08-15T07:21:08Z","creator":"nmaraun","date_updated":"2018-08-15T07:21:08Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["040"],"publication_status":"published","publication_identifier":{"issn":["0143-6570"]},"has_accepted_license":"1","citation":{"bibtex":"@article{Kaimann_Stroh-Maraun_Cox_2018, title={Variety in the video game industry: An empirical study of the Wundt curve}, volume={39}, DOI={<a href=\"https://doi.org/10.1002/mde.2909\">10.1002/mde.2909</a>}, number={3}, journal={Managerial and Decision Economics}, publisher={Wiley-Blackwell}, author={Kaimann, Daniel and Stroh-Maraun, Nadja and Cox, Joe}, year={2018}, pages={354–362} }","mla":"Kaimann, Daniel, et al. “Variety in the Video Game Industry: An Empirical Study of the Wundt Curve.” <i>Managerial and Decision Economics</i>, vol. 39, no. 3, Wiley-Blackwell, 2018, pp. 354–62, doi:<a href=\"https://doi.org/10.1002/mde.2909\">10.1002/mde.2909</a>.","short":"D. Kaimann, N. Stroh-Maraun, J. Cox, Managerial and Decision Economics 39 (2018) 354–362.","apa":"Kaimann, D., Stroh-Maraun, N., &#38; Cox, J. (2018). Variety in the video game industry: An empirical study of the Wundt curve. <i>Managerial and Decision Economics</i>, <i>39</i>(3), 354–362. <a href=\"https://doi.org/10.1002/mde.2909\">https://doi.org/10.1002/mde.2909</a>","chicago":"Kaimann, Daniel, Nadja Stroh-Maraun, and Joe Cox. “Variety in the Video Game Industry: An Empirical Study of the Wundt Curve.” <i>Managerial and Decision Economics</i> 39, no. 3 (2018): 354–62. <a href=\"https://doi.org/10.1002/mde.2909\">https://doi.org/10.1002/mde.2909</a>.","ieee":"D. Kaimann, N. Stroh-Maraun, and J. Cox, “Variety in the video game industry: An empirical study of the Wundt curve,” <i>Managerial and Decision Economics</i>, vol. 39, no. 3, pp. 354–362, 2018.","ama":"Kaimann D, Stroh-Maraun N, Cox J. Variety in the video game industry: An empirical study of the Wundt curve. <i>Managerial and Decision Economics</i>. 2018;39(3):354-362. doi:<a href=\"https://doi.org/10.1002/mde.2909\">10.1002/mde.2909</a>"},"page":"354 - 362","intvolume":"        39","author":[{"last_name":"Kaimann","id":"18949","full_name":"Kaimann, Daniel","first_name":"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"}],"volume":39,"date_updated":"2022-01-06T06:50:36Z","doi":"10.1002/mde.2909","type":"journal_article","status":"public","user_id":"65453","department":[{"_id":"205"},{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"1031","file_date_updated":"2018-08-15T07:21:08Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_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","date_updated":"2022-01-06T06:50:51Z","oa":"1","author":[{"first_name":"Britta","id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer"},{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"volume":110,"main_file_link":[{"open_access":"1","url":"http://groups.uni-paderborn.de/wp-wiwi/RePEc/pdf/ciepap/WP110.pdf"}],"has_accepted_license":"1","citation":{"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.","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.","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.","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} }","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."},"intvolume":"       110","ddc":["040"],"language":[{"iso":"eng"}],"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"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse.pdf","file_id":"3911","file_size":346752,"date_created":"2018-08-15T07:33:12Z","creator":"nmaraun","date_updated":"2018-08-15T07:33:12Z"}],"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"},{"status":"public","type":"mastersthesis","user_id":"13264","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"536","citation":{"apa":"Stroh-Maraun, N. (2013). <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn.","short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.","bibtex":"@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }","mla":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","chicago":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","ieee":"N. Stroh-Maraun, <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","ama":"Stroh-Maraun N. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn; 2013."},"year":"2013","title":"Dynamic One-to-One Matching: Theory and a Job Market Application","author":[{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"}],"date_created":"2017-10-17T12:42:36Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z"},{"type":"bachelorsthesis","status":"public","_id":"651","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"205"}],"user_id":"13264","language":[{"iso":"ger"}],"year":"2011","citation":{"ama":"Stroh-Maraun N. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn; 2011.","chicago":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","ieee":"N. Stroh-Maraun, <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","apa":"Stroh-Maraun, N. (2011). <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn.","mla":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","bibtex":"@book{Stroh-Maraun_2011, title={Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2011} }","short":"N. Stroh-Maraun, Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme, Universität Paderborn, 2011."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:08Z","author":[{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264"}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"date_created":"2017-10-17T12:42:58Z","title":"Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme"}]