--- _id: '59' 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). author: - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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} }' 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.' 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.' date_created: 2017-10-17T12:41:02Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/3087556.3087578 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:17:33Z date_updated: 2018-03-21T13:17:33Z file_id: '1578' file_name: 59-progress.pdf file_size: 784867 relation: main_file success: 1 file_date_updated: 2018-03-21T13:17:33Z has_accepted_license: '1' language: - iso: eng page: 123--132 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource' type: conference user_id: '477' year: '2017' ... --- _id: '66' abstract: - lang: eng 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. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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 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} }' 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. 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. 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. short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.' date_created: 2017-10-17T12:41:04Z date_updated: 2022-01-06T07:03:13Z ddc: - '000' department: - _id: '541' - _id: '63' doi: 10.1007/978-3-319-62389-4_15 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:58:42Z date_updated: 2018-10-31T16:58:42Z file_id: '5228' file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf file_size: 346390 relation: main_file success: 1 file_date_updated: 2018-10-31T16:58:42Z has_accepted_license: '1' language: - iso: eng page: 175--187 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) series_title: LNCS status: public title: Pure Nash Equilibria in Restricted Budget Games type: conference user_id: '14052' year: '2017' ... --- _id: '1073' author: - first_name: Simon full_name: Nachtigall, Simon last_name: Nachtigall citation: ama: Nachtigall S. 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} }' chicago: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017. ieee: S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017. mla: Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017. short: S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017. date_created: 2017-12-19T09:59:32Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Sortieren dynamischer Daten type: bachelorsthesis user_id: '14052' year: '2017' ... --- _id: '1074' author: - first_name: Simon full_name: Pukrop, Simon last_name: Pukrop citation: ama: Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017. apa: Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn. bibtex: '@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }' chicago: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. ieee: S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. mla: Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017. short: S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017. date_created: 2017-12-19T10:00:25Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Robuste Optimierung in Congestion Games type: bachelorsthesis user_id: '14052' year: '2017' ... --- _id: '1080' author: - first_name: Jan full_name: Bürmann, Jan last_name: Bürmann citation: ama: Bürmann J. 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. bibtex: '@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={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. short: J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017. date_created: 2017-12-19T10:07:35Z date_updated: 2022-01-06T06:50:50Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Complexity of Signalling in Routing Games under Uncertainty type: mastersthesis user_id: '14052' year: '2017' ... --- _id: '1081' author: - first_name: Vipin Ravindran full_name: Vijayalakshmi, Vipin Ravindran last_name: Vijayalakshmi citation: ama: Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017. apa: Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn. 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} }' chicago: Vijayalakshmi, Vipin Ravindran. 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. mla: Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017. short: V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017. date_created: 2017-12-19T10:08:44Z date_updated: 2022-01-06T06:50:51Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Bounding the Inefficiency of Equilibria in Congestion Games under Taxation type: mastersthesis user_id: '14052' year: '2017' ... --- _id: '1094' 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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' 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} }' 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.' 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.' 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.' date_created: 2018-01-05T08:37:52Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '276' doi: 10.1007/978-3-319-59144-5_32 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:01:09Z date_updated: 2018-10-31T17:01:09Z file_id: '5230' file_name: Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf file_size: 1576363 relation: main_file success: 1 file_date_updated: 2018-10-31T17:01:09Z has_accepted_license: '1' language: - iso: eng page: 462-467 publication: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) series_title: LNCS status: public title: 'Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App' type: conference user_id: '14052' year: '2017' ... --- _id: '1095' abstract: - lang: eng 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. ' author: - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Mike full_name: Langendorf, Mike last_name: Langendorf citation: 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.' 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). 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} }' 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. 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. 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. 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.' date_created: 2018-01-05T08:39:41Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '178' - _id: '185' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:02:07Z date_updated: 2018-10-31T17:02:07Z file_id: '5232' file_name: TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf file_size: 485333 relation: main_file success: 1 file_date_updated: 2018-10-31T17:02:07Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://aisel.aisnet.org/ecis2017_rip/46 oa: '1' page: 2970-2979 publication: Proceedings of the 25th European Conference on Information Systems (ECIS) status: public title: Towards a Lean Approach for Gamifying Education type: conference user_id: '14052' year: '2017' ... --- _id: '200' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees citation: ama: Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016. apa: Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn. bibtex: '@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }' chicago: 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. mla: 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. date_created: 2017-10-17T12:41:31Z date_updated: 2022-01-06T06:54:18Z ddc: - '040' department: - _id: '63' - _id: '541' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:45:57Z date_updated: 2018-03-21T10:45:57Z file_id: '1525' file_name: 200-thesis.pdf file_size: 880390 relation: main_file success: 1 file_date_updated: 2018-03-21T10:45:57Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915 status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Existence and Properties of Pure Nash Equilibria in Budget Games type: dissertation user_id: '15415' year: '2016' ... --- _id: '210' author: - first_name: Lennart full_name: Leder, Lennart last_name: Leder citation: ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016. apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn. bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={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. mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016. short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:54:42Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Congestion Games with Mixed Objectives type: mastersthesis user_id: '14052' year: '2016' ...