[{"type":"conference","editor":[{"first_name":"Klaus","full_name":"Schmid, Klaus","last_name":"Schmid"},{"first_name":"Paola","full_name":"Spoletini, Paola","last_name":"Spoletini"},{"last_name":"Ben Charrada","full_name":"Ben Charrada, Eya","first_name":"Eya"},{"last_name":"Chisik","full_name":"Chisik, Yoram","first_name":"Yoram"},{"first_name":"Fabiano","last_name":"Dalpiaz","full_name":"Dalpiaz, Fabiano"},{"full_name":"Ferrari, Alessio","last_name":"Ferrari","first_name":"Alessio"},{"first_name":"Peter","last_name":"Forbrig","full_name":"Forbrig, Peter"},{"last_name":"Franch","full_name":"Franch, Xavier","first_name":"Xavier"},{"first_name":"Marite","full_name":"Kirikova, Marite","last_name":"Kirikova"},{"first_name":"Nazim","last_name":"Madhavji","full_name":"Madhavji, Nazim"},{"first_name":"Cristina","full_name":"Palomares, Cristina","last_name":"Palomares"},{"last_name":"Ralyté","full_name":"Ralyté, Jolita","first_name":"Jolita"},{"full_name":"Sabetzadeh, Mehrdad","last_name":"Sabetzadeh","first_name":"Mehrdad"},{"full_name":"Sawyer, Pete","last_name":"Sawyer","first_name":"Pete"},{"last_name":"van der Linden","full_name":"van der Linden, Dirk","first_name":"Dirk"},{"full_name":"Zamansky, Anna","last_name":"Zamansky","first_name":"Anna"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"_id":"1183","series_title":"CEUR Workshop Proceedings","user_id":"477","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"file_date_updated":"2018-11-02T14:40:58Z","publication_status":"published","publication_identifier":{"issn":["1613-0073"]},"has_accepted_license":"1","citation":{"apa":"Caron, M., Bäumer, F. S., &#38; Geierhos, M. (2018). Back to Basics: Extracting Software Requirements with a Syntactic Approach. In K. Schmid, P. Spoletini, E. Ben Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, … A. Zamansky (Eds.), <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i> (Vol. 2075). Utrecht, The Netherlands: CEUR-WS.org.","mla":"Caron, Matthew, et al. “Back to Basics: Extracting Software Requirements with a Syntactic Approach.” <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, edited by Klaus Schmid et al., vol. 2075, CEUR-WS.org, 2018.","short":"M. Caron, F.S. Bäumer, M. Geierhos, in: K. Schmid, P. Spoletini, E. Ben Charrada, Y. Chisik, F. Dalpiaz, A. Ferrari, P. Forbrig, X. Franch, M. Kirikova, N. Madhavji, C. Palomares, J. Ralyté, M. Sabetzadeh, P. Sawyer, D. van der Linden, A. Zamansky (Eds.), Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018), CEUR-WS.org, 2018.","bibtex":"@inproceedings{Caron_Bäumer_Geierhos_2018, series={CEUR Workshop Proceedings}, title={Back to Basics: Extracting Software Requirements with a Syntactic Approach}, volume={2075}, booktitle={Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)}, publisher={CEUR-WS.org}, author={Caron, Matthew and Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Schmid, Klaus and Spoletini, Paola and Ben Charrada, Eya and Chisik, Yoram and Dalpiaz, Fabiano and Ferrari, Alessio and Forbrig, Peter and Franch, Xavier and Kirikova, Marite and Madhavji, Nazim and et al.Editors}, year={2018}, collection={CEUR Workshop Proceedings} }","chicago":"Caron, Matthew, Frederik Simon Bäumer, and Michaela Geierhos. “Back to Basics: Extracting Software Requirements with a Syntactic Approach.” In <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, edited by Klaus Schmid, Paola Spoletini, Eya Ben Charrada, Yoram Chisik, Fabiano Dalpiaz, Alessio Ferrari, Peter Forbrig, et al., Vol. 2075. CEUR Workshop Proceedings. CEUR-WS.org, 2018.","ieee":"M. Caron, F. S. Bäumer, and M. Geierhos, “Back to Basics: Extracting Software Requirements with a Syntactic Approach,” in <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>, Utrecht, The Netherlands, 2018, vol. 2075.","ama":"Caron M, Bäumer FS, Geierhos M. Back to Basics: Extracting Software Requirements with a Syntactic Approach. In: Schmid K, Spoletini P, Ben Charrada E, et al., eds. <i>Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track Co-Located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)</i>. Vol 2075. CEUR Workshop Proceedings. CEUR-WS.org; 2018."},"intvolume":"      2075","oa":"1","date_updated":"2022-01-06T06:51:11Z","author":[{"first_name":"Matthew","last_name":"Caron","full_name":"Caron, Matthew"},{"first_name":"Frederik Simon","last_name":"Bäumer","id":"38837","full_name":"Bäumer, Frederik Simon"},{"orcid":"0000-0002-8180-5606","last_name":"Geierhos","full_name":"Geierhos, Michaela","id":"42496","first_name":"Michaela"}],"volume":2075,"main_file_link":[{"open_access":"1","url":"http://ceur-ws.org/Vol-2075/NLP4RE_paper5.pdf"}],"conference":{"end_date":"2018-03-19","location":"Utrecht, The Netherlands","name":"1st Workshop on Natural Language Processing for Requirements Engineering (NLP4RE)","start_date":"2018-03-19"},"publication":"Joint Proceedings of REFSQ-2018 Workshops, Doctoral Symposium, Live Studies Track, and Poster Track co-located with the 23rd International Conference on Requirements Engineering: Foundation for Software Quality (REFSQ 2018)","abstract":[{"lang":"eng","text":"As our world grows in complexity, companies and employees alike need, more than ever before, solutions tailored to their exact needs. Since such tools cannot always be purchased off-the-shelf and need to be designed from the ground up, developers rely on software requirements. In this paper, we present our vision of a syntactic rule-based extraction\r\ntool for software requirements specification documents. In contrast to other methods, our tool will allow stakeholders to express their needs and wishes in unfiltered natural language, which we believe is essential for non-expert users."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T14:40:58Z","date_updated":"2018-11-02T14:40:58Z","file_name":"NLP4RE_paper5.pdf","access_level":"closed","file_id":"5279","file_size":254814}],"ddc":["000"],"language":[{"iso":"eng"}],"quality_controlled":"1","year":"2018","publisher":"CEUR-WS.org","date_created":"2018-03-02T09:28:59Z","title":"Back to Basics: Extracting Software Requirements with a Syntactic Approach"},{"status":"public","type":"mastersthesis","_id":"1186","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":{"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.","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.","bibtex":"@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }","apa":"Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn."},"title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","date_created":"2018-03-02T13:47:57Z","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"author":[{"first_name":"Arne","last_name":"Kemper","full_name":"Kemper, Arne"}]},{"user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1187","type":"bachelorsthesis","status":"public","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"author":[{"first_name":"Marcel","full_name":"Nachtigall, Marcel","last_name":"Nachtigall"}],"date_created":"2018-03-02T13:49:39Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:11Z","title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","citation":{"ama":"Nachtigall M. <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.","ieee":"M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn, 2018.","apa":"Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","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."},"year":"2018"},{"author":[{"first_name":"Jérôme","full_name":"Kempf, Jérôme","last_name":"Kempf"}],"date_created":"2018-03-02T13:51:14Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","title":"Learning deterministic bandit behaviour form compositions","citation":{"bibtex":"@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }","short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 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.","ama":"Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn; 2018.","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."},"year":"2018","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1188","type":"bachelorsthesis","status":"public"},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"75"}],"user_id":"477","_id":"1208","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"apa":"Schwabe, A. (2018). <i>Data-Centre Traffic Optimisation using Software-Defined Networks</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-287\">https://doi.org/10.17619/UNIPB/1-287</a>","short":"A. Schwabe, Data-Centre Traffic Optimisation Using Software-Defined Networks, Universität Paderborn, 2018.","mla":"Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>.","bibtex":"@book{Schwabe_2018, title={Data-Centre Traffic Optimisation using Software-Defined Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>}, publisher={Universität Paderborn}, author={Schwabe, Arne}, year={2018} }","ieee":"A. Schwabe, <i>Data-Centre Traffic Optimisation using Software-Defined Networks</i>. Universität Paderborn, 2018.","chicago":"Schwabe, Arne. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-287\">https://doi.org/10.17619/UNIPB/1-287</a>.","ama":"Schwabe A. <i>Data-Centre Traffic Optimisation Using Software-Defined Networks</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-287\">10.17619/UNIPB/1-287</a>"},"year":"2018","doi":"10.17619/UNIPB/1-287","title":"Data-Centre Traffic Optimisation using Software-Defined Networks","supervisor":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"author":[{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"}],"date_created":"2018-03-13T10:22:51Z","date_updated":"2022-01-06T06:51:17Z","publisher":"Universität Paderborn"},{"year":"2018","date_created":"2019-11-28T10:03:40Z","publisher":"CIE Working Paper Series, Paderborn University","title":"A Note on Manipulability in School Choice with Reciprocal Preferences","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-11-28T10:07:24Z","date_created":"2019-11-28T10:07:24Z","creator":"stela","file_size":328319,"access_level":"closed","file_id":"15209","file_name":"WP - A Note on Manipulability in Scho ol Choice with Reciprocal Preferences.pdf"}],"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."}],"language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","intvolume":"       111","citation":{"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} }","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.","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.","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.","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."},"volume":111,"author":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"first_name":"Nadja","last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja"}],"date_updated":"2022-01-06T06:52:17Z","type":"working_paper","status":"public","department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","_id":"15206","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2019-11-28T10:07:24Z"},{"abstract":[{"lang":"eng","text":"The purpose of the present study is to experimentally test a version of the classical Chain Store Game (CSG) paradox, proposed by Trockel (1986), and determine whether one of the two theories of Induction and Deterrence, which were originally tested competitively by Selten (1978), may better account for the results. With complete and perfect information, the CSG of Selten (1978) was designed to analyze the role of reputation in repeated market interactions. Its results were discussed in two different ways: one is based on backward induction, and the other is intuitively derived from a deterrence argument. As the two explanations are incompatible, alternative models have been proposed to understand them better. The alternative game proposed by Trockel is an imperfect information version of the CSG in which the order of the two players is changed in each round and the ’Out-Aggressive’ equilibrium is used to build reputation. The existence of more than one equilibrium is the basis for the building of reputation. To the best of my knowledge, this study is the first attempt to experimentally test this alternative game with the same purpose."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"WP - Does Informational Equivalence Preserve Strategic Behavior_ An Experimental Study on Trockel's Game.pdf","file_id":"15208","access_level":"closed","file_size":678790,"date_created":"2019-11-28T10:06:57Z","creator":"stela","date_updated":"2019-11-28T10:06:57Z"}],"type":"working_paper","keyword":["Chain Store Game","reputation building","entry deterrence","Trockel's game"],"ddc":["040"],"file_date_updated":"2019-11-28T10:06:57Z","language":[{"iso":"eng"}],"_id":"15207","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"65453","year":"2018","intvolume":"       117","citation":{"bibtex":"@book{Duman_2018, series={Working Papers CIE}, title={Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game}, volume={117}, publisher={CIE Working Paper Series, Paderborn University}, author={Duman, Papatya}, year={2018}, collection={Working Papers CIE} }","short":"P. Duman, Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game, CIE Working Paper Series, Paderborn University, 2018.","mla":"Duman, Papatya. <i>Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game</i>. Vol. 117, CIE Working Paper Series, Paderborn University, 2018.","apa":"Duman, P. (2018). <i>Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game</i> (Vol. 117). CIE Working Paper Series, Paderborn University.","chicago":"Duman, Papatya. <i>Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game</i>. Vol. 117. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2018.","ieee":"P. Duman, <i>Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game</i>, vol. 117. CIE Working Paper Series, Paderborn University, 2018.","ama":"Duman P. <i>Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel’s Game</i>. Vol 117. CIE Working Paper Series, Paderborn University; 2018."},"has_accepted_license":"1","title":"Does Informational Equivalence Preserve Strategic Behavior? An Experimental Study on Trockel's Game","publisher":"CIE Working Paper Series, Paderborn University","date_updated":"2022-01-06T06:52:18Z","volume":117,"author":[{"first_name":"Papatya","last_name":"Duman","full_name":"Duman, Papatya"}],"date_created":"2019-11-28T10:06:11Z"},{"_id":"1029","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"477","file_date_updated":"2018-11-02T16:07:11Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:50:35Z","volume":63,"author":[{"last_name":"De Jaegher","full_name":"De Jaegher, Kris","first_name":"Kris"},{"id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer","first_name":"Britta"}],"doi":"10.1177/0022002717750450","has_accepted_license":"1","intvolume":"        63","page":"502--527","citation":{"ieee":"K. De Jaegher and B. Hoyer, “Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves,” <i>Journal of Conflict Resolution</i>, vol. 63, no. 2, pp. 502--527, 2018.","chicago":"De Jaegher, Kris, and Britta Hoyer. “Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves.” <i>Journal of Conflict Resolution</i> 63, no. 2 (2018): 502--527. <a href=\"https://doi.org/10.1177/0022002717750450\">https://doi.org/10.1177/0022002717750450</a>.","ama":"De Jaegher K, Hoyer B. Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves. <i>Journal of Conflict Resolution</i>. 2018;63(2):502--527. doi:<a href=\"https://doi.org/10.1177/0022002717750450\">10.1177/0022002717750450</a>","apa":"De Jaegher, K., &#38; Hoyer, B. (2018). Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves. <i>Journal of Conflict Resolution</i>, <i>63</i>(2), 502--527. <a href=\"https://doi.org/10.1177/0022002717750450\">https://doi.org/10.1177/0022002717750450</a>","mla":"De Jaegher, Kris, and Britta Hoyer. “Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves.” <i>Journal of Conflict Resolution</i>, vol. 63, no. 2, SAGE Publications, 2018, pp. 502--527, doi:<a href=\"https://doi.org/10.1177/0022002717750450\">10.1177/0022002717750450</a>.","bibtex":"@article{De Jaegher_Hoyer_2018, title={Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves}, volume={63}, DOI={<a href=\"https://doi.org/10.1177/0022002717750450\">10.1177/0022002717750450</a>}, number={2}, journal={Journal of Conflict Resolution}, publisher={SAGE Publications}, author={De Jaegher, Kris and Hoyer, Britta}, year={2018}, pages={502--527} }","short":"K. De Jaegher, B. Hoyer, Journal of Conflict Resolution 63 (2018) 502--527."},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Journal of Conflict Resolution","abstract":[{"text":"We present a game-theoretic model of the repression–dissent nexus, focusing on preemptive repression. A small group of instigating dissidents triggers a protest if each dissident participates. The dissidents face random checks by security forces, and when an individual dissident is caught while preparing to participate, he or she is prevented from doing so. Each dissident can invest in countermeasures, which make checks ineffective. For large benefits of protest, higher preemptive repression in the form of a higher number of checks has a deterrence effect and makes dissidents less prone to invest in countermeasures, decreasing the probability of protest. For small benefits of protest, higher preemptive repression instead has a backfiring effect. Both myopic and farsighted governments avoid the backfiring effect by setting low levels of preemptive repression (velvet-glove strategy). However, only a farsighted government is able to exploit the deterrence effect by maintaining a high level of preemptive repression (iron-fist strategy).","lang":"eng"}],"file":[{"date_updated":"2018-11-02T16:07:11Z","date_created":"2018-11-02T16:07:11Z","creator":"ups","file_size":335051,"access_level":"closed","file_name":"0022002717750450.pdf","file_id":"5323","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"SAGE Publications","date_created":"2017-12-06T10:52:44Z","title":"Preemptive Repression: Deterrence, Backfiring, Iron Fists and Velvet Gloves","issue":"2","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":[{"creator":"nmaraun","date_created":"2018-08-15T07:21:08Z","date_updated":"2018-08-15T07:21:08Z","file_name":"Variety in the video game industry - An empirical study of the Wundt curve.pdf","access_level":"closed","file_id":"3907","file_size":434901,"content_type":"application/pdf","relation":"main_file","success":1}],"language":[{"iso":"eng"}],"ddc":["040"],"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0143-6570"]},"citation":{"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>","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.","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>.","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>","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."},"page":"354 - 362","intvolume":"        39","author":[{"full_name":"Kaimann, Daniel","id":"18949","last_name":"Kaimann","first_name":"Daniel"},{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"},{"first_name":"Joe","full_name":"Cox, Joe","last_name":"Cox"}],"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"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"1031","file_date_updated":"2018-08-15T07:21:08Z"},{"type":"journal_article","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":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"1369","file_date_updated":"2018-10-31T16:56:13Z","publication_status":"epub_ahead","publication_identifier":{"issn":["1382-6905","1573-2886"]},"has_accepted_license":"1","citation":{"apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018).","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, 2018. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>."},"author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T06:51:42Z","doi":"10.1007/s10878-018-0269-7","publication":"Journal of Combinatorial Optimization","file":[{"date_created":"2018-10-31T16:56:13Z","creator":"feldi","date_updated":"2018-10-31T16:56:13Z","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","file_id":"5225","access_level":"closed","file_size":561187,"content_type":"application/pdf","relation":"main_file"}],"abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","date_created":"2018-03-18T11:12:49Z","publisher":"Springer Nature","title":"Pure Nash equilibria in restricted budget games"},{"citation":{"apa":"Reger, A. (2018). <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte</i>.","bibtex":"@book{Reger_2018, place={Universität Paderborn}, title={Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte}, author={Reger, Alexander}, year={2018} }","mla":"Reger, Alexander. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte</i>. 2018.","short":"A. Reger, Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte, Universität Paderborn, 2018.","ama":"Reger A. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte</i>.; 2018.","ieee":"A. Reger, <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte</i>. Universität Paderborn, 2018.","chicago":"Reger, Alexander. <i>Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte</i>. Universität Paderborn, 2018."},"place":"Universität Paderborn","year":"2018","author":[{"first_name":"Alexander","full_name":"Reger, Alexander","last_name":"Reger"}],"supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2018-10-31T09:10:50Z","date_updated":"2022-07-14T13:03:22Z","title":"Wenn Marketing mobil wird - Ein Überblick zum Einfluss mobiler Geräte auf digitale Märkte","type":"bachelorsthesis","status":"public","user_id":"16205","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"5141","language":[{"iso":"other"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"5539","user_id":"16205","language":[{"iso":"other"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-07-14T13:02:54Z","author":[{"first_name":"Viet Huy","full_name":"Tran, Viet Huy","last_name":"Tran"}],"date_created":"2018-11-13T14:39:58Z","supervisor":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"title":"Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick","year":"2018","place":"Universität Paderborn","citation":{"mla":"Tran, Viet Huy. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>. 2018.","short":"V.H. Tran, Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick, Universität Paderborn, 2018.","bibtex":"@book{Tran_2018, place={Universität Paderborn}, title={Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick}, author={Tran, Viet Huy}, year={2018} }","apa":"Tran, V. H. (2018). <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>.","ama":"Tran VH. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>.; 2018.","ieee":"V. H. Tran, <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>. Universität Paderborn, 2018.","chicago":"Tran, Viet Huy. <i>Höhere Verkaufszahlen durch gute Online-Bewertungen - Ein Literaturüberblick</i>. Universität Paderborn, 2018."}},{"supervisor":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"user_id":"16205","date_created":"2018-10-31T09:26:36Z","author":[{"last_name":"Mues","full_name":"Mues, Raphael","first_name":"Raphael"}],"date_updated":"2022-07-14T13:03:15Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"5150","language":[{"iso":"other"}],"title":"Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen","type":"bachelorsthesis","citation":{"apa":"Mues, R. (2018). <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen</i>.","short":"R. Mues, Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen, Universität Paderborn, 2018.","bibtex":"@book{Mues_2018, place={Universität Paderborn}, title={Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen}, author={Mues, Raphael}, year={2018} }","mla":"Mues, Raphael. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen</i>. 2018.","ama":"Mues R. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen</i>.; 2018.","chicago":"Mues, Raphael. <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen</i>. Universität Paderborn, 2018.","ieee":"R. Mues, <i>Eine experimentelle Untersuchung der Wahrnehmung professioneller Online Bewertungen</i>. Universität Paderborn, 2018."},"status":"public","place":"Universität Paderborn","year":"2018"},{"place":"Universität Paderborn","year":"2018","citation":{"short":"J. Dierkes, Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy, Universität Paderborn, 2018.","mla":"Dierkes, Johannes. <i>Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy</i>. 2018.","bibtex":"@book{Dierkes_2018, place={Universität Paderborn}, title={Sharing is Caring - Ein Literaturüberblick über die Sharing Economy}, author={Dierkes, Johannes}, year={2018} }","apa":"Dierkes, J. (2018). <i>Sharing is Caring - Ein Literaturüberblick über die Sharing Economy</i>.","ama":"Dierkes J. <i>Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy</i>.; 2018.","chicago":"Dierkes, Johannes. <i>Sharing Is Caring - Ein Literaturüberblick Über Die Sharing Economy</i>. Universität Paderborn, 2018.","ieee":"J. Dierkes, <i>Sharing is Caring - Ein Literaturüberblick über die Sharing Economy</i>. Universität Paderborn, 2018."},"title":"Sharing is Caring - Ein Literaturüberblick über die Sharing Economy","date_updated":"2022-07-14T13:03:08Z","date_created":"2018-11-08T11:57:25Z","author":[{"last_name":"Dierkes","full_name":"Dierkes, Johannes","first_name":"Johannes"}],"supervisor":[{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"5432","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"user_id":"16205"},{"year":"2018","place":"Universität Paderborn","citation":{"ama":"Hoffmeister J. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.; 2018.","ieee":"J. Hoffmeister, <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>. Universität Paderborn, 2018.","chicago":"Hoffmeister, Jiajia. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>. Universität Paderborn, 2018.","apa":"Hoffmeister, J. (2018). <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>.","bibtex":"@book{Hoffmeister_2018, place={Universität Paderborn}, title={Evaluation von Taxonomien: Ein Literaturüberblick}, author={Hoffmeister, Jiajia}, year={2018} }","mla":"Hoffmeister, Jiajia. <i>Evaluation von Taxonomien: Ein Literaturüberblick</i>. 2018.","short":"J. Hoffmeister, Evaluation von Taxonomien: Ein Literaturüberblick, Universität Paderborn, 2018."},"date_updated":"2022-07-14T13:03:01Z","author":[{"first_name":"Jiajia","last_name":"Hoffmeister","full_name":"Hoffmeister, Jiajia"}],"supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_created":"2018-11-12T09:16:54Z","title":"Evaluation von Taxonomien: Ein Literaturüberblick","type":"bachelorsthesis","status":"public","_id":"5470","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"user_id":"16205","language":[{"iso":"other"}]},{"user_id":"16205","_id":"4764","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","supervisor":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"author":[{"first_name":"Andreas","full_name":"Valentin, Andreas","last_name":"Valentin"}],"date_created":"2018-10-16T13:45:46Z","date_updated":"2022-07-14T13:04:03Z","publisher":"Universität Paderborn","title":"Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick","citation":{"apa":"Valentin, A. (2018). <i>Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität Paderborn.","mla":"Valentin, Andreas. <i>Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität Paderborn, 2018.","bibtex":"@book{Valentin_2018, title={Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick}, publisher={Universität Paderborn}, author={Valentin, Andreas}, year={2018} }","short":"A. Valentin, Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick, Universität Paderborn, 2018.","chicago":"Valentin, Andreas. <i>Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität Paderborn, 2018.","ieee":"A. Valentin, <i>Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität Paderborn, 2018.","ama":"Valentin A. <i>Zweiseitige Märkte und Plattformökonomie in der Information Systems-Forschung - Ein klassifizierender Literaturüberblick</i>. Universität Paderborn; 2018."},"year":"2018"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"16205","_id":"4395","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"apa":"Heukrodt, R. (2018). <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien</i>.","bibtex":"@book{Heukrodt_2018, place={Universität Paderborn}, title={Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien}, author={Heukrodt, René}, year={2018} }","mla":"Heukrodt, René. <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien</i>. 2018.","short":"R. Heukrodt, Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien, Universität Paderborn, 2018.","chicago":"Heukrodt, René. <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien</i>. Universität Paderborn, 2018.","ieee":"R. Heukrodt, <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien</i>. Universität Paderborn, 2018.","ama":"Heukrodt R. <i>Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien</i>.; 2018."},"place":"Universität Paderborn","year":"2018","title":"Anwendung von verhaltenspsychologischen Theorien zur Steigerung rechtskonformer Einverständniserklärungen im E-Mail Marketing unter Berücksichtigung der neuen DSGVO-Richtlinien","supervisor":[{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"author":[{"full_name":"Heukrodt, René","last_name":"Heukrodt","first_name":"René"}],"date_created":"2018-09-14T10:30:04Z","date_updated":"2022-07-14T13:04:16Z"},{"title":"Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform","date_created":"2018-08-20T07:51:00Z","supervisor":[{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"author":[{"first_name":"Christian","full_name":"Werning, Christian","last_name":"Werning"}],"date_updated":"2022-07-14T13:04:30Z","citation":{"chicago":"Werning, Christian. <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>. Universität Paderborn, 2018.","ieee":"C. Werning, <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>. Universität Paderborn, 2018.","ama":"Werning C. <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>.; 2018.","short":"C. Werning, Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform, Universität Paderborn, 2018.","bibtex":"@book{Werning_2018, place={Universität Paderborn}, title={Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform}, author={Werning, Christian}, year={2018} }","mla":"Werning, Christian. <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>. 2018.","apa":"Werning, C. (2018). <i>Gap Theory of Curiosity - Darstellung des aktuellen Forschungsstands und Untersuchung des Einflusses von Neugierde auf Job Performance auf einer Crowdsourcing-Plattform</i>."},"year":"2018","place":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"16205","_id":"3932","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"status":"public","type":"bachelorsthesis"},{"user_id":"16205","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"4795","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-10-23T07:10:22Z","author":[{"first_name":"Timur Andreas Eduard Wolfgang","full_name":"Werner, Timur Andreas Eduard Wolfgang","last_name":"Werner"}],"supervisor":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"date_updated":"2022-07-14T13:03:51Z","title":"Was bewegt Kunden auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation","citation":{"apa":"Werner, T. A. E. W. (2018). <i>Was bewegt Kunden auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation</i>.","bibtex":"@book{Werner_2018, place={Universität Paderborn}, title={Was bewegt Kunden auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation}, author={Werner, Timur Andreas Eduard Wolfgang}, year={2018} }","mla":"Werner, Timur Andreas Eduard Wolfgang. <i>Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>. 2018.","short":"T.A.E.W. Werner, Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation, Universität Paderborn, 2018.","ieee":"T. A. E. W. Werner, <i>Was bewegt Kunden auf Online-Plattformen? - Eine semantische Analyse von Online-Bewertungen mittels Latent Dirichlet Allocation</i>. Universität Paderborn, 2018.","chicago":"Werner, Timur Andreas Eduard Wolfgang. <i>Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>. Universität Paderborn, 2018.","ama":"Werner TAEW. <i>Was Bewegt Kunden Auf Online-Plattformen? - Eine Semantische Analyse von Online-Bewertungen Mittels Latent Dirichlet Allocation</i>.; 2018."},"year":"2018","place":"Universität Paderborn"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"4560","user_id":"16205","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-07-14T13:04:10Z","supervisor":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"author":[{"full_name":"Jongen, Marvin Alexander","last_name":"Jongen","first_name":"Marvin Alexander"}],"date_created":"2018-10-01T09:00:10Z","title":"Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden","place":"Universität Paderborn","year":"2018","citation":{"short":"M.A. Jongen, Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden, Universität Paderborn, 2018.","bibtex":"@book{Jongen_2018, place={Universität Paderborn}, title={Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden}, author={Jongen, Marvin Alexander}, year={2018} }","mla":"Jongen, Marvin Alexander. <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. 2018.","apa":"Jongen, M. A. (2018). <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>.","ama":"Jongen MA. <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>.; 2018.","chicago":"Jongen, Marvin Alexander. <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. Universität Paderborn, 2018.","ieee":"M. A. Jongen, <i>Zu Hause ist es am schönsten? Eine deskriptive Analyse des Online-Bewertungsverhaltens von Einheimischen und Reisenden</i>. Universität Paderborn, 2018."}}]