[{"intvolume":"         2","page":"1:1-1:16","citation":{"apa":"Polevoy, G., Smorodinsky, R., &#38; Tennenholtz, M. (2014). Signaling Competition and Social Welfare. <i>ACM Trans. Econ. Comput.</i>, <i>2</i>(1), 1:1-1:16. <a href=\"https://doi.org/10.1145/2560766\">https://doi.org/10.1145/2560766</a>","short":"G. Polevoy, R. Smorodinsky, M. Tennenholtz, ACM Trans. Econ. Comput. 2 (2014) 1:1-1:16.","bibtex":"@article{Polevoy_Smorodinsky_Tennenholtz_2014, title={Signaling Competition and Social Welfare}, volume={2}, DOI={<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>}, number={1}, journal={ACM Trans. Econ. Comput.}, publisher={ACM}, author={Polevoy, Gleb and Smorodinsky, Rann and Tennenholtz, Moshe}, year={2014}, pages={1:1-1:16} }","mla":"Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.” <i>ACM Trans. Econ. Comput.</i>, vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>.","chicago":"Polevoy, Gleb, Rann Smorodinsky, and Moshe Tennenholtz. “Signaling Competition and Social Welfare.” <i>ACM Trans. Econ. Comput.</i> 2, no. 1 (2014): 1:1-1:16. <a href=\"https://doi.org/10.1145/2560766\">https://doi.org/10.1145/2560766</a>.","ieee":"G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and Social Welfare,” <i>ACM Trans. Econ. Comput.</i>, vol. 2, no. 1, pp. 1:1-1:16, 2014.","ama":"Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare. <i>ACM Trans Econ Comput</i>. 2014;2(1):1:1-1:16. doi:<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>"},"publication_identifier":{"issn":["2167-8375"]},"doi":"10.1145/2560766","volume":2,"author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"},{"first_name":"Rann","full_name":"Smorodinsky, Rann","last_name":"Smorodinsky"},{"full_name":"Tennenholtz, Moshe","last_name":"Tennenholtz","first_name":"Moshe"}],"date_updated":"2022-01-06T06:53:16Z","status":"public","type":"journal_article","extern":"1","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","_id":"17662","year":"2014","issue":"1","title":"Signaling Competition and Social Welfare","date_created":"2020-08-06T15:21:55Z","publisher":"ACM","publication":"ACM Trans. Econ. Comput.","language":[{"iso":"eng"}],"keyword":["Competition","efficiency","equilibrium","market","social welfare"]},{"type":"dissertation","status":"public","_id":"19039","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12816"}]},"place":"Universität Paderborn","year":"2014","citation":{"ieee":"R. Petring, <i>Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn, 2014.","chicago":"Petring, Ralf. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn, 2014.","ama":"Petring R. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn; 2014.","short":"R. Petring, Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit, Universität Paderborn, 2014.","mla":"Petring, Ralf. <i>Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit</i>. 2014.","bibtex":"@book{Petring_2014, place={Universität Paderborn}, title={Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit}, author={Petring, Ralf}, year={2014} }","apa":"Petring, R. (2014). <i>Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:53:57Z","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-09-04T13:20:12Z","author":[{"full_name":"Petring, Ralf","last_name":"Petring","first_name":"Ralf"}],"title":"Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit"},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:25:10Z","_id":"451","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","series_title":"Lecture Notes in Computer Science","abstract":[{"lang":"eng","text":"We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to be shared between the tasks. We study strategic budget games, where the budget is shared proportionally. We also consider a variant in which the order of the strategic decisions influences the distribution of the budgets. The complexity of the optimal solution as well as existence, complexity and quality of equilibria are analysed. Finally, we show that the time an ordered budget game needs to convergence towards an equilibrium may be exponential."}],"editor":[{"full_name":"Lavi, Ron","last_name":"Lavi","first_name":"Ron"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1344","access_level":"closed","file_name":"451-DRS14.pdf","file_size":283266,"date_created":"2018-03-16T11:25:10Z","creator":"florida","date_updated":"2018-03-16T11:25:10Z"}],"publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","title":"Budget-restricted utility games with ordered strategic decisions","doi":"10.1007/978-3-662-44803-8_10","date_updated":"2022-01-06T07:01:07Z","date_created":"2017-10-17T12:42:20Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"last_name":"Riechers","full_name":"Riechers, Sören","first_name":"Sören"},{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"year":"2014","page":"110-121","citation":{"mla":"Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>.","bibtex":"@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes in Computer Science} }","short":"M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.","apa":"Drees, M., Riechers, S., &#38; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 110–121). <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>","chicago":"Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>.","ieee":"M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, pp. 110–121.","ama":"Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>"},"has_accepted_license":"1"},{"ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \\alpha > 0, if it decides to be a gateway. For both games and different ranges of \\alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics.","lang":"eng"}],"file":[{"date_updated":"2018-03-16T11:24:40Z","creator":"florida","date_created":"2018-03-16T11:24:40Z","file_size":84783,"file_name":"452-title_multilevel-sagt.pdf","access_level":"closed","file_id":"1343","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","title":"Brief Announcement: A Model for Multilevel Network Games","date_created":"2017-10-17T12:42:20Z","year":"2014","file_date_updated":"2018-03-16T11:24:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"452","user_id":"15415","series_title":"LNCS","department":[{"_id":"63"},{"_id":"541"}],"editor":[{"full_name":"Lavi, Ron","last_name":"Lavi","first_name":"Ron"}],"status":"public","type":"conference","date_updated":"2022-01-06T07:01:08Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"citation":{"ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, p. 294.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 294. LNCS, 2014.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294.","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (p. 294).","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.","mla":"Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, p. 294."},"page":"294","has_accepted_license":"1"},{"status":"public","file":[{"creator":"florida","date_created":"2018-03-16T11:24:11Z","date_updated":"2018-03-16T11:24:11Z","file_id":"1342","file_name":"453-WINE14FGS.pdf","access_level":"closed","file_size":324307,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\\Phi(\\sf s)$ of any outcome $\\sf s$ of a congestion game approximates the optimum potential value $\\Phi(\\sf s^*)$ by a factor $\\Psi_{\\mathcal{F}}$ which only depends on the set of cost/utility functions $\\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\\sf s$. The significance of this result is twofold. On the one hand it provides \\emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\\varepsilon)\\cdot\\Psi_{\\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions."}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","file_date_updated":"2018-03-16T11:24:11Z","ddc":["040"],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","series_title":"LNCS","_id":"453","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"page":"30-43","citation":{"apa":"Feldotto, M., Gairing, M., &#38; Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 30–43). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>","mla":"Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>.","bibtex":"@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander}, year={2014}, pages={30–43}, collection={LNCS} }","short":"M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.","chicago":"Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 30–43. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>.","ieee":"M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43.","ama":"Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:30-43. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>"},"year":"2014","has_accepted_license":"1","doi":"10.1007/978-3-319-13129-0_3","title":"Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria","author":[{"first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias"},{"first_name":"Martin","last_name":"Gairing","full_name":"Gairing, Martin"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:42:20Z","date_updated":"2022-01-06T07:01:09Z"},{"type":"conference","publication":"Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","abstract":[{"text":"We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions.","lang":"eng"}],"file":[{"file_name":"455-HKS14.pdf","file_id":"1341","access_level":"closed","file_size":512712,"creator":"florida","date_created":"2018-03-16T11:23:40Z","date_updated":"2018-03-16T11:23:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"455","user_id":"477","series_title":"LIPIcs","department":[{"_id":"541"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-16T11:23:40Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2014","citation":{"ama":"Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. LIPIcs. ; 2014:242-257. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>","chicago":"Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 242–57. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","ieee":"C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–257.","mla":"Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","short":"C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.","bibtex":"@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>}, booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs} }","apa":"Hansknecht, C., Klimm, M., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i> (pp. 242–257). <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>"},"page":"242 - 257","date_updated":"2022-01-06T07:01:09Z","author":[{"first_name":"Christoph","last_name":"Hansknecht","full_name":"Hansknecht, Christoph"},{"first_name":"Max","full_name":"Klimm, Max","last_name":"Klimm"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:20Z","title":"Approximate pure Nash equilibria in weighted congestion games","doi":"10.4230/LIPIcs.APPROX-RANDOM.2014.242"},{"status":"public","type":"conference","file_date_updated":"2018-03-16T11:22:57Z","_id":"456","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"541"},{"_id":"63"}],"series_title":"LNCS","user_id":"477","page":"480 - 485","citation":{"ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:480-485. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 480–85. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>.","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–485.","apa":"Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 480–485). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2014}, pages={480–485}, collection={LNCS} }","short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>."},"has_accepted_license":"1","doi":"10.1007/978-3-319-13129-0_43","date_updated":"2022-01-06T07:01:10Z","author":[{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"last_name":"Kotsialou","full_name":"Kotsialou, Grammateia","first_name":"Grammateia"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19]."}],"file":[{"date_created":"2018-03-16T11:22:57Z","creator":"florida","date_updated":"2018-03-16T11:22:57Z","file_id":"1340","file_name":"456-WINE14final.pdf","access_level":"closed","file_size":377378,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2014","title":"Approximate pure Nash equilibria in Social Context Congestion Games","date_created":"2017-10-17T12:42:21Z"},{"publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","type":"conference","abstract":[{"text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.","lang":"eng"}],"status":"public","file":[{"date_updated":"2018-03-16T11:21:54Z","creator":"florida","date_created":"2018-03-16T11:21:54Z","file_size":274496,"access_level":"closed","file_name":"459-SIROCCO2014.pdf","file_id":"1338","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"459","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"series_title":"LNCS","user_id":"477","ddc":["040"],"file_date_updated":"2018-03-16T11:21:54Z","has_accepted_license":"1","year":"2014","page":"1-13","citation":{"apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 1–13). <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>","short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>.","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13.","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>.","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. LNCS. ; 2014:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>"},"date_updated":"2022-01-06T07:01:14Z","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:21Z","title":"Algorithmic Aspects of Resource Management in the Cloud","doi":"10.1007/978-3-319-09620-9_1"},{"ddc":["040"],"file_date_updated":"2018-03-16T11:21:24Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"_id":"462","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"abstract":[{"text":"We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1337","file_name":"462-FS2014SIMULTECH.pdf","file_size":993721,"creator":"florida","date_created":"2018-03-16T11:21:24Z","date_updated":"2018-03-16T11:21:24Z"}],"status":"public","type":"conference","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)","title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games","doi":"10.5220/0005110406250630","date_updated":"2022-01-06T07:01:15Z","date_created":"2017-10-17T12:42:22Z","author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"year":"2014","citation":{"apa":"Feldotto, M., &#38; Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i> (pp. 625–630). <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>}, booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto, Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }","mla":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–30, doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>.","short":"M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–630.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 625–30, 2014. <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>.","ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>. ; 2014:625-630. doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>"},"page":"625-630","has_accepted_license":"1"},{"year":"2014","date_created":"2017-10-17T12:42:09Z","title":"Multilevel Network Games","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":161479,"file_name":"395-WINE2014ACJS.pdf","file_id":"1382","access_level":"closed","date_updated":"2018-03-20T06:59:20Z","date_created":"2018-03-20T06:59:20Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"We consider a multilevel network game, where nodes can improvetheir communication costs by connecting to a high-speed network.The n nodes are connected by a static network and each node can decideindividually to become a gateway to the high-speed network. The goalof a node v is to minimize its private costs, i.e., the sum (SUM-game) ormaximum (MAX-game) of communication distances from v to all othernodes plus a fixed price α > 0 if it decides to be a gateway. Between gatewaysthe communication distance is 0, and gateways also improve othernodes’ distances by behaving as shortcuts. For the SUM-game, we showthat for α ≤ n − 1, the price of anarchy is Θ (n/√α) and in this rangeequilibria always exist. In range α ∈ (n−1, n(n−1)) the price of anarchyis Θ(√α), and for α ≥ n(n − 1) it is constant. For the MAX-game, weshow that the price of anarchy is either Θ (1 + n/√α), for α ≥ 1, orelse 1. Given a graph with girth of at least 4α, equilibria always exist.Concerning the dynamics, both games are not potential games. For theSUM-game, we even show that it is not weakly acyclic."}],"language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","page":"435-440","citation":{"short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–40, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, year={2014}, pages={435–440}, collection={LNCS} }","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Multilevel Network Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 435–440). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:435-440. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">10.1007/978-3-319-13129-0_36</a>","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 435–440.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 435–40. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_36\">https://doi.org/10.1007/978-3-319-13129-0_36</a>."},"author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Jung","id":"37827","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:59:59Z","doi":"10.1007/978-3-319-13129-0_36","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"541"}],"user_id":"15415","series_title":"LNCS","_id":"395","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-20T06:59:20Z"},{"date_updated":"2022-01-06T07:00:20Z","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"doi":"10.1109/P2P.2014.6934300","has_accepted_license":"1","page":"1-10","citation":{"chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 1–10, 2014. <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>.","ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10.","ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>. ; 2014:1-10. doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>","mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i>, 2014, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>.","short":"M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={<a href=\"https://doi.org/10.1109/P2P.2014.6934300\">10.1109/P2P.2014.6934300</a>}, booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi, Kalman}, year={2014}, pages={1–10} }","apa":"Feldotto, M., Scheideler, C., &#38; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In <i>Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)</i> (pp. 1–10). <a href=\"https://doi.org/10.1109/P2P.2014.6934300\">https://doi.org/10.1109/P2P.2014.6934300</a>"},"_id":"412","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"user_id":"14052","file_date_updated":"2018-03-16T11:34:00Z","type":"conference","status":"public","date_created":"2017-10-17T12:42:12Z","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","year":"2014","external_id":{"arxiv":["1408.0395"]},"ddc":["040"],"publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)","abstract":[{"text":"In this paper we present and analyze HSkip+, a self-stabilizing overlay network for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization mechanism significantly outperforms the self-stabilization mechanism proposed for Skip+. Also, the nodes are now ordered according to their bandwidths and not according to their identifiers. Various other solutions have already been proposed for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing. In addition to HSkip+ being self-stabilizing, its performance is on par with the best previous bounds on the time and work for joining or leaving a network of peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation and congestion for routing messages is on par with the best previous bounds for such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical investigations are backed by simulations demonstrating that HSkip+ is indeed performing much better than Skip+ and working correctly under high churn rates.","lang":"eng"}],"file":[{"file_id":"1361","file_name":"412-FSG2014P2P.pdf","access_level":"closed","file_size":472321,"creator":"florida","date_created":"2018-03-16T11:34:00Z","date_updated":"2018-03-16T11:34:00Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"status":"public","file":[{"creator":"florida","date_created":"2018-03-16T11:31:29Z","date_updated":"2018-03-16T11:31:29Z","file_id":"1356","access_level":"closed","file_name":"431-Peter_Kling_PhDThesis_01.pdf","file_size":792106,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"In meiner Dissertation besch{\\\"a}ftige ich mich mit dem Entwurf und der Analyse energieeffizienter Schedulingalgorithmen, insbesondere f{\\\"u}r sogenannte Speed-Scaling Modelle. Diese stellen das theoretische Pendant von Techniken wie AMDs PowerNOW! und Intels SpeedStep dar, welche es erlauben die Geschwindigkeit von Prozessoren zur Laufzeit an die derzeitigen Bedingungen anzupassen. Theoretische Untersuchungen solcher Modelle sind auf eine Arbeit von Yao, Demers und Shenker (FOCS'95) zur{\\\"u}ckzuf{\\\"u}hren. Hier kombinieren die Autoren klassisches Deadline-Scheduling mit einem Prozessor der Speed-Scaling beherrscht. Es gilt Jobs verschiedener Gr{\\\"o}ße fristgerecht abzuarbeiten und die dabei verwendete Energie zu minimieren. Der Energieverbrauch des Prozessors wird durch eine konvexe Funktion $\\POW\\colon\\R_{\\geq0}\\to\\R_{\\geq0}$ modelliert, welche die Geschwindigkeit auf den Energieverbrauch abbildet.Meine Dissertation betrachtet verschiedene Varianten des urspr{\\\"u}nglichen Speed-Scaling Modells. Forschungsrelevante Ergebnisse sind in den Kapiteln 3 bis 6 zu finden und erstrecken sich {\\\"u}ber die im Folgenden beschriebenen Aspekte:- Kapitel 3 und 4 betrachten verschiedene \\emph{Price-Collecting} Varianten des Originalproblems. Hier d{\\\"u}rfen einzelne Deadlines verfehlt werden, sofern eine jobabh{\\\"a}ngige Strafe gezahlt wird. Ich entwerfe insbesondere Online-Algorithmen mit einer beweisbar guten Competitiveness. Dabei liefern meine Ergebnisse substantielle Verbesserungen bestehender Arbeiten und erweitern diese unter Anderem auf Szenarien mit mehreren Prozessoren.- In Kapitel 5 wird statt des klassischen Deadline-Schedulings eine Linearkombination der durchschnittlichen Antwortzeit und des Energieverbrauchs betrachtet. Die Frage, ob dieses Problem NP-schwer ist, stellt eine der zentralen Forschungsfragen in diesem Gebiet dar. F{\\\"u}r eine relaxierte Form dieser Frage entwerfe ich einen effizienter Algorithmus und beweise seine Optimalit{\\\"a}t.- Das letzte Kapitel betrachtet ein Modell, welches – auf den ersten Blick – nicht direkt zur Speed-Scaling Literatur z{\\\"a}hlt. Hier geht es stattdessen um ein allgemeines Resource-Constrained Scheduling, in dem sich die Prozessoren zusammen eine gemeinsame, beliebig aufteilbare Ressource teilen. Ich untersuche die Komplexit{\\\"a}t des Problems und entwerfe verschiedene Approximationsalgorithmen.","lang":"eng"}],"type":"dissertation","file_date_updated":"2018-03-16T11:31:29Z","ddc":["040"],"department":[{"_id":"63"}],"user_id":"477","_id":"431","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"bibtex":"@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität Paderborn}, author={Kling, Peter}, year={2014} }","short":"P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn, 2014.","mla":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","apa":"Kling, P. (2014). <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn.","ama":"Kling P. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn; 2014.","ieee":"P. Kling, <i>Energy-efficient Scheduling Algorithms</i>. Universität Paderborn, 2014.","chicago":"Kling, Peter. <i>Energy-Efficient Scheduling Algorithms</i>. Universität Paderborn, 2014."},"year":"2014","has_accepted_license":"1","title":"Energy-efficient Scheduling Algorithms","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-10-17T12:42:15Z","author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:00:52Z"},{"has_accepted_license":"1","year":"2014","page":"63--74","citation":{"ama":"Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In: <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>. LIPIcs. ; 2014:63--74. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>","chicago":"Antoniadis, Antonios, Neal Barcelo, Mario Consuegra, Peer Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 63--74. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>.","ieee":"A. Antoniadis <i>et al.</i>, “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,” in <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74.","apa":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., &#38; Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 63--74). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">https://doi.org/10.4230/LIPIcs.STACS.2014.63</a>","bibtex":"@inproceedings{Antoniadis_Barcelo_Consuegra_Kling_Nugent_Pruhs_Scquizzato_2014, series={LIPIcs}, title={Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>}, booktitle={Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peer and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele}, year={2014}, pages={63--74}, collection={LIPIcs} }","short":"A. Antoniadis, N. Barcelo, M. Consuegra, P. Kling, M. Nugent, K. Pruhs, M. Scquizzato, in: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.","mla":"Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” <i>Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2014, pp. 63--74, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2014.63\">10.4230/LIPIcs.STACS.2014.63</a>."},"date_updated":"2022-01-06T07:00:58Z","date_created":"2017-10-17T12:42:16Z","author":[{"last_name":"Antoniadis","full_name":"Antoniadis, Antonios","first_name":"Antonios"},{"first_name":"Neal","full_name":"Barcelo, Neal","last_name":"Barcelo"},{"first_name":"Mario","last_name":"Consuegra","full_name":"Consuegra, Mario"},{"first_name":"Peer","full_name":"Kling, Peer","last_name":"Kling"},{"first_name":"Michael","last_name":"Nugent","full_name":"Nugent, Michael"},{"first_name":"Kirk","last_name":"Pruhs","full_name":"Pruhs, Kirk"},{"full_name":"Scquizzato, Michele","last_name":"Scquizzato","first_name":"Michele"}],"title":"Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules","doi":"10.4230/LIPIcs.STACS.2014.63","publication":"Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)","type":"conference","abstract":[{"text":"We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds.Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:30:23Z","creator":"florida","date_created":"2018-03-16T11:30:23Z","file_size":525851,"file_name":"435-Kling_C2_STACS2014.pdf","file_id":"1354","access_level":"closed"}],"_id":"435","project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:30:23Z"},{"date_created":"2020-04-27T10:31:57Z","volume":8243,"date_updated":"2022-01-06T06:52:58Z","publisher":"Springer","doi":"10.1007/978-3-642-45346-5","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642453458","9783642453465"]},"citation":{"ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013</i>. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>","chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013</i>. Vol. 8243. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>.","ieee":"P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013</i>, vol. 8243. Berlin, Heidelberg: Springer, 2014.","apa":"Flocchini, P., Gao, J., Kranakis, E., &#38; Meyer auf der Heide, F. (Eds.). (2014). <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013</i> (Vol. 8243). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45346-5\">https://doi.org/10.1007/978-3-642-45346-5</a>","mla":"Flocchini, Paola, et al., editors. <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013</i>. Vol. 8243, Springer, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>.","bibtex":"@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5\">10.1007/978-3-642-45346-5</a>}, publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science} }","short":"P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Springer, Berlin, Heidelberg, 2014."},"intvolume":"      8243","year":"2014","place":"Berlin, Heidelberg","series_title":"Lecture Notes in Computer Science","user_id":"15415","department":[{"_id":"63"}],"_id":"16870","language":[{"iso":"eng"}],"type":"book_editor","status":"public","editor":[{"first_name":"Paola","full_name":"Flocchini, Paola","last_name":"Flocchini"},{"last_name":"Gao","full_name":"Gao, Jie","first_name":"Jie"},{"first_name":"Evangelos","full_name":"Kranakis, Evangelos","last_name":"Kranakis"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}]},{"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16394","citation":{"mla":"Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” <i>Lecture Notes in Computer Science</i>, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_17\">10.1007/978-3-319-14472-6_17</a>.","bibtex":"@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_17\">10.1007/978-3-319-14472-6_17</a>}, booktitle={Lecture Notes in Computer Science}, author={Lukovszki, Tamás and Meyer auf der Heide, Friedhelm}, year={2014} }","short":"T. Lukovszki, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Cham, 2014.","apa":"Lukovszki, T., &#38; Meyer auf der Heide, F. (2014). Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_17\">https://doi.org/10.1007/978-3-319-14472-6_17</a>","ama":"Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In: <i>Lecture Notes in Computer Science</i>. Cham; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_17\">10.1007/978-3-319-14472-6_17</a>","chicago":"Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” In <i>Lecture Notes in Computer Science</i>. Cham, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_17\">https://doi.org/10.1007/978-3-319-14472-6_17</a>.","ieee":"T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots,” in <i>Lecture Notes in Computer Science</i>, Cham, 2014."},"year":"2014","place":"Cham","publication_identifier":{"isbn":["9783319144719","9783319144726"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-319-14472-6_17","title":"Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots","author":[{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-03T07:58:53Z","date_updated":"2022-01-06T06:52:50Z"},{"_id":"16395","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Structural Information and Communication Complexity","status":"public","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-03T09:00:16Z","title":"Continuous Aggregation in Dynamic Ad-Hoc Networks","doi":"10.1007/978-3-319-09620-9_16","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319096193","9783319096209"]},"place":"Cham","year":"2014","citation":{"mla":"Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” <i>Structural Information and Communication Complexity</i>, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_16\">10.1007/978-3-319-09620-9_16</a>.","short":"S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Cham, 2014.","bibtex":"@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous Aggregation in Dynamic Ad-Hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_16\">10.1007/978-3-319-09620-9_16</a>}, booktitle={Structural Information and Communication Complexity}, author={Abshoff, Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }","apa":"Abshoff, S., &#38; Meyer auf der Heide, F. (2014). Continuous Aggregation in Dynamic Ad-Hoc Networks. In <i>Structural Information and Communication Complexity</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_16\">https://doi.org/10.1007/978-3-319-09620-9_16</a>","chicago":"Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” In <i>Structural Information and Communication Complexity</i>. Cham, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_16\">https://doi.org/10.1007/978-3-319-09620-9_16</a>.","ieee":"S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic Ad-Hoc Networks,” in <i>Structural Information and Communication Complexity</i>, Cham, 2014.","ama":"Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc Networks. In: <i>Structural Information and Communication Complexity</i>. Cham; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_16\">10.1007/978-3-319-09620-9_16</a>"}},{"citation":{"ieee":"B. Mertsching, M. Divband Soorati, and T. Kotthauser, “Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds,” <i>IEEE International Conference on Robotics and Biomimetics (ROBIO)</i>, pp. 661–667, 2013.","chicago":"Mertsching, Bärbel, Mohammad Divband Soorati, and Tobias Kotthauser. “Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds.” <i>IEEE International Conference on Robotics and Biomimetics (ROBIO)</i>, 2013, 661–67.","ama":"Mertsching B, Divband Soorati M, Kotthauser T. Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds. <i>IEEE International Conference on Robotics and Biomimetics (ROBIO)</i>. 2013:661-667.","apa":"Mertsching, B., Divband Soorati, M., &#38; Kotthauser, T. (2013). Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds. <i>IEEE International Conference on Robotics and Biomimetics (ROBIO)</i>, 661–667.","short":"B. Mertsching, M. Divband Soorati, T. Kotthauser, IEEE International Conference on Robotics and Biomimetics (ROBIO) (2013) 661–667.","mla":"Mertsching, Bärbel, et al. “Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds.” <i>IEEE International Conference on Robotics and Biomimetics (ROBIO)</i>, 2013, pp. 661–67.","bibtex":"@article{Mertsching_Divband Soorati_Kotthauser_2013, title={Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds}, journal={IEEE International Conference on Robotics and Biomimetics (ROBIO)}, author={Mertsching, Bärbel and Divband Soorati, Mohammad and Kotthauser, Tobias}, year={2013}, pages={661–667} }"},"page":"661-667","year":"2013","title":"Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds","author":[{"last_name":"Mertsching","full_name":"Mertsching, Bärbel","first_name":"Bärbel"},{"full_name":"Divband Soorati, Mohammad","last_name":"Divband Soorati","first_name":"Mohammad"},{"first_name":"Tobias","full_name":"Kotthauser, Tobias","last_name":"Kotthauser"}],"date_created":"2020-10-12T13:21:53Z","date_updated":"2022-01-06T06:54:17Z","status":"public","type":"journal_article","publication":"IEEE International Conference on Robotics and Biomimetics (ROBIO)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"19981"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20148","status":"public","publication":"Bulletin of Mathematical Biology","type":"journal_article","doi":"10.1007/s11538-013-9851-4 ","title":"Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning","volume":75,"author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Istvan","full_name":"Karsai, Istvan","last_name":"Karsai"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"}],"date_created":"2020-10-21T08:41:17Z","date_updated":"2022-01-06T06:54:20Z","page":"1181-1206","intvolume":"        75","citation":{"apa":"Hamann, H., Karsai, I., &#38; Schmickl, T. (2013). Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning. <i>Bulletin of Mathematical Biology</i>, <i>75</i>(7), 1181–1206. <a href=\"https://doi.org/10.1007/s11538-013-9851-4 \">https://doi.org/10.1007/s11538-013-9851-4 </a>","mla":"Hamann, Heiko, et al. “Time Delay Implies Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.” <i>Bulletin of Mathematical Biology</i>, vol. 75, no. 7, 2013, pp. 1181–206, doi:<a href=\"https://doi.org/10.1007/s11538-013-9851-4 \">10.1007/s11538-013-9851-4 </a>.","bibtex":"@article{Hamann_Karsai_Schmickl_2013, title={Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning}, volume={75}, DOI={<a href=\"https://doi.org/10.1007/s11538-013-9851-4 \">10.1007/s11538-013-9851-4 </a>}, number={7}, journal={Bulletin of Mathematical Biology}, author={Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas}, year={2013}, pages={1181–1206} }","short":"H. Hamann, I. Karsai, T. Schmickl, Bulletin of Mathematical Biology 75 (2013) 1181–1206.","ieee":"H. Hamann, I. Karsai, and T. Schmickl, “Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning,” <i>Bulletin of Mathematical Biology</i>, vol. 75, no. 7, pp. 1181–1206, 2013.","chicago":"Hamann, Heiko, Istvan Karsai, and Thomas Schmickl. “Time Delay Implies Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.” <i>Bulletin of Mathematical Biology</i> 75, no. 7 (2013): 1181–1206. <a href=\"https://doi.org/10.1007/s11538-013-9851-4 \">https://doi.org/10.1007/s11538-013-9851-4 </a>.","ama":"Hamann H, Karsai I, Schmickl T. Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning. <i>Bulletin of Mathematical Biology</i>. 2013;75(7):1181-1206. doi:<a href=\"https://doi.org/10.1007/s11538-013-9851-4 \">10.1007/s11538-013-9851-4 </a>"},"year":"2013","issue":"7"},{"citation":{"chicago":"Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Karl Crailsheim, Ronald Thenius, and Payam Zahadat. “Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems.” <i>Chaos, Solitons &#38; Fractals</i> 50 (2013): 100–114. <a href=\"https://doi.org/10.1016/j.chaos.2013.01.011\">https://doi.org/10.1016/j.chaos.2013.01.011</a>.","ieee":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and P. Zahadat, “Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems,” <i>Chaos, Solitons &#38; Fractals</i>, vol. 50, pp. 100–114, 2013.","ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K, Thenius R, Zahadat P. Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems. <i>Chaos, Solitons &#38; Fractals</i>. 2013;50:100-114. doi:<a href=\"https://doi.org/10.1016/j.chaos.2013.01.011\">10.1016/j.chaos.2013.01.011</a>","apa":"Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Thenius, R., &#38; Zahadat, P. (2013). Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems. <i>Chaos, Solitons &#38; Fractals</i>, <i>50</i>, 100–114. <a href=\"https://doi.org/10.1016/j.chaos.2013.01.011\">https://doi.org/10.1016/j.chaos.2013.01.011</a>","bibtex":"@article{Hamann_Schmickl_Stradner_Crailsheim_Thenius_Zahadat_2013, title={Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems}, volume={50}, DOI={<a href=\"https://doi.org/10.1016/j.chaos.2013.01.011\">10.1016/j.chaos.2013.01.011</a>}, journal={Chaos, Solitons &#38; Fractals}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Thenius, Ronald and Zahadat, Payam}, year={2013}, pages={100–114} }","short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, P. Zahadat, Chaos, Solitons &#38; Fractals 50 (2013) 100–114.","mla":"Hamann, Heiko, et al. “Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems.” <i>Chaos, Solitons &#38; Fractals</i>, vol. 50, 2013, pp. 100–14, doi:<a href=\"https://doi.org/10.1016/j.chaos.2013.01.011\">10.1016/j.chaos.2013.01.011</a>."},"page":"100-114","intvolume":"        50","year":"2013","author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Schmickl, Thomas","last_name":"Schmickl","first_name":"Thomas"},{"first_name":"Jürgen","last_name":"Stradner","full_name":"Stradner, Jürgen"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"},{"first_name":"Ronald","last_name":"Thenius","full_name":"Thenius, Ronald"},{"first_name":"Payam","last_name":"Zahadat","full_name":"Zahadat, Payam"}],"date_created":"2020-10-21T08:46:02Z","volume":50,"date_updated":"2022-01-06T06:54:20Z","doi":"10.1016/j.chaos.2013.01.011","title":"Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems","type":"journal_article","publication":"Chaos, Solitons & Fractals","status":"public","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20150","language":[{"iso":"eng"}]},{"volume":7835,"date_created":"2020-10-21T08:53:30Z","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"full_name":"Stradner, Jürgen","last_name":"Stradner","first_name":"Jürgen"},{"last_name":"Schwarzer","full_name":"Schwarzer, Christopher","first_name":"Christopher"},{"first_name":"Nico K.","full_name":"Michiels, Nico K.","last_name":"Michiels"},{"first_name":"Anna Isabel","last_name":"Esparcia-Alcazar","full_name":"Esparcia-Alcazar, Anna Isabel"}],"date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/978-3-642-37192-9_58","title":"Virtual Spatiality in Agent Controllers: Encoding Compartmentalization","page":"579-588","intvolume":"      7835","citation":{"bibtex":"@inproceedings{Hamann_Schmickl_Stradner_Schwarzer_Michiels_Esparcia-Alcazar_2013, title={Virtual Spatiality in Agent Controllers: Encoding Compartmentalization}, volume={7835}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-37192-9_58\">10.1007/978-3-642-37192-9_58</a>}, booktitle={Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)}, author={Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Schwarzer, Christopher and Michiels, Nico K. and Esparcia-Alcazar, Anna Isabel}, year={2013}, pages={579–588} }","short":"H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N.K. Michiels, A.I. Esparcia-Alcazar, in: Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013), 2013, pp. 579–588.","mla":"Hamann, Heiko, et al. “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization.” <i>Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)</i>, vol. 7835, 2013, pp. 579–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-37192-9_58\">10.1007/978-3-642-37192-9_58</a>.","apa":"Hamann, H., Schmickl, T., Stradner, J., Schwarzer, C., Michiels, N. K., &#38; Esparcia-Alcazar, A. I. (2013). Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In <i>Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)</i> (Vol. 7835, pp. 579–588). <a href=\"https://doi.org/10.1007/978-3-642-37192-9_58\">https://doi.org/10.1007/978-3-642-37192-9_58</a>","ieee":"H. Hamann, T. Schmickl, J. Stradner, C. Schwarzer, N. K. Michiels, and A. I. Esparcia-Alcazar, “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization,” in <i>Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)</i>, 2013, vol. 7835, pp. 579–588.","chicago":"Hamann, Heiko, Thomas Schmickl, Jürgen Stradner, Christopher Schwarzer, Nico K. Michiels, and Anna Isabel Esparcia-Alcazar. “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization.” In <i>Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)</i>, 7835:579–88, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37192-9_58\">https://doi.org/10.1007/978-3-642-37192-9_58</a>.","ama":"Hamann H, Schmickl T, Stradner J, Schwarzer C, Michiels NK, Esparcia-Alcazar AI. Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In: <i>Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)</i>. Vol 7835. ; 2013:579-588. doi:<a href=\"https://doi.org/10.1007/978-3-642-37192-9_58\">10.1007/978-3-642-37192-9_58</a>"},"year":"2013","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20151","language":[{"iso":"eng"}],"publication":"Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)","type":"conference","status":"public"}]