[{"ddc":["040"],"_id":"59","author":[{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-21T13:17:33Z","user_id":"477","citation":{"apa":"Kling, P., Mäcker, A., Riechers, S., & Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 123--132). https://doi.org/10.1145/3087556.3087578","bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={10.1145/3087556.3087578}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }","short":"P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:123--132. doi:10.1145/3087556.3087578","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578."},"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"541"}],"abstract":[{"lang":"eng","text":"We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\\%, 15\\%, and 65\\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \\in \\mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed)."}],"date_updated":"2022-01-06T07:02:46Z","doi":"10.1145/3087556.3087578","status":"public","file":[{"file_id":"1578","file_name":"59-progress.pdf","creator":"florida","file_size":784867,"date_updated":"2018-03-21T13:17:33Z","relation":"main_file","content_type":"application/pdf","date_created":"2018-03-21T13:17:33Z","access_level":"closed","success":1}],"type":"conference","date_created":"2017-10-17T12:41:02Z","page":"123--132","year":"2017"},{"status":"public","file":[{"date_created":"2018-10-31T16:58:42Z","success":1,"access_level":"closed","file_id":"5228","creator":"feldi","file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf","content_type":"application/pdf","file_size":346390,"relation":"main_file","date_updated":"2018-10-31T16:58:42Z"}],"year":"2017","page":"175--187","date_created":"2017-10-17T12:41:04Z","type":"conference","title":"Pure Nash Equilibria in Restricted Budget Games","series_title":"LNCS","author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","first_name":"Matthias","orcid":"0000-0003-1348-6516"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"ddc":["000"],"_id":"66","doi":"10.1007/978-3-319-62389-4_15","date_updated":"2022-01-06T07:03:13Z","department":[{"_id":"541"},{"_id":"63"}],"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"}],"user_id":"14052","has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.","apa":"Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15"},"file_date_updated":"2018-10-31T16:58:42Z","publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)"},{"author":[{"full_name":"Nachtigall, Simon","first_name":"Simon","last_name":"Nachtigall"}],"_id":"1073","title":"Sortieren dynamischer Daten","status":"public","user_id":"14052","date_created":"2017-12-19T09:59:32Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"mla":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.","ama":"Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.","ieee":"S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017.","chicago":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.","short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","apa":"Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }"},"department":[{"_id":"63"},{"_id":"541"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"year":"2017","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z"},{"title":"Robuste Optimierung in Congestion Games","status":"public","author":[{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"}],"_id":"1074","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander","last_name":"Skopalik"}],"year":"2017","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","user_id":"14052","date_created":"2017-12-19T10:00:25Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }","mla":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","ieee":"S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","chicago":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","ama":"Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.","short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017.","apa":"Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn."},"language":[{"iso":"ger"}],"department":[{"_id":"63"},{"_id":"541"}],"type":"bachelorsthesis"},{"type":"mastersthesis","department":[{"_id":"63"},{"_id":"541"}],"citation":{"bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017.","ama":"Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.","chicago":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","ieee":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","mla":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","apa":"Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2017-12-19T10:07:35Z","user_id":"14052","date_updated":"2022-01-06T06:50:50Z","publisher":"Universität Paderborn","year":"2017","supervisor":[{"last_name":"Skopalik","first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander"}],"_id":"1080","author":[{"full_name":"Bürmann, Jan","last_name":"Bürmann","first_name":"Jan"}],"status":"public","title":"Complexity of Signalling in Routing Games under Uncertainty"},{"status":"public","title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","_id":"1081","author":[{"full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran","last_name":"Vijayalakshmi"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:51Z","supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander","last_name":"Skopalik"}],"year":"2017","type":"mastersthesis","user_id":"14052","date_created":"2017-12-19T10:08:44Z","citation":{"apa":"Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","mla":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","ama":"Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.","ieee":"V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","bibtex":"@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"63"},{"_id":"541"}]},{"file":[{"file_id":"5230","creator":"feldi","file_name":"Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf","content_type":"application/pdf","relation":"main_file","file_size":1576363,"date_updated":"2018-10-31T17:01:09Z","date_created":"2018-10-31T17:01:09Z","success":1,"access_level":"closed"}],"status":"public","page":"462-467","year":"2017","type":"conference","date_created":"2018-01-05T08:37:52Z","title":"Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App","_id":"1094","ddc":["000"],"series_title":"LNCS","author":[{"orcid":"0000-0003-1348-6516","first_name":"Matthias","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias"},{"full_name":"John, Thomas","id":"3952","first_name":"Thomas","last_name":"John"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"},{"last_name":"Hemsen","first_name":"Paul","full_name":"Hemsen, Paul","id":"22546"},{"full_name":"Klingsieck, Katrin","first_name":"Katrin","last_name":"Klingsieck"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"doi":"10.1007/978-3-319-59144-5_32","date_updated":"2022-01-06T06:50:53Z","file_date_updated":"2018-10-31T17:01:09Z","publication":"Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","abstract":[{"lang":"eng","text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a \"lean\" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification."}],"language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"541"},{"_id":"276"}],"citation":{"short":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","apa":"Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32","mla":"Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.","ama":"Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST). LNCS. ; 2017:462-467. doi:10.1007/978-3-319-59144-5_32","chicago":"Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.","ieee":"M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.","bibtex":"@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017, series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}, DOI={10.1007/978-3-319-59144-5_32}, booktitle={Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }"},"has_accepted_license":"1","user_id":"14052"},{"year":"2017","page":"2970-2979","oa":"1","date_created":"2018-01-05T08:39:41Z","type":"conference","file":[{"date_created":"2018-10-31T17:02:07Z","success":1,"access_level":"closed","content_type":"application/pdf","date_updated":"2018-10-31T17:02:07Z","file_size":485333,"relation":"main_file","file_id":"5232","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf","creator":"feldi"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://aisel.aisnet.org/ecis2017_rip/46"}],"date_updated":"2022-01-06T06:50:53Z","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}],"abstract":[{"text":"Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. ","lang":"eng"}],"has_accepted_license":"1","citation":{"apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., & Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979).","mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79.","ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: Proceedings of the 25th European Conference on Information Systems (ECIS). ; 2017:2970-2979.","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In Proceedings of the 25th European Conference on Information Systems (ECIS), 2970–79, 2017.","short":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.","bibtex":"@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }"},"user_id":"14052","file_date_updated":"2018-10-31T17:02:07Z","publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","title":"Towards a Lean Approach for Gamifying Education","author":[{"id":"3952","full_name":"John, Thomas","last_name":"John","first_name":"Thomas"},{"id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Paul","last_name":"Hemsen","full_name":"Hemsen, Paul","id":"22546"},{"full_name":"Klingsieck, Katrin","last_name":"Klingsieck","first_name":"Katrin"},{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"},{"full_name":"Langendorf, Mike","first_name":"Mike","last_name":"Langendorf"}],"_id":"1095","ddc":["000"]},{"language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"has_accepted_license":"1","citation":{"apa":"Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.","mla":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","ieee":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","ama":"Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.","chicago":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016.","bibtex":"@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }"},"user_id":"15415","file_date_updated":"2018-03-21T10:45:57Z","supervisor":[{"last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T06:54:18Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"}],"ddc":["040"],"_id":"200","title":"Existence and Properties of Pure Nash Equilibria in Budget Games","date_created":"2017-10-17T12:41:31Z","type":"dissertation","year":"2016","publisher":"Universität Paderborn","related_material":{"link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915","relation":"confirmation"}]},"file":[{"file_name":"200-thesis.pdf","creator":"florida","file_id":"1525","content_type":"application/pdf","relation":"main_file","file_size":880390,"date_updated":"2018-03-21T10:45:57Z","success":1,"access_level":"closed","date_created":"2018-03-21T10:45:57Z"}],"status":"public"},{"status":"public","title":"Congestion Games with Mixed Objectives","_id":"210","author":[{"last_name":"Leder","first_name":"Lennart","full_name":"Leder, Lennart"}],"date_updated":"2022-01-06T06:54:42Z","publisher":"Universität Paderborn","year":"2016","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"type":"mastersthesis","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","mla":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","ama":"Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.","chicago":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","ieee":"L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","apa":"Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn."},"date_created":"2017-10-17T12:41:33Z","user_id":"14052"}]