[{"date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"author":[{"first_name":"Jérôme","last_name":"Kempf","full_name":"Kempf, Jérôme"}],"date_created":"2018-03-02T13:51:14Z","title":"Learning deterministic bandit behaviour form compositions","year":"2018","citation":{"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.","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} }","short":"J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018.","mla":"Kempf, Jérôme. <i>Learning Deterministic Bandit Behaviour Form Compositions</i>. Universität Paderborn, 2018."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"1188","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"type":"bachelorsthesis","status":"public"},{"place":"Cham","year":"2018","citation":{"short":"B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Cham, 2018.","bibtex":"@inbook{Feldkord_Malatyali_Meyer auf der Heide_2018, place={Cham}, title={A Dynamic Distributed Data Structure for Top-k and k-Select Queries}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>}, booktitle={Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}, author={Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2018} }","mla":"Feldkord, Björn, et al. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>.","apa":"Feldkord, B., Malatyali, M., &#38; Meyer auf der Heide, F. (2018). A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>","ama":"Feldkord B, Malatyali M, Meyer auf der Heide F. A Dynamic Distributed Data Structure for Top-k and k-Select Queries. In: <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">10.1007/978-3-319-98355-4_18</a>","ieee":"B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Dynamic Distributed Data Structure for Top-k and k-Select Queries,” in <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>, Cham, 2018.","chicago":"Feldkord, Björn, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Dynamic Distributed Data Structure for Top-k and k-Select Queries.” In <i>Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98355-4_18\">https://doi.org/10.1007/978-3-319-98355-4_18</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319125671","9783319125688"]},"title":"A Dynamic Distributed Data Structure for Top-k and k-Select Queries","doi":"10.1007/978-3-319-98355-4_18","date_updated":"2022-01-06T06:52:50Z","author":[{"last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn","first_name":"Björn"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-03T07:04:59Z","status":"public","type":"book_chapter","publication":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","language":[{"iso":"eng"}],"_id":"16392","user_id":"15415","department":[{"_id":"63"}]},{"language":[{"iso":"eng"}],"ddc":["000"],"publication":"Journal of Combinatorial Optimization","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"5225","access_level":"closed","file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","file_size":561187,"creator":"feldi","date_created":"2018-10-31T16:56:13Z","date_updated":"2018-10-31T16:56:13Z"}],"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."}],"date_created":"2018-03-18T11:12:49Z","publisher":"Springer Nature","title":"Pure Nash equilibria in restricted budget games","year":"2018","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"1369","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2018-10-31T16:56:13Z","type":"journal_article","status":"public","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T06:51:42Z","doi":"10.1007/s10878-018-0269-7","has_accepted_license":"1","publication_identifier":{"issn":["1382-6905","1573-2886"]},"publication_status":"epub_ahead","citation":{"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>.","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>","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} }"}},{"title":"Local Strategies for Swarm Formations on a Grid","doi":"10.17619/UNIPB/1-271","publisher":"Universität Paderborn","date_updated":"2024-07-12T12:05:00Z","date_created":"2018-03-13T10:26:16Z","author":[{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"year":"2018","citation":{"ieee":"D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018.","chicago":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>.","ama":"Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>","apa":"Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-271\">https://doi.org/10.17619/UNIPB/1-271</a>","mla":"Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>.","bibtex":"@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-271\">10.17619/UNIPB/1-271</a>}, publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }","short":"D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn, 2018."},"publication_identifier":{"isbn":["978-3-942647-99-1"]},"related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-271"}]},"language":[{"iso":"eng"}],"_id":"1209","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"26"}],"user_id":"1112","abstract":[{"text":"My dissertation deals with the Gathering problem for swarms of n point-shaped robots on a grid, in which all robots of the swarm are supposed to gather at a previously undefined point. Special attention is paid to the strong limitation of robot capabilities. These include in particular the lack of global control, a global compass, global visibility and (global) communication skills. Furthermore, all robots are identical. The robots are given only local abilities. This includes a constant range of vision. The robots all work completely synchronously. In this work we present and analyze three different Gathering strategies in different robot models. We formally prove correctness and total running time: Chapter 4 focuses on minimizing the available robot capabilities. The underlying strategy completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the aim is to optimize the total running time under using only local robot capabilities: We additionally allow a constant-sized memory and a constant number of locally visible statuses (lights, flags). For the strategies of both chapters we show an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we additionally restrict connectivity and vision to an initially given chain connectivity in Chapter 6, where two chain neighbors must have a distance of 1 from each other. A robot can only see and interact with a constant number of its direct chain neighbors.","lang":"eng"}],"status":"public","type":"dissertation"},{"doi":"10.17619/UNIPB/1-252","title":"Parallel fixed parameter tractable problems","author":[{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"}],"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-09-21T13:52:09Z","date_updated":"2022-01-06T06:54:07Z","citation":{"mla":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>.","bibtex":"@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter tractable problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>}, author={Li, Shouwei}, year={2017} }","short":"S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn, 2017.","apa":"Li, S. (2017). <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>","ama":"Li S. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-252\">10.17619/UNIPB/1-252</a>","chicago":"Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-252\">https://doi.org/10.17619/UNIPB/1-252</a>.","ieee":"S. Li, <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn, 2017."},"year":"2017","place":"Universität Paderborn","related_material":{"link":[{"relation":"confirmation","url":"10.17619/UNIPB/1-252 "}]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19604","status":"public","type":"dissertation"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-11-13T13:16:30Z","ddc":["000"],"user_id":"14052","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"2851","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-13T13:16:30Z","date_created":"2018-11-13T13:16:30Z","creator":"feldi","file_size":257103,"file_name":"Markarian2018_Chapter_LeasingWithUncertainty.pdf","access_level":"closed","file_id":"5537"}],"status":"public","type":"conference","publication":"International Conference on Operations Research (OR)","doi":"10.1007/978-3-319-89920-6_57","conference":{"end_date":"Sept 8, 2017","location":"Berlin","start_date":"Sept 6, 2017"},"title":"Leasing with Uncertainty","date_created":"2018-05-24T08:44:43Z","author":[{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"}],"date_updated":"2022-01-06T06:58:08Z","citation":{"ama":"Markarian C. Leasing with Uncertainty. In: <i>International Conference on Operations Research (OR)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>","ieee":"C. Markarian, “Leasing with Uncertainty,” in <i>International Conference on Operations Research (OR)</i>, Berlin, 2017.","chicago":"Markarian, Christine. “Leasing with Uncertainty.” In <i>International Conference on Operations Research (OR)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>.","bibtex":"@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>}, booktitle={International Conference on Operations Research (OR)}, author={Markarian, Christine}, year={2017} }","mla":"Markarian, Christine. “Leasing with Uncertainty.” <i>International Conference on Operations Research (OR)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">10.1007/978-3-319-89920-6_57</a>.","short":"C. Markarian, in: International Conference on Operations Research (OR), 2017.","apa":"Markarian, C. (2017). Leasing with Uncertainty. In <i>International Conference on Operations Research (OR)</i>. Berlin. <a href=\"https://doi.org/10.1007/978-3-319-89920-6_57\">https://doi.org/10.1007/978-3-319-89920-6_57</a>"},"year":"2017","has_accepted_license":"1"},{"author":[{"full_name":"Khaluf, Yara","last_name":"Khaluf","first_name":"Yara"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"last_name":"Simoens","full_name":"Simoens, Pieter","first_name":"Pieter"},{"first_name":"Andreagiovanni","full_name":"Reina, Andreagiovanni","last_name":"Reina"}],"date_created":"2021-09-14T12:41:58Z","date_updated":"2022-01-06T06:56:19Z","doi":"10.1007/978-3-319-59930-4_12","title":"Scheduling Access to Shared Space in Multi-robot Systems","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"citation":{"mla":"Khaluf, Yara, et al. “Scheduling Access to Shared Space in Multi-Robot Systems.” <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","short":"Y. Khaluf, C. Markarian, P. Simoens, A. Reina, in: International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017), Cham, 2017.","bibtex":"@inproceedings{Khaluf_Markarian_Simoens_Reina_2017, place={Cham}, title={Scheduling Access to Shared Space in Multi-robot Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>}, booktitle={International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}, author={Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}, year={2017} }","apa":"Khaluf, Y., Markarian, C., Simoens, P., &#38; Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>","ieee":"Y. Khaluf, C. Markarian, P. Simoens, and A. Reina, “Scheduling Access to Shared Space in Multi-robot Systems,” 2017, doi: <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>.","chicago":"Khaluf, Yara, Christine Markarian, Pieter Simoens, and Andreagiovanni Reina. “Scheduling Access to Shared Space in Multi-Robot Systems.” In <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">https://doi.org/10.1007/978-3-319-59930-4_12</a>.","ama":"Khaluf Y, Markarian C, Simoens P, Reina A. Scheduling Access to Shared Space in Multi-robot Systems. In: <i>International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-59930-4_12\">10.1007/978-3-319-59930-4_12</a>"},"place":"Cham","year":"2017","user_id":"15415","department":[{"_id":"63"}],"_id":"24398","language":[{"iso":"eng"}],"type":"conference","publication":"International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)","status":"public","abstract":[{"text":"Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.","lang":"eng"}]},{"publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","abstract":[{"lang":"eng","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."}],"file":[{"access_level":"closed","file_name":"112-FeldottoLederSkopalik2017.pdf","file_id":"1566","file_size":264089,"date_created":"2018-03-21T13:05:37Z","creator":"florida","date_updated":"2018-03-21T13:05:37Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"external_id":{"arxiv":["1701.07304"]},"ddc":["040"],"year":"2017","date_created":"2017-10-17T12:41:13Z","title":"Congestion Games with Complementarities","type":"conference","status":"public","_id":"112","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"series_title":"LNCS","user_id":"14052","file_date_updated":"2018-03-21T13:05:37Z","has_accepted_license":"1","page":"222--233","citation":{"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} }","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","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>.","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>","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>"},"date_updated":"2022-01-06T06:50:58Z","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"doi":"10.1007/978-3-319-57586-5_19"},{"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-10-31T17:01:32Z","date_created":"2018-10-31T17:01:32Z","creator":"feldi","file_size":279055,"access_level":"closed","file_id":"5231","file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.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":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-10-31T17:01:32Z","has_accepted_license":"1","citation":{"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>.","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>","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>.","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.","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>"},"author":[{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","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","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:50:59Z","doi":"10.1007/978-3-319-71924-5_14"},{"status":"public","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","type":"conference","keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"extern":"1","language":[{"iso":"eng"}],"_id":"17652","department":[{"_id":"63"},{"_id":"541"}],"series_title":"Lecture Notes in Computer Science","user_id":"83983","year":"2017","place":"Cham","page":"3-17","citation":{"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.","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>.","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>","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.","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} }","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>.","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>"},"publication_identifier":{"isbn":["978-3-319-71150-8"]},"title":"Filtering Undesirable Flows in Networks","doi":"10.1007/978-3-319-71150-8_1","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","author":[{"full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"Stojan","full_name":"Trajanovski, Stojan","last_name":"Trajanovski"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"last_name":"de Laat","full_name":"de Laat, Cees","first_name":"Cees"}],"date_created":"2020-08-06T15:19:48Z"},{"date_updated":"2022-01-06T06:53:16Z","publisher":"Springer","date_created":"2020-08-06T15:20:09Z","author":[{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"full_name":"de Weerdt, M.M.","last_name":"de Weerdt","first_name":"M.M."}],"title":"Reciprocation Effort Games","year":"2017","citation":{"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.","ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 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.","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.","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."},"_id":"17653","department":[{"_id":"63"},{"_id":"541"}],"series_title":"CCIS","user_id":"83983","keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"language":[{"iso":"eng"}],"extern":"1","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","type":"conference","status":"public"},{"citation":{"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.","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.","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.","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."},"year":"2017","title":"Competition between Cooperative Projects","author":[{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"full_name":"de Weerdt, M.M.","last_name":"de Weerdt","first_name":"M.M."}],"date_created":"2020-08-06T15:20:19Z","publisher":"Springer","date_updated":"2022-01-06T06:53:16Z","status":"public","type":"conference","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","language":[{"iso":"eng"}],"extern":"1","keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"series_title":"CCIS","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17654"},{"status":"public","abstract":[{"text":"We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n  In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved.","lang":"eng"}],"publication":"arXiv:1702.03400","type":"preprint","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"17811","citation":{"ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. <i>arXiv:170203400</i>. 2017.","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017.","ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” <i>arXiv:1702.03400</i>. 2017.","apa":"Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. <i>ArXiv:1702.03400</i>.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).","mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017.","bibtex":"@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }"},"year":"2017","title":"Gathering Anonymous, Oblivious Robots on a Grid","date_created":"2020-08-11T13:48:38Z","author":[{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:53:20Z"},{"user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"79","file_date_updated":"2018-11-02T14:59:22Z","type":"conference","status":"public","author":[{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"}],"volume":10787,"date_updated":"2022-01-06T07:03:47Z","doi":"10.1007/978-3-319-89441-6","has_accepted_license":"1","citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In: <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>. Vol 10787. Lecture Notes in Computer Science. Springer; 2017:207-222. doi:<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” In <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, 10787:207–22. Lecture Notes in Computer Science. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-89441-6\">https://doi.org/10.1007/978-3-319-89441-6</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times,” in <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2017, vol. 10787, pp. 207–222.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, series={Lecture Notes in Computer Science}, title={Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times}, volume={10787}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={207–222}, collection={Lecture Notes in Computer Science} }","mla":"Mäcker, Alexander, et al. “Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.” <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i>, vol. 10787, Springer, 2017, pp. 207–22, doi:<a href=\"https://doi.org/10.1007/978-3-319-89441-6\">10.1007/978-3-319-89441-6</a>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 207–222.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017). Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times. In <i>Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)</i> (Vol. 10787, pp. 207–222). Springer. <a href=\"https://doi.org/10.1007/978-3-319-89441-6\">https://doi.org/10.1007/978-3-319-89441-6</a>"},"page":"207-222","intvolume":"     10787","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)","file":[{"file_size":380629,"access_level":"closed","file_name":"Non-clairvoyantSchedulingToMin.pdf","file_id":"5289","date_updated":"2018-11-02T14:59:22Z","date_created":"2018-11-02T14:59:22Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Consider a problem in which $n$ jobs that are classified into $k$ types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the maximum flow time.The machine requires a setup taking $s$ time units whenever it switches from processing jobs of one type to jobs of a different type.We consider the problem as an online problem where each job is only known to the scheduler as soon as it arrives and where the processing time of a job only becomes known upon its completion (non-clairvoyance).We are interested in the potential of simple ``greedy-like'' algorithms.We analyze a modification of the FIFO strategy and show its competitiveness to be $\\Theta(\\sqrt{n})$, which is optimal for the considered class of algorithms.For $k=2$ types it achieves a constant competitiveness.Our main insight is obtained by an analysis of the smoothed competitiveness.If processing times $p_j$ are independently perturbed to $\\hat p_j = (1+X_j)p_j$, we obtain a competitiveness of $O(\\sigma^{-2} \\log^2 n)$ when $X_j$ is drawn from a uniform or a (truncated) normal distribution with standard deviation $\\sigma$.The result proves that bad instances are fragile and ``practically'' one might expect a much better performance than given by the $\\Omega(\\sqrt{n})$-bound."}],"date_created":"2017-10-17T12:41:06Z","publisher":"Springer","title":"Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times","year":"2017"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:07:35Z","creator":"ups","date_updated":"2018-11-02T15:07:35Z","file_id":"5294","file_name":"Modular-WidthAnAuxiliaryParame.pdf","access_level":"closed","file_size":238276}],"status":"public","abstract":[{"lang":"eng","text":"Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter."}],"type":"conference","publication":"Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:07:35Z","ddc":["000"],"user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"82","citation":{"apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i> (pp. 139–150). <a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">https://doi.org/10.1007/978-3-319-59605-1_13</a>","mla":"Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 2017, pp. 139–50, doi:<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017, series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>}, booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150}, collection={LNCS} }","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In: <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>. LNCS. ; 2017:139-150. doi:<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 2017, pp. 139–150.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” In <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 139–50. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">https://doi.org/10.1007/978-3-319-59605-1_13</a>."},"page":"139-150","year":"2017","has_accepted_license":"1","doi":"10.1007/978-3-319-59605-1_13","title":"Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity","date_created":"2017-10-17T12:41:07Z","author":[{"full_name":"Abu-Khzam, Faisal N.","last_name":"Abu-Khzam","first_name":"Faisal N."},{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"date_updated":"2022-01-06T07:03:52Z"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T13:17:33Z","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"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"59","user_id":"477","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)."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T13:17:33Z","creator":"florida","date_updated":"2018-03-21T13:17:33Z","access_level":"closed","file_id":"1578","file_name":"59-progress.pdf","file_size":784867}],"status":"public","type":"conference","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","doi":"10.1145/3087556.3087578","date_updated":"2022-01-06T07:02:46Z","author":[{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:41:02Z","year":"2017","citation":{"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>","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>.","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>","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>.","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."},"page":"123--132","has_accepted_license":"1"},{"has_accepted_license":"1","page":"17 - 31","citation":{"chicago":"Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>.","ieee":"B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.","ama":"Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>","bibtex":"@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }","short":"B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.","mla":"Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>.","apa":"Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>"},"year":"2017","date_created":"2017-10-17T12:41:05Z","author":[{"full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord","first_name":"Björn"},{"full_name":"Markarian, Christine","id":"37612","last_name":"Markarian","first_name":"Christine"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:03:26Z","doi":"10.1007/978-3-319-71147-8_2","title":"Price Fluctuations in Online Leasing","publication":"Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":287315,"file_id":"5293","access_level":"closed","file_name":"PriceFluctuationInOnlineLeasin.pdf","date_updated":"2018-11-02T15:06:13Z","date_created":"2018-11-02T15:06:13Z","creator":"ups"}],"department":[{"_id":"63"}],"user_id":"477","_id":"70","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:06:13Z","ddc":["000"]},{"citation":{"ama":"Podlipyan P. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>","ieee":"P. Podlipyan, <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017.","chicago":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>.","mla":"Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>.","short":"P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität Paderborn, 2017.","bibtex":"@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering Problem}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-230\">10.17619/UNIPB/1-230</a>}, publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }","apa":"Podlipyan, P. (2017). <i>Local Algorithms for the Continuous Gathering Problem</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-230\">https://doi.org/10.17619/UNIPB/1-230</a>"},"year":"2017","related_material":{"link":[{"relation":"confirmation","url":"https://doi.org/10.17619/UNIPB/1-230"}]},"doi":"10.17619/UNIPB/1-230","title":"Local Algorithms for the Continuous Gathering Problem","date_created":"2017-11-14T14:13:21Z","author":[{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"supervisor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"703"},{"status":"public","file":[{"file_size":1491627,"file_id":"5673","access_level":"closed","file_name":"thesisStable.pdf","date_updated":"2018-11-14T15:18:37Z","date_created":"2018-11-14T15:18:37Z","creator":"feldi","success":1,"relation":"main_file","content_type":"application/pdf"}],"type":"dissertation","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-14T15:18:37Z","_id":"704","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"14052","year":"2017","citation":{"ama":"Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>","ieee":"S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017.","chicago":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>.","mla":"Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>.","bibtex":"@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-231\">10.17619/UNIPB/1-231</a>}, publisher={Universität Paderborn}, author={Riechers, Sören}, year={2017} }","short":"S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.","apa":"Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-231\">https://doi.org/10.17619/UNIPB/1-231</a>"},"has_accepted_license":"1","title":"Scheduling with Scarce Resources","doi":"10.17619/UNIPB/1-231","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:27Z","author":[{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"}],"date_created":"2017-11-15T07:51:07Z","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"ddc":["040"],"language":[{"iso":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":608614,"file_id":"1210","access_level":"closed","file_name":"706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf","date_updated":"2018-03-14T12:21:34Z","creator":"florida","date_created":"2018-03-14T12:21:34Z"}],"publication":"Journal of Combinatorial Optimization","title":"Cost-efficient Scheduling on Machines from the Cloud","publisher":"Springer","date_created":"2017-11-15T10:21:34Z","year":"2017","issue":"4","file_date_updated":"2018-03-14T12:21:34Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"706","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","doi":"10.1007/s10878-017-0198-x","date_updated":"2022-01-06T07:03:27Z","author":[{"full_name":"Mäcker, Alexander","id":"13536","last_name":"Mäcker","first_name":"Alexander"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"volume":36,"citation":{"bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1168–1194. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2017): 1168–94. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1168–1194, 2017.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>. 2017;36(4):1168-1194. doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>"},"intvolume":"        36","page":"1168-1194","has_accepted_license":"1"}]