[{"volume":36,"author":[{"first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"date_updated":"2022-01-06T07:03:15Z","doi":"10.1007/s10878-017-0189-y","has_accepted_license":"1","publication_identifier":{"issn":["1382-6905","1573-2886"]},"publication_status":"published","intvolume":"        36","page":"1145-1167","citation":{"short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167.","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>."},"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"669","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-10-31T16:57:32Z","type":"journal_article","status":"public","date_created":"2017-10-26T14:11:04Z","publisher":"Springer Nature","title":"Congestion games with mixed objectives","issue":"4","year":"2018","external_id":{"arxiv":["1607.05143"]},"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Journal of Combinatorial Optimization","file":[{"access_level":"closed","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","file_id":"5226","file_size":605207,"date_created":"2018-10-31T16:57:32Z","creator":"feldi","date_updated":"2018-10-31T16:57:32Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}]},{"author":[{"first_name":"Arne","full_name":"Kemper, Arne","last_name":"Kemper"}],"date_created":"2018-03-02T13:47:57Z","supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:11Z","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","citation":{"apa":"Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn.","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} }","ama":"Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn; 2018.","ieee":"A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","chicago":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018."},"year":"2018","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1186","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"type":"mastersthesis","status":"public"},{"status":"public","type":"bachelorsthesis","_id":"1187","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":{"apa":"Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn.","mla":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. 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} }","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","ama":"Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn; 2018.","ieee":"M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn, 2018.","chicago":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018."},"title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","date_created":"2018-03-02T13:49:39Z","author":[{"first_name":"Marcel","full_name":"Nachtigall, Marcel","last_name":"Nachtigall"}],"supervisor":[{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}]},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1188","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"year":"2018","citation":{"apa":"Kempf, J. (2018). <i>Learning deterministic bandit behaviour form compositions</i>. Universität Paderborn.","bibtex":"@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }","mla":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn, 2018.","short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.","chicago":"Kempf, Jérôme. <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.","ama":"Kempf J. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn; 2018."},"date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","author":[{"first_name":"Jérôme","last_name":"Kempf","full_name":"Kempf, Jérôme"}],"supervisor":[{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2018-03-02T13:51:14Z","title":"Learning deterministic bandit behaviour form compositions"},{"year":"2018","publisher":"Springer Nature","date_created":"2018-03-18T11:12:49Z","title":"Pure Nash equilibria in restricted budget games","publication":"Journal of Combinatorial Optimization","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"}],"file":[{"file_id":"5225","access_level":"closed","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","file_size":561187,"date_created":"2018-10-31T16:56:13Z","creator":"feldi","date_updated":"2018-10-31T16:56:13Z","relation":"main_file","content_type":"application/pdf"}],"ddc":["000"],"language":[{"iso":"eng"}],"publication_status":"epub_ahead","has_accepted_license":"1","publication_identifier":{"issn":["1382-6905","1573-2886"]},"citation":{"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>.","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).","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>.","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} }"},"date_updated":"2022-01-06T06:51:42Z","author":[{"full_name":"Drees, Maximilian","last_name":"Drees","first_name":"Maximilian"},{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"doi":"10.1007/s10878-018-0269-7","type":"journal_article","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"1369","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-10-31T16:56:13Z"},{"date_created":"2017-10-17T12:41:13Z","title":"Congestion Games with Complementarities","year":"2017","external_id":{"arxiv":["1701.07304"]},"ddc":["040"],"publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","abstract":[{"text":"We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:05:37Z","creator":"florida","date_created":"2018-03-21T13:05:37Z","file_size":264089,"access_level":"closed","file_id":"1566","file_name":"112-FeldottoLederSkopalik2017.pdf"}],"date_updated":"2022-01-06T06:50:58Z","author":[{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"doi":"10.1007/978-3-319-57586-5_19","has_accepted_license":"1","citation":{"apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2017). Congestion Games with Complementarities. In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i> (pp. 222--233). <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Congestion Games with Complementarities.” <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 222--233. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233.","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>. LNCS. ; 2017:222--233. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>"},"page":"222--233","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"112","series_title":"LNCS","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"file_date_updated":"2018-03-21T13:05:37Z","type":"conference","status":"public"},{"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","file":[{"file_size":279055,"file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","access_level":"closed","file_id":"5231","date_updated":"2018-10-31T17:01:32Z","date_created":"2018-10-31T17:01:32Z","creator":"feldi","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7]."}],"external_id":{"arxiv":["1710.01634"]},"language":[{"iso":"eng"}],"ddc":["000"],"year":"2017","date_created":"2017-10-17T12:41:13Z","title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"113","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-10-31T17:01:32Z","has_accepted_license":"1","citation":{"apa":"Feldotto, M., Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","bibtex":"@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }","mla":"Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>.","ama":"Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>","ieee":"M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017.","chicago":"Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>."},"author":[{"orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"last_name":"Kotsialou","full_name":"Kotsialou, Grammateia","first_name":"Grammateia"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T06:50:59Z","doi":"10.1007/978-3-319-71924-5_14"},{"page":"3-17","citation":{"ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 2017, pp. 3–17.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>","mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17."},"year":"2017","place":"Cham","publication_identifier":{"isbn":["978-3-319-71150-8"]},"doi":"10.1007/978-3-319-71150-8_1","title":"Filtering Undesirable Flows in Networks","author":[{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"first_name":"Stojan","full_name":"Trajanovski, Stojan","last_name":"Trajanovski"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"first_name":"Cees","full_name":"de Laat, Cees","last_name":"de Laat"}],"date_created":"2020-08-06T15:19:48Z","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","status":"public","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","type":"conference","extern":"1","language":[{"iso":"eng"}],"keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"Lecture Notes in Computer Science","_id":"17652"},{"status":"public","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","type":"conference","keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"extern":"1","language":[{"iso":"eng"}],"_id":"17653","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"CCIS","year":"2017","citation":{"ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","ama":"Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Reciprocation Effort Games. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer."},"title":"Reciprocation Effort Games","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer","date_created":"2020-08-06T15:20:09Z","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."}]},{"publisher":"Springer","date_updated":"2022-01-06T06:53:16Z","author":[{"first_name":"Gleb","id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."}],"date_created":"2020-08-06T15:20:19Z","title":"Competition between Cooperative Projects","year":"2017","citation":{"ama":"Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","ieee":"G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017."},"_id":"17654","user_id":"83983","series_title":"CCIS","department":[{"_id":"63"},{"_id":"541"}],"keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"language":[{"iso":"eng"}],"extern":"1","type":"conference","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","status":"public"},{"doi":"10.1145/3087556.3087578","title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","author":[{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:41:02Z","date_updated":"2022-01-06T07:02:46Z","citation":{"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.","bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>}, 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} }","mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>.","apa":"Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 123--132). <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 123--132, 2017. <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>.","ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>"},"page":"123--132","year":"2017","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T13:17:33Z","ddc":["040"],"user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"59","file":[{"file_size":784867,"access_level":"closed","file_id":"1578","file_name":"59-progress.pdf","date_updated":"2018-03-21T13:17:33Z","creator":"florida","date_created":"2018-03-21T13:17:33Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"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).","lang":"eng"}],"type":"conference","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)"},{"year":"2017","date_created":"2017-10-17T12:41:04Z","title":"Pure Nash Equilibria in Restricted Budget Games","publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)","file":[{"date_updated":"2018-10-31T16:58:42Z","date_created":"2018-10-31T16:58:42Z","creator":"feldi","file_size":346390,"file_id":"5228","file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"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."}],"language":[{"iso":"eng"}],"ddc":["000"],"has_accepted_license":"1","citation":{"ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>. LNCS. ; 2017:175--187. doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 175--187. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>}, 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} }","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187, doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i> (pp. 175--187). <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>"},"page":"175--187","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-319-62389-4_15","type":"conference","status":"public","series_title":"LNCS","user_id":"14052","department":[{"_id":"541"},{"_id":"63"}],"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"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"66","file_date_updated":"2018-10-31T16:58:42Z"},{"title":"Sortieren dynamischer Daten","author":[{"first_name":"Simon","full_name":"Nachtigall, Simon","last_name":"Nachtigall"}],"date_created":"2017-12-19T09:59:32Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","citation":{"ieee":"S. Nachtigall, <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","chicago":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","ama":"Nachtigall S. <i>Sortieren dynamischer Daten</i>. Universität Paderborn; 2017.","mla":"Nachtigall, Simon. <i>Sortieren dynamischer Daten</i>. Universität Paderborn, 2017.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }","short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","apa":"Nachtigall, S. (2017). <i>Sortieren dynamischer Daten</i>. Universität Paderborn."},"year":"2017","language":[{"iso":"ger"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1073","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"bachelorsthesis"},{"author":[{"full_name":"Pukrop, Simon","last_name":"Pukrop","first_name":"Simon"}],"date_created":"2017-12-19T10:00:25Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Robuste Optimierung in Congestion Games","citation":{"ieee":"S. Pukrop, <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","chicago":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","ama":"Pukrop S. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn; 2017.","apa":"Pukrop, S. (2017). <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn.","mla":"Pukrop, Simon. <i>Robuste Optimierung in Congestion Games</i>. Universität Paderborn, 2017.","bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }","short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017."},"year":"2017","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1074","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"type":"mastersthesis","status":"public","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1080","citation":{"ama":"Bürmann J. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn; 2017.","chicago":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","ieee":"J. Bürmann, <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017.","apa":"Bürmann, J. (2017). <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn.","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017.","bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","mla":"Bürmann, Jan. <i>Complexity of Signalling in Routing Games under Uncertainty</i>. Universität Paderborn, 2017."},"year":"2017","date_created":"2017-12-19T10:07:35Z","supervisor":[{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"author":[{"first_name":"Jan","full_name":"Bürmann, Jan","last_name":"Bürmann"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:50Z","title":"Complexity of Signalling in Routing Games under Uncertainty"},{"year":"2017","citation":{"ama":"Vijayalakshmi VR. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn; 2017.","ieee":"V. R. Vijayalakshmi, <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn, 2017.","mla":"Vijayalakshmi, Vipin Ravindran. <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. 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} }","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","apa":"Vijayalakshmi, V. R. (2017). <i>Bounding the Inefficiency of Equilibria in Congestion Games under Taxation</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:50:51Z","publisher":"Universität Paderborn","author":[{"last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran"}],"supervisor":[{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"date_created":"2017-12-19T10:08:44Z","title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1081","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}]},{"publication":"Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","type":"conference","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."}],"status":"public","file":[{"file_size":1576363,"file_id":"5230","file_name":"Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf","access_level":"closed","date_updated":"2018-10-31T17:01:09Z","date_created":"2018-10-31T17:01:09Z","creator":"feldi","success":1,"relation":"main_file","content_type":"application/pdf"}],"_id":"1094","department":[{"_id":"63"},{"_id":"541"},{"_id":"276"}],"user_id":"14052","series_title":"LNCS","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-10-31T17:01:09Z","has_accepted_license":"1","year":"2017","page":"462-467","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.","mla":"Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 2017, pp. 462–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>.","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={<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>}, 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} }","apa":"Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., &#38; Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i> (pp. 462–467). <a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">https://doi.org/10.1007/978-3-319-59144-5_32</a>","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: <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>. LNCS. ; 2017:462-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">10.1007/978-3-319-59144-5_32</a>","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 <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 2017, pp. 462–467.","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 <i>Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)</i>, 462–67. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59144-5_32\">https://doi.org/10.1007/978-3-319-59144-5_32</a>."},"date_updated":"2022-01-06T06:50:53Z","date_created":"2018-01-05T08:37:52Z","author":[{"first_name":"Matthias","id":"14052","full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto"},{"first_name":"Thomas","last_name":"John","full_name":"John, Thomas","id":"3952"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"},{"id":"22546","full_name":"Hemsen, Paul","last_name":"Hemsen","first_name":"Paul"},{"full_name":"Klingsieck, Katrin","last_name":"Klingsieck","first_name":"Katrin"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"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"},{"type":"conference","publication":"Proceedings of the 25th European Conference on Information Systems (ECIS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":485333,"access_level":"closed","file_name":"TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf","file_id":"5232","date_updated":"2018-10-31T17:02:07Z","date_created":"2018-10-31T17:02:07Z","creator":"feldi"}],"status":"public","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. "}],"user_id":"14052","department":[{"_id":"63"},{"_id":"541"},{"_id":"178"},{"_id":"185"}],"_id":"1095","language":[{"iso":"eng"}],"file_date_updated":"2018-10-31T17:02:07Z","ddc":["000"],"has_accepted_license":"1","citation":{"apa":"John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., &#38; Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i> (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} }","mla":"John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 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.","ieee":"T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2017, pp. 2970–2979.","chicago":"John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>, 2970–79, 2017.","ama":"John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: <i>Proceedings of the 25th European Conference on Information Systems (ECIS)</i>. ; 2017:2970-2979."},"page":"2970-2979","year":"2017","author":[{"first_name":"Thomas","id":"3952","full_name":"John, Thomas","last_name":"John"},{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"id":"22546","full_name":"Hemsen, Paul","last_name":"Hemsen","first_name":"Paul"},{"last_name":"Klingsieck","full_name":"Klingsieck, Katrin","first_name":"Katrin"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"},{"first_name":"Mike","last_name":"Langendorf","full_name":"Langendorf, Mike"}],"date_created":"2018-01-05T08:39:41Z","oa":"1","date_updated":"2022-01-06T06:50:53Z","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2017_rip/46","open_access":"1"}],"title":"Towards a Lean Approach for Gamifying Education"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T10:45:57Z","creator":"florida","date_updated":"2018-03-21T10:45:57Z","file_id":"1525","file_name":"200-thesis.pdf","access_level":"closed","file_size":880390}],"status":"public","type":"dissertation","ddc":["040"],"file_date_updated":"2018-03-21T10:45:57Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"200","user_id":"15415","department":[{"_id":"63"},{"_id":"541"}],"year":"2016","citation":{"apa":"Drees, M. (2016). <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. 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} }","mla":"Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016.","short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016.","ama":"Drees M. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn; 2016.","chicago":"Drees, Maximilian. <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016.","ieee":"M. Drees, <i>Existence and Properties of Pure Nash Equilibria in Budget Games</i>. Universität Paderborn, 2016."},"has_accepted_license":"1","related_material":{"link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915","relation":"confirmation"}]},"title":"Existence and Properties of Pure Nash Equilibria in Budget Games","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:18Z","date_created":"2017-10-17T12:41:31Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"}],"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}]},{"status":"public","type":"mastersthesis","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"210","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ama":"Leder L. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn; 2016.","chicago":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","ieee":"L. Leder, <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016.","apa":"Leder, L. (2016). <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }","short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","mla":"Leder, Lennart. <i>Congestion Games with Mixed Objectives</i>. Universität Paderborn, 2016."},"year":"2016","title":"Congestion Games with Mixed Objectives","author":[{"full_name":"Leder, Lennart","last_name":"Leder","first_name":"Lennart"}],"supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_created":"2017-10-17T12:41:33Z","date_updated":"2022-01-06T06:54:42Z","publisher":"Universität Paderborn"}]