[{"title":"Network Creation Games: Think Global - Act Local","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T06:57:40Z","doi":"10.1007/978-3-662-48054-0_21","series_title":"LNCS","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy."}],"ddc":["040"],"user_id":"477","file_date_updated":"2018-03-21T09:27:12Z","publication":"Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Pascal","full_name":"Lenzner, Pascal","last_name":"Lenzner"}],"file":[{"date_created":"2018-03-21T09:27:12Z","file_name":"275-978-3-662-48054-0_21.pdf","access_level":"closed","file_id":"1472","creator":"florida","file_size":279995,"relation":"main_file","success":1,"date_updated":"2018-03-21T09:27:12Z","content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:45Z","status":"public","has_accepted_license":"1","_id":"275","page":"248--260","year":"2015","type":"conference","citation":{"chicago":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” In Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 248--260. LNCS, 2015. https://doi.org/10.1007/978-3-662-48054-0_21.","apa":"Cord-Landwehr, A., & Lenzner, P. (2015). Network Creation Games: Think Global - Act Local. In Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS) (pp. 248--260). https://doi.org/10.1007/978-3-662-48054-0_21","ama":"Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local. In: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS). LNCS. ; 2015:248--260. doi:10.1007/978-3-662-48054-0_21","mla":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260, doi:10.1007/978-3-662-48054-0_21.","bibtex":"@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network Creation Games: Think Global - Act Local}, DOI={10.1007/978-3-662-48054-0_21}, booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015}, pages={248--260}, collection={LNCS} }","short":"A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.","ieee":"A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260."}},{"title":"Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk","user_id":"14052","author":[{"last_name":"Kothe","full_name":"Kothe, Nils","first_name":"Nils"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"status":"public","date_created":"2017-10-17T12:41:46Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"277","date_updated":"2022-01-06T06:57:44Z","year":"2015","citation":{"short":"N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk, Universität Paderborn, 2015.","ieee":"N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015.","chicago":"Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015.","ama":"Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn; 2015.","apa":"Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn.","bibtex":"@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils}, year={2015} }","mla":"Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015."},"type":"bachelorsthesis","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"language":[{"iso":"ger"}]},{"intvolume":" 343","_id":"17425","date_updated":"2022-01-06T06:53:11Z","page":"65-78","year":"2015","citation":{"short":"J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.","ieee":"J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2015, vol. 343, pp. 65–78.","ama":"Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.","apa":"Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 343, 65–78.","chicago":"Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","mla":"Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 343, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 65–78.","bibtex":"@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn}, title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }"},"type":"conference","language":[{"iso":"eng"}],"place":"Paderborn","title":"Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme","user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","author":[{"last_name":"Berssenbrügge","first_name":"Jan ","full_name":"Berssenbrügge, Jan "},{"first_name":"Olga","full_name":"Wiederkehr, Olga","last_name":"Wiederkehr"},{"last_name":"Jähn","full_name":"Jähn, Claudius","first_name":"Claudius"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","volume":343,"date_created":"2020-07-28T09:49:42Z","status":"public"},{"title":"Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell","user_id":"15415","place":"Paderborn","volume":342,"status":"public","date_created":"2020-07-28T10:23:18Z","author":[{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Maria","full_name":"Gerges, Maria","last_name":"Gerges"},{"first_name":"Jan","full_name":"Berssenbrügge, Jan","last_name":"Berssenbrügge"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"intvolume":" 342","_id":"17427","date_updated":"2022-01-06T06:53:11Z","year":"2015","type":"conference","citation":{"short":"C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.","ieee":"C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2015, vol. 342, pp. 107–120.","ama":"Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.","apa":"Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342, 107–120.","chicago":"Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","bibtex":"@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn}, title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }","mla":"Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 107–20."},"page":"107-120","language":[{"iso":"eng"}]},{"place":"Paderborn","title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR","user_id":"15415","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","department":[{"_id":"63"},{"_id":"26"}],"edition":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","editor":[{"last_name":"Gausemeier","first_name":"Jürgen","full_name":"Gausemeier, Jürgen"},{"full_name":"Grafe, Michael","first_name":"Michael","last_name":"Grafe"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"volume":342,"status":"public","date_created":"2020-07-28T13:39:25Z","intvolume":" 342","_id":"17431","date_updated":"2022-01-06T06:53:12Z","citation":{"short":"J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., Augmented & Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR, 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015.","ieee":"J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR, 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung., vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","chicago":"Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung. Vol. 342. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.","apa":"Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2015). Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR (12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Vol. 342). Verlagsschriftenreihe des Heinz Nixdorf Instituts.","ama":"Gausemeier J, Grafe M, Meyer auf der Heide F, eds. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. Vol 342. 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015.","bibtex":"@book{Gausemeier_Grafe_Meyer auf der Heide_2015, place={Paderborn}, edition={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, title={Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR}, volume={342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, year={2015} }","mla":"Gausemeier, Jürgen, et al., editors. Augmented & Virtual Reality in Der Produktentstehung: Grundlagen, Methoden Und Werkzeuge; Interaktions- Und Visualisierungstechniken, Virtual Prototyping Intelligenter Technischer Systeme Mit AR/VR. 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015."},"type":"book_editor","year":"2015","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z","doi":"10.1109/TCC.2015.2487964","department":[{"_id":"63"},{"_id":"541"}],"publication_identifier":{"issn":["2168-7161"]},"title":"Inter-Datacenter Scheduling of Large Data Flows","citation":{"ieee":"R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.","short":"R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.","bibtex":"@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964}, number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R. and Polevoy, Gleb}, year={2015}, pages={1–1} }","mla":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1, doi:10.1109/TCC.2015.2487964.","chicago":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.","ama":"Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964","apa":"Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964"},"type":"journal_article","year":"2015","page":"1-1","_id":"17657","issue":"99","author":[{"last_name":"Cohen","full_name":"Cohen, R.","first_name":"R."},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"}],"publication":"Cloud Computing, IEEE Transactions on","keyword":["Approximation algorithms","Approximation methods","Bandwidth","Cloud computing","Routing","Schedules","Scheduling"],"volume":"PP","status":"public","date_created":"2020-08-06T15:20:58Z","extern":"1","abstract":[{"lang":"eng","text":"Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance."}],"user_id":"83983"},{"doi":"http://dx.doi.org/10.1016/j.dam.2015.05.013","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"title":"Bandwidth allocation in cellular networks with multiple interferences","publication_identifier":{"issn":["0166-218X"]},"department":[{"_id":"63"},{"_id":"541"}],"_id":"17658","intvolume":" 194","year":"2015","citation":{"bibtex":"@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in cellular networks with multiple interferences}, volume={194}, DOI={http://dx.doi.org/10.1016/j.dam.2015.05.013}, journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }","mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics , vol. 194, Elsevier, 2015, pp. 23–36, doi:http://dx.doi.org/10.1016/j.dam.2015.05.013.","apa":"Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics , 194, 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36. doi:http://dx.doi.org/10.1016/j.dam.2015.05.013","chicago":"Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics 194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.","ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” Discrete Applied Mathematics , vol. 194, pp. 23–36, 2015.","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015) 23–36."},"type":"journal_article","page":"23 - 36","user_id":"83983","extern":"1","abstract":[{"lang":"eng","text":"Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS. "}],"volume":194,"status":"public","date_created":"2020-08-06T15:21:15Z","author":[{"first_name":"Reuven","full_name":"Bar-Yehuda, Reuven","last_name":"Bar-Yehuda"},{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"first_name":"Dror","full_name":"Rawitz, Dror","last_name":"Rawitz"}],"publisher":"Elsevier","keyword":["Local ratio"],"publication":"Discrete Applied Mathematics "},{"abstract":[{"text":"We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems such that a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit). Each demand i can be served anytime between its arrival ai and its deadline ai+di by a leased resource. The objective is to meet all deadlines while minimizing the total leasing costs. This model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005) in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive where dmax and lmin denote the largest di and the shortest available lease length, respectively. We also extend the SetCoverLeasing problem by deadlines and give a competitive online algorithm which also improves on existing solutions for the original SetCoverLeasing problem.","lang":"eng"}],"ddc":["040"],"user_id":"15504","file_date_updated":"2018-03-21T10:28:50Z","publication":"Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)","author":[{"full_name":"Li, Shouwei","first_name":"Shouwei","last_name":"Li"},{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T10:28:50Z","content_type":"application/pdf","creator":"florida","file_id":"1498","file_size":264482,"access_level":"closed","file_name":"240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf","date_created":"2018-03-21T10:28:50Z"}],"date_created":"2017-10-17T12:41:38Z","has_accepted_license":"1","status":"public","_id":"240","page":"277--288","type":"conference","citation":{"mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.” Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.","bibtex":"@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing Problems}, DOI={10.1007/978-3-319-21398-9_22}, booktitle={Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian, Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015}, pages={277--288}, collection={Lecture Notes in Computer Science} }","ama":"Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible Demands in Online Leasing Problems. In: Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science. ; 2015:277--288. doi:10.1007/978-3-319-21398-9_22","apa":"Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers, S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON) (pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22","chicago":"Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.” In Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 277--288. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21398-9_22.","ieee":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.","short":"S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288."},"year":"2015","title":"Towards Flexible Demands in Online Leasing Problems","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_updated":"2022-01-06T06:56:05Z","doi":"10.1007/978-3-319-21398-9_22","series_title":"Lecture Notes in Computer Science"},{"external_id":{"arxiv":["1510.05454"]},"abstract":[{"text":"We consider the following variant of the two dimensional gathering problem\r\nfor swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe grid and must keep this connectivity during the whole process of their\r\ngathering. Connectivity means, that neighboring robots of the chain need to be\r\npositioned at the same or neighboring points of the grid. In our model,\r\ngathering means to keep shortening the chain until the robots are located\r\ninside a $2\\times 2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates, no compass, no global communication or vision, \\ldots).\r\nEach robot can only see its next constant number of left and right neighbors on\r\nthe chain. This fixed constant is called the \\emph{viewing path length}. All\r\nits operations and detections are restricted to this constant number of robots.\r\nOther robots, even if located at neighboring or the same grid point cannot be\r\ndetected. Only based on the relative positions of its detectable chain\r\nneighbors, a robot can decide to obtain a certain state. Based on this state\r\nand their local knowledge, the robots do local modifications to the chain by\r\nmoving to neighboring grid points without breaking the chain. These\r\nmodifications are performed without the knowledge whether they lead to a global\r\nprogress or not. We assume the fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a gathering algorithm which needs linear time. This\r\nresult generalizes the result from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and fixed) endpoints is considered.","lang":"eng"}],"user_id":"15415","title":"Gathering a Closed Chain of Robots on a Grid","department":[{"_id":"63"}],"publication":"arXiv:1510.05454","author":[{"full_name":"Abshoff, Sebastian","first_name":"Sebastian","last_name":"Abshoff"},{"full_name":"Cord-Landwehr, Andreas ","first_name":"Andreas ","last_name":"Cord-Landwehr"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-07T07:20:46Z","status":"public","date_updated":"2022-01-06T06:52:50Z","_id":"16449","language":[{"iso":"eng"}],"type":"preprint","citation":{"bibtex":"@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.","apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015.","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015.","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1510.05454 (2015)."},"year":"2015"},{"abstract":[{"lang":"eng","text":"We consider the problem of dominating set-based virtual backbone used for\r\nrouting in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission ranges and are modeled using the well-established disk graphs. The\r\ncorresponding graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is strongly connected and each node in the graph is\r\neither in the set or has both an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem are of practical significance due to\r\nthe dynamic nature of ad-hoc networks. We present a first distributed\r\napproximation algorithm, with a constant approximation factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover we present a\r\nsimple heuristic algorithm and conduct an extensive simulation study showing\r\nthat our heuristic outperforms previously known approaches for the problem."}],"external_id":{"arxiv":["1510.01866"]},"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks","user_id":"15415","author":[{"first_name":"Faisal N. ","full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Michael","full_name":"Schubert, Michael","last_name":"Schubert"}],"department":[{"_id":"63"}],"publication":"arXiv:1510.01866","status":"public","date_created":"2020-04-07T12:22:48Z","date_updated":"2022-01-06T06:52:50Z","_id":"16452","year":"2015","citation":{"short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866 (2015).","ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks,” arXiv:1510.01866. 2015.","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2015). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks. ArXiv:1510.01866.","ama":"Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks. arXiv:151001866. 2015.","chicago":"Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide, and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks}, journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }"},"type":"preprint","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"page":"357-364","year":"2015","citation":{"bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online Top-k-Position Monitoring of Distributed Data Streams}, DOI={10.1109/IPDPS.2015.40}, booktitle={Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }","mla":"Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed Data Streams.” Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2015, pp. 357–64, doi:10.1109/IPDPS.2015.40.","chicago":"Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Online Top-k-Position Monitoring of Distributed Data Streams.” In Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), 357–64. IEEE, 2015. https://doi.org/10.1109/IPDPS.2015.40.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring of Distributed Data Streams. In: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2015:357-364. doi:10.1109/IPDPS.2015.40","apa":"Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2015). Online Top-k-Position Monitoring of Distributed Data Streams. In Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 357–364). IEEE. https://doi.org/10.1109/IPDPS.2015.40","ieee":"A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position Monitoring of Distributed Data Streams,” in Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), 2015, pp. 357–364.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2015, pp. 357–364."},"type":"conference","doi":"10.1109/IPDPS.2015.40","date_updated":"2022-01-06T06:52:50Z","_id":"16460","date_created":"2020-04-08T07:02:15Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)","publisher":"IEEE","author":[{"first_name":"Alexander","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"full_name":"Malatyali, Manuel","first_name":"Manuel","last_name":"Malatyali"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"user_id":"15415","title":"Online Top-k-Position Monitoring of Distributed Data Streams","external_id":{"arxiv":["1410.7912"]},"abstract":[{"lang":"eng","text":"Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual online data stream of numbers and, at any point in time, the\r\ncoordinator has to know the k nodes currently observing the largest values, for\r\na given k between 1 and n. We design and analyze an algorithm that solves this\r\nproblem while bounding the amount of messages exchanged between the nodes and\r\nthe coordinator. Our algorithm employs the idea of using filters which,\r\nintuitively speaking, leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous ones. The algorithm uses a number of messages that is\r\non expectation by a factor of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest value observed by any node."}]},{"user_id":"15415","title":"Linear and Competitive Strategies for Continuous Robot Formation Problems","status":"public","date_created":"2020-04-03T06:40:56Z","publication_identifier":{"issn":["2329-4949"]},"publication_status":"published","author":[{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication":"ACM Transactions on Parallel Computing","department":[{"_id":"63"}],"doi":"10.1145/2742341","_id":"16391","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"year":"2015","type":"journal_article","citation":{"bibtex":"@article{Degener_Kempkes_Kling_Meyer auf der Heide_2015, title={Linear and Competitive Strategies for Continuous Robot Formation Problems}, DOI={10.1145/2742341}, journal={ACM Transactions on Parallel Computing}, author={Degener, Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2015}, pages={1–18} }","mla":"Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015, pp. 1–18, doi:10.1145/2742341.","chicago":"Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “Linear and Competitive Strategies for Continuous Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015, 1–18. https://doi.org/10.1145/2742341.","ama":"Degener B, Kempkes B, Kling P, Meyer auf der Heide F. Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel Computing. 2015:1-18. doi:10.1145/2742341","apa":"Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015). Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341","ieee":"B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Linear and Competitive Strategies for Continuous Robot Formation Problems,” ACM Transactions on Parallel Computing, pp. 1–18, 2015.","short":"B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (2015) 1–18."},"page":"1-18"},{"abstract":[{"lang":"eng","text":"In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe consider the gathering of a closed chain of point-shaped, anonymous robots\r\non a grid. The robots only have local knowledge about a constant number of\r\nneighboring robots along the chain in both directions. Actions are performed in\r\nthe fully synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain one timestamp of the global clock, also visible to its direct\r\nneighbors. In this synchronous time model, there is no limited view gathering\r\nalgorithm known to perform better than in quadratic runtime. The configurations\r\nthat show the quadratic lower bound are closed chains. In this paper, we\r\npresent the first sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains on a grid."}],"external_id":{"arxiv":["1501.04877"]},"user_id":"15415","title":"Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case","publication":"ArXiv: 1501.04877","department":[{"_id":"63"}],"author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"},{"full_name":"Andreas Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Andreas Cord-Landwehr"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2020-04-03T09:36:54Z","status":"public","_id":"16397","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"year":"2015","type":"preprint","citation":{"ieee":"S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, and F. Meyer auf der Heide, “Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case,” ArXiv: 1501.04877. 2015.","short":"S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, F. Meyer auf der Heide, ArXiv: 1501.04877 (2015).","mla":"Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 2015.","bibtex":"@article{Abshoff_Andreas Cord-Landwehr_Jung_Meyer auf der Heide_2015, title={Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case}, journal={ArXiv: 1501.04877}, author={Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }","ama":"Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case. ArXiv: 150104877. 2015.","apa":"Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide, F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case. ArXiv: 1501.04877.","chicago":"Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 2015."}},{"publication":"Symposium on Biomathematics and Ecology: Education and Research","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Karsai","full_name":"Karsai, Istvan","first_name":"Istvan"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"last_name":"Hilbun","full_name":"Hilbun, Allison","first_name":"Allison"}],"date_created":"2020-10-15T13:56:46Z","status":"public","user_id":"15415","title":"The common stomach: Organizing task allocation in wasp societies","language":[{"iso":"eng"}],"citation":{"chicago":"Hamann, Heiko, Istvan Karsai, Thomas Schmickl, and Allison Hilbun. “The Common Stomach: Organizing Task Allocation in Wasp Societies.” In Symposium on Biomathematics and Ecology: Education and Research, 2014.","ama":"Hamann H, Karsai I, Schmickl T, Hilbun A. The common stomach: Organizing task allocation in wasp societies. In: Symposium on Biomathematics and Ecology: Education and Research. ; 2014.","apa":"Hamann, H., Karsai, I., Schmickl, T., & Hilbun, A. (2014). The common stomach: Organizing task allocation in wasp societies. In Symposium on Biomathematics and Ecology: Education and Research.","mla":"Hamann, Heiko, et al. “The Common Stomach: Organizing Task Allocation in Wasp Societies.” Symposium on Biomathematics and Ecology: Education and Research, 2014.","bibtex":"@inproceedings{Hamann_Karsai_Schmickl_Hilbun_2014, title={The common stomach: Organizing task allocation in wasp societies}, booktitle={Symposium on Biomathematics and Ecology: Education and Research}, author={Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas and Hilbun, Allison}, year={2014} }","short":"H. Hamann, I. Karsai, T. Schmickl, A. Hilbun, in: Symposium on Biomathematics and Ecology: Education and Research, 2014.","ieee":"H. Hamann, I. Karsai, T. Schmickl, and A. Hilbun, “The common stomach: Organizing task allocation in wasp societies,” in Symposium on Biomathematics and Ecology: Education and Research, 2014."},"year":"2014","type":"conference","_id":"20007","date_updated":"2022-01-06T06:54:18Z"},{"date_updated":"2022-01-06T06:54:18Z","_id":"20008","doi":"10.1007/978-3-319-09952-1_15","year":"2014","citation":{"short":"H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), Cham, 2014.","ieee":"H. Hamann and G. Valentini, “Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins,” in Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), 2014.","chicago":"Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based Analysis of Self-Organizing Temporary Lock-Ins.” In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Cham, 2014. https://doi.org/10.1007/978-3-319-09952-1_15.","apa":"Hamann, H., & Valentini, G. (2014). Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Cham. https://doi.org/10.1007/978-3-319-09952-1_15","ama":"Hamann H, Valentini G. Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Cham; 2014. doi:10.1007/978-3-319-09952-1_15","bibtex":"@inproceedings{Hamann_Valentini_2014, place={Cham}, title={Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins}, DOI={10.1007/978-3-319-09952-1_15}, booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Hamann, Heiko and Valentini, Gabriele}, year={2014} }","mla":"Hamann, Heiko, and Gabriele Valentini. “Swarm in a Fly Bottle: Feedback-Based Analysis of Self-Organizing Temporary Lock-Ins.” Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), 2014, doi:10.1007/978-3-319-09952-1_15."},"type":"conference","language":[{"iso":"eng"}],"place":"Cham","title":"Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"publication":"Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"}],"publication_status":"published","publication_identifier":{"isbn":["9783319099514","9783319099521"],"issn":["0302-9743","1611-3349"]},"date_created":"2020-10-15T14:13:51Z","status":"public"},{"user_id":"15415","title":"Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem","abstract":[{"lang":"eng","text":"A grand challenge in the field of artificial life is to find a general theory of emergent self-organizing systems. In swarm systems most of the observed complexity is based on motion of simple entities. Similarly, statistical mechanics focuses on collective properties induced by the motion of many interacting particles. In this article we apply methods from statistical mechanics to swarm systems. We try to explain the emergent behavior of a simulated swarm by applying methods based on the fluctuation theorem. Empirical results indicate that swarms are able to produce negative entropy within an isolated subsystem due to frozen accidents. Individuals of a swarm are able to locally detect fluctuations of the global entropy measure and store them, if they are negative entropy productions. By accumulating these stored fluctuations over time the swarm as a whole is producing negative entropy and the system ends up in an ordered state. We claim that this indicates the existence of an inverted fluctuation theorem for emergent self-organizing dissipative systems. This approach bears the potential of general applicability."}],"date_created":"2020-10-19T08:41:18Z","status":"public","volume":20,"department":[{"_id":"63"},{"_id":"238"}],"publication":"Artificial Life","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"}],"issue":"1","doi":"10.1162/ARTL_a_00097","date_updated":"2022-01-06T06:54:20Z","_id":"20120","intvolume":" 20","language":[{"iso":"eng"}],"page":"77-93","year":"2014","type":"journal_article","citation":{"mla":"Hamann, Heiko, et al. “Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem.” Artificial Life, vol. 20, no. 1, 2014, pp. 77–93, doi:10.1162/ARTL_a_00097.","bibtex":"@article{Hamann_Schmickl_Crailsheim_2014, title={Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem}, volume={20}, DOI={10.1162/ARTL_a_00097}, number={1}, journal={Artificial Life}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2014}, pages={77–93} }","chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem.” Artificial Life 20, no. 1 (2014): 77–93. https://doi.org/10.1162/ARTL_a_00097.","apa":"Hamann, H., Schmickl, T., & Crailsheim, K. (2014). Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem. Artificial Life, 20(1), 77–93. https://doi.org/10.1162/ARTL_a_00097","ama":"Hamann H, Schmickl T, Crailsheim K. Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem. Artificial Life. 2014;20(1):77-93. doi:10.1162/ARTL_a_00097","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem,” Artificial Life, vol. 20, no. 1, pp. 77–93, 2014.","short":"H. Hamann, T. Schmickl, K. Crailsheim, Artificial Life 20 (2014) 77–93."}},{"_id":"20121","date_updated":"2022-01-06T06:54:20Z","year":"2014","citation":{"ama":"Dorigo M, Hamann H, Valentini G, et al. Self-Organized Collective Decision Making: The Weighted Voter Model. In: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014). ; 2014.","apa":"Dorigo, M., Hamann, H., Valentini, G., Lomuscio, A., Scerri, P., Bazzan, A., & Huhns, M. (2014). Self-Organized Collective Decision Making: The Weighted Voter Model. In Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014).","chicago":"Dorigo, Marco, Heiko Hamann, Gabriele Valentini, Alessio Lomuscio, Paul Scerri, Ana Bazzan, and Michael Huhns. “Self-Organized Collective Decision Making: The Weighted Voter Model.” In Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014), 2014.","mla":"Dorigo, Marco, et al. “Self-Organized Collective Decision Making: The Weighted Voter Model.” Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014), 2014.","bibtex":"@inproceedings{Dorigo_Hamann_Valentini_Lomuscio_Scerri_Bazzan_Huhns_2014, title={Self-Organized Collective Decision Making: The Weighted Voter Model}, booktitle={Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Lomuscio, Alessio and Scerri, Paul and Bazzan, Ana and Huhns, Michael}, year={2014} }","short":"M. Dorigo, H. Hamann, G. Valentini, A. Lomuscio, P. Scerri, A. Bazzan, M. Huhns, in: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014), 2014.","ieee":"M. Dorigo et al., “Self-Organized Collective Decision Making: The Weighted Voter Model,” in Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014), 2014."},"type":"conference","language":[{"iso":"eng"}],"title":"Self-Organized Collective Decision Making: The Weighted Voter Model","user_id":"15415","abstract":[{"text":"Collective decision making in self-organized systems is challenging because it relies on local perception and local communication. Globally defined qualities such as consensus time and decision accuracy are both difficult to predict and difficult to guarantee. We present the weighted voter model which implements a self-organized collective decision making process. We provide an ODE model, a master equation model (numerically solved by the Gillespie algorithm), and agent-based simulations of the proposed decision-making strategy. This set of models enables us to investigate the system behavior in the thermodynamic limit and to investigate finite-size effects due to random fluctuations. Based on our results, we give minimum requirements to guarantee consensus on the optimal decision, a minimum swarm size to guarantee a certain accuracy, and we show that the proposed approach scales with system size and is robust to noise.","lang":"eng"}],"status":"public","date_created":"2020-10-19T08:49:05Z","author":[{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Valentini","full_name":"Valentini, Gabriele","first_name":"Gabriele"},{"last_name":"Lomuscio","full_name":"Lomuscio, Alessio","first_name":"Alessio"},{"first_name":"Paul","full_name":"Scerri, Paul","last_name":"Scerri"},{"last_name":"Bazzan","full_name":"Bazzan, Ana","first_name":"Ana"},{"last_name":"Huhns","full_name":"Huhns, Michael","first_name":"Michael"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)"},{"_id":"20126","date_updated":"2022-01-06T06:54:20Z","doi":"10.1145/2598394.2598507","year":"2014","citation":{"mla":"Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal.” Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014), 2014, pp. 31–32, doi:10.1145/2598394.2598507.","bibtex":"@inproceedings{Hamann_2014, title={Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal}, DOI={10.1145/2598394.2598507}, booktitle={Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)}, author={Hamann, Heiko}, year={2014}, pages={31–32} }","chicago":"Hamann, Heiko. “Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal.” In Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014), 31–32, 2014. https://doi.org/10.1145/2598394.2598507.","ama":"Hamann H. Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal. In: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014). ; 2014:31-32. doi:10.1145/2598394.2598507","apa":"Hamann, H. (2014). Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal. In Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014) (pp. 31–32). https://doi.org/10.1145/2598394.2598507","ieee":"H. Hamann, “Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal,” in Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014), 2014, pp. 31–32.","short":"H. Hamann, in: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014), 2014, pp. 31–32."},"type":"conference","page":"31-32","language":[{"iso":"eng"}],"title":"Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal","user_id":"15415","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"publication":"Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-20T07:45:46Z"},{"page":"262-269","year":"2014","citation":{"short":"M. Birattari, M. Dorigo, H. Hamann, S. Garnier, M. Montes de Oca, C. Solnon, T. Stuetzle, H. Ding, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), 2014, pp. 262–269.","ieee":"M. Birattari et al., “Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation,” in Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), 2014, vol. 8667, pp. 262–269.","chicago":"Birattari, Mauro, Marco Dorigo, Heiko Hamann, Simon Garnier, Marco Montes de Oca, Christine Solnon, Thomas Stuetzle, and Hongli Ding. “Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation.” In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), 8667:262–69, 2014. https://doi.org/10.1007/978-3-319-09952-1_25.","ama":"Birattari M, Dorigo M, Hamann H, et al. Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Vol 8667. ; 2014:262-269. doi:10.1007/978-3-319-09952-1_25","apa":"Birattari, M., Dorigo, M., Hamann, H., Garnier, S., Montes de Oca, M., Solnon, C., … Ding, H. (2014). Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014) (Vol. 8667, pp. 262–269). https://doi.org/10.1007/978-3-319-09952-1_25","bibtex":"@inproceedings{Birattari_Dorigo_Hamann_Garnier_Montes de Oca_Solnon_Stuetzle_Ding_2014, title={Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation}, volume={8667}, DOI={10.1007/978-3-319-09952-1_25}, booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Birattari, Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca, Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}, year={2014}, pages={262–269} }","mla":"Birattari, Mauro, et al. “Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation.” Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), vol. 8667, 2014, pp. 262–69, doi:10.1007/978-3-319-09952-1_25."},"type":"conference","language":[{"iso":"eng"}],"intvolume":" 8667","_id":"20127","date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/978-3-319-09952-1_25","publication":"Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Birattari","full_name":"Birattari, Mauro","first_name":"Mauro"},{"full_name":"Dorigo, Marco","first_name":"Marco","last_name":"Dorigo"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Garnier, Simon","first_name":"Simon","last_name":"Garnier"},{"first_name":"Marco","full_name":"Montes de Oca, Marco","last_name":"Montes de Oca"},{"last_name":"Solnon","full_name":"Solnon, Christine","first_name":"Christine"},{"last_name":"Stuetzle","first_name":"Thomas","full_name":"Stuetzle, Thomas"},{"last_name":"Ding","full_name":"Ding, Hongli","first_name":"Hongli"}],"volume":8667,"date_created":"2020-10-20T07:54:18Z","status":"public","title":"Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation","user_id":"15415"},{"user_id":"15415","title":"Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements","publication":"13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Khaluf, Yara","first_name":"Yara","last_name":"Khaluf"},{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Valentini","first_name":"Gabriele","full_name":"Valentini, Gabriele"},{"first_name":"T.","full_name":"Bartz-Beielstein, T.","last_name":"Bartz-Beielstein"}],"publisher":"Springer","date_created":"2020-10-20T08:26:59Z","status":"public","volume":8672,"intvolume":" 8672","_id":"20128","date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/978-3-319-10762-2_18","language":[{"iso":"eng"}],"page":"181-190","citation":{"short":"Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, T. Bartz-Beielstein, in: 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014), Springer, 2014, pp. 181–190.","ieee":"Y. Khaluf, M. Dorigo, H. Hamann, G. Valentini, and T. Bartz-Beielstein, “Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements,” in 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014), vol. 8672, Springer, 2014, pp. 181–190.","apa":"Khaluf, Y., Dorigo, M., Hamann, H., Valentini, G., & Bartz-Beielstein, T. (2014). Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements. In 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014) (Vol. 8672, pp. 181–190). Springer. https://doi.org/10.1007/978-3-319-10762-2_18","ama":"Khaluf Y, Dorigo M, Hamann H, Valentini G, Bartz-Beielstein T. Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements. In: 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014). Vol 8672. Springer; 2014:181-190. doi:10.1007/978-3-319-10762-2_18","chicago":"Khaluf, Yara, Marco Dorigo, Heiko Hamann, Gabriele Valentini, and T. Bartz-Beielstein. “Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements.” In 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014), 8672:181–90. Springer, 2014. https://doi.org/10.1007/978-3-319-10762-2_18.","bibtex":"@inbook{Khaluf_Dorigo_Hamann_Valentini_Bartz-Beielstein_2014, title={Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements}, volume={8672}, DOI={10.1007/978-3-319-10762-2_18}, booktitle={13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)}, publisher={Springer}, author={Khaluf, Yara and Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Bartz-Beielstein, T.}, year={2014}, pages={181–190} }","mla":"Khaluf, Yara, et al. “Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements.” 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014), vol. 8672, Springer, 2014, pp. 181–90, doi:10.1007/978-3-319-10762-2_18."},"type":"book_chapter","year":"2014"},{"status":"public","date_created":"2020-10-20T09:02:49Z","publisher":"MIT Press","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Sayama","full_name":"Sayama, Hiroki","first_name":"Hiroki"},{"first_name":"John","full_name":"Rieffel, John","last_name":"Rieffel"},{"first_name":"Sebastian","full_name":"Risi, Sebastian","last_name":"Risi"},{"full_name":"Doursat, Rene","first_name":"Rene","last_name":"Doursat"},{"last_name":"Lipson","full_name":"Lipson, Hod","first_name":"Hod"}],"publication":"14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)","department":[{"_id":"63"},{"_id":"238"}],"title":"Evolution of Collective Behaviors by Minimizing Surprise","user_id":"15415","citation":{"mla":"Hamann, Heiko, et al. “Evolution of Collective Behaviors by Minimizing Surprise.” 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), MIT Press, 2014, pp. 344–51, doi:10.7551/978-0-262-32621-6-ch055.","bibtex":"@inproceedings{Hamann_Sayama_Rieffel_Risi_Doursat_Lipson_2014, title={Evolution of Collective Behaviors by Minimizing Surprise}, DOI={10.7551/978-0-262-32621-6-ch055}, booktitle={14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)}, publisher={MIT Press}, author={Hamann, Heiko and Sayama, Hiroki and Rieffel, John and Risi, Sebastian and Doursat, Rene and Lipson, Hod}, year={2014}, pages={344–351} }","ama":"Hamann H, Sayama H, Rieffel J, Risi S, Doursat R, Lipson H. Evolution of Collective Behaviors by Minimizing Surprise. In: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014). MIT Press; 2014:344-351. doi:10.7551/978-0-262-32621-6-ch055","apa":"Hamann, H., Sayama, H., Rieffel, J., Risi, S., Doursat, R., & Lipson, H. (2014). Evolution of Collective Behaviors by Minimizing Surprise. In 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014) (pp. 344–351). MIT Press. https://doi.org/10.7551/978-0-262-32621-6-ch055","chicago":"Hamann, Heiko, Hiroki Sayama, John Rieffel, Sebastian Risi, Rene Doursat, and Hod Lipson. “Evolution of Collective Behaviors by Minimizing Surprise.” In 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), 344–51. MIT Press, 2014. https://doi.org/10.7551/978-0-262-32621-6-ch055.","ieee":"H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, and H. Lipson, “Evolution of Collective Behaviors by Minimizing Surprise,” in 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), 2014, pp. 344–351.","short":"H. Hamann, H. Sayama, J. Rieffel, S. Risi, R. Doursat, H. Lipson, in: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014), MIT Press, 2014, pp. 344–351."},"type":"conference","year":"2014","page":"344-351","language":[{"iso":"eng"}],"doi":"10.7551/978-0-262-32621-6-ch055","date_updated":"2022-01-06T06:54:20Z","_id":"20129"},{"language":[{"iso":"eng"}],"page":"270-279","citation":{"ieee":"E. Cervera et al., “A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs,” in Simulation of Adaptive Behavior (SAB 2014), 2014, vol. 8575, pp. 270–279.","short":"E. Cervera, Y. Khaluf, M. Birattari, H. Hamann, A.P. del Pobil, E. Chinellato, E. Martinez-Martin, J. Hallam, A. Morales, in: Simulation of Adaptive Behavior (SAB 2014), 2014, pp. 270–279.","mla":"Cervera, Enric, et al. “A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs.” Simulation of Adaptive Behavior (SAB 2014), vol. 8575, 2014, pp. 270–79, doi:10.1007/978-3-319-08864-8_26.","bibtex":"@inproceedings{Cervera_Khaluf_Birattari_Hamann_Pobil_Chinellato_Martinez-Martin_Hallam_Morales_2014, title={A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs}, volume={8575}, DOI={10.1007/978-3-319-08864-8_26}, booktitle={Simulation of Adaptive Behavior (SAB 2014)}, author={Cervera, Enric and Khaluf, Yara and Birattari, Mauro and Hamann, Heiko and Pobil, Angel P. del and Chinellato, Eris and Martinez-Martin, Ester and Hallam, John and Morales, Antonio}, year={2014}, pages={270–279} }","apa":"Cervera, E., Khaluf, Y., Birattari, M., Hamann, H., Pobil, A. P. del, Chinellato, E., … Morales, A. (2014). A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs. In Simulation of Adaptive Behavior (SAB 2014) (Vol. 8575, pp. 270–279). https://doi.org/10.1007/978-3-319-08864-8_26","ama":"Cervera E, Khaluf Y, Birattari M, et al. A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs. In: Simulation of Adaptive Behavior (SAB 2014). Vol 8575. ; 2014:270-279. doi:10.1007/978-3-319-08864-8_26","chicago":"Cervera, Enric, Yara Khaluf, Mauro Birattari, Heiko Hamann, Angel P. del Pobil, Eris Chinellato, Ester Martinez-Martin, John Hallam, and Antonio Morales. “A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs.” In Simulation of Adaptive Behavior (SAB 2014), 8575:270–79, 2014. https://doi.org/10.1007/978-3-319-08864-8_26."},"year":"2014","type":"conference","doi":"10.1007/978-3-319-08864-8_26","date_updated":"2022-01-06T06:54:20Z","_id":"20130","intvolume":" 8575","date_created":"2020-10-20T09:09:59Z","status":"public","volume":8575,"department":[{"_id":"63"},{"_id":"238"}],"publication":"Simulation of Adaptive Behavior (SAB 2014)","author":[{"last_name":"Cervera","full_name":"Cervera, Enric","first_name":"Enric"},{"last_name":"Khaluf","full_name":"Khaluf, Yara","first_name":"Yara"},{"last_name":"Birattari","first_name":"Mauro","full_name":"Birattari, Mauro"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"full_name":"Pobil, Angel P. del","first_name":"Angel P. del","last_name":"Pobil"},{"last_name":"Chinellato","full_name":"Chinellato, Eris","first_name":"Eris"},{"first_name":"Ester","full_name":"Martinez-Martin, Ester","last_name":"Martinez-Martin"},{"last_name":"Hallam","first_name":"John","full_name":"Hallam, John"},{"full_name":"Morales, Antonio","first_name":"Antonio","last_name":"Morales"}],"user_id":"15415","title":"A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs"},{"_id":"368","citation":{"mla":"Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.” Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.","bibtex":"@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014, title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={10.1145/2612669.2612698}, booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim }, year={2014}, pages={128–137} }","apa":"Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., & Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores. Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 128–137. https://doi.org/10.1145/2612669.2612698","ama":"Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T. Scheduling Shared Continuous Resources on Many-Cores. In: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2014:128-137. doi:10.1145/2612669.2612698","chicago":"Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 128–37, 2014. https://doi.org/10.1145/2612669.2612698.","ieee":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–137, doi: 10.1145/2612669.2612698.","short":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T. Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–137."},"year":"2014","type":"conference","page":"128-137","abstract":[{"text":"We consider the problem of scheduling a number of jobs on $m$ identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement r_j \\in {0,1}. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their \\emph{processing speeds}, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature.In this paper, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover, we prove that balanced schedules yield a 2-1/m-approximation for a fixed number of processors. Such schedules are computed by our GreedyBalance algorithm, for which the bound is tight.","lang":"eng"}],"user_id":"15415","ddc":["040"],"file":[{"date_created":"2018-03-20T07:17:38Z","file_name":"368-BKMNRS14.pdf","access_level":"closed","file_id":"1403","creator":"florida","file_size":485767,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-20T07:17:38Z"}],"author":[{"full_name":"Brinkmann, Andre","first_name":"Andre","last_name":"Brinkmann"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Nagel, Lars","first_name":"Lars","last_name":"Nagel"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"full_name":"Suess, Tim ","first_name":"Tim ","last_name":"Suess"}],"file_date_updated":"2018-03-20T07:17:38Z","publication":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:03Z","date_updated":"2022-01-06T06:59:30Z","doi":"10.1145/2612669.2612698","language":[{"iso":"eng"}],"title":"Scheduling Shared Continuous Resources on Many-Cores","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"_id":"370","year":"2014","type":"conference","citation":{"bibtex":"@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }","mla":"Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.","apa":"Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games with Progressive Filling. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360."},"page":"352-360","abstract":[{"lang":"eng","text":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. "}],"ddc":["040"],"user_id":"477","author":[{"last_name":"Harks","first_name":"Tobias","full_name":"Harks, Tobias"},{"first_name":"Martin","full_name":"Höfer, Martin","last_name":"Höfer"},{"last_name":"Schewior","first_name":"Kevin","full_name":"Schewior, Kevin"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file_date_updated":"2018-03-20T07:17:04Z","publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","file":[{"date_created":"2018-03-20T07:17:04Z","file_name":"370-HHSS14.pdf","access_level":"closed","file_size":179583,"creator":"florida","file_id":"1402","date_updated":"2018-03-20T07:17:04Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:04Z","date_updated":"2022-01-06T06:59:30Z","doi":"10.1109/TNET.2015.2468571","language":[{"iso":"eng"}],"title":"Routing Games with Progressive Filling","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"_id":"373","date_updated":"2022-01-06T06:59:31Z","type":"bachelorsthesis","citation":{"mla":"Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","chicago":"Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.","apa":"Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn.","ama":"Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014.","ieee":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.","short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014."},"year":"2014","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"language":[{"iso":"ger"}],"title":"Reputationssysteme für zusammengesetzte Dienstleistungen","user_id":"14052","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:04Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"author":[{"last_name":"Pahl","first_name":"David","full_name":"Pahl, David"}],"publisher":"Universität Paderborn"},{"_id":"379","year":"2014","citation":{"chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.","apa":"Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2014:25-34. doi:10.1007/978-3-319-12691-3_3","bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.","short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34."},"type":"conference","page":"25-34","abstract":[{"lang":"eng","text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to."}],"ddc":["040"],"user_id":"15504","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-03-20T07:12:57Z","file":[{"file_id":"1395","creator":"florida","file_size":214299,"relation":"main_file","success":1,"date_updated":"2018-03-20T07:12:57Z","content_type":"application/pdf","date_created":"2018-03-20T07:12:57Z","file_name":"379-COCOA14.pdf","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:06Z","date_updated":"2022-01-06T06:59:36Z","doi":"10.1007/978-3-319-12691-3_3","series_title":"LNCS","title":"Randomized Online Algorithms for Set Cover Leasing Problems","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"doi":"10.1007/978-3-319-13129-0_34","date_updated":"2022-01-06T06:59:36Z","_id":"380","page":"423-428","year":"2014","type":"conference","citation":{"short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 423–28, 2014. https://doi.org/10.1007/978-3-319-13129-0_34.","ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34","apa":"Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }"},"ddc":["040"],"title":"Quality of Service in Network Creation Games","user_id":"15504","abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}"}],"date_created":"2017-10-17T12:42:06Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"has_accepted_license":"1","status":"public","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file_date_updated":"2018-03-20T07:05:59Z","department":[{"_id":"63"}],"author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"file":[{"date_created":"2018-03-20T07:05:59Z","file_name":"380-WINE2014.pdf","access_level":"closed","file_size":166640,"creator":"florida","file_id":"1394","date_updated":"2018-03-20T07:05:59Z","content_type":"application/pdf","relation":"main_file","success":1}]},{"date_updated":"2022-01-06T06:53:16Z","_id":"17659","citation":{"bibtex":"@inproceedings{Polevoy_Trajanovski_de Weerdt_2014, place={Richland, SC}, series={AAMAS ’14}, title={Nash Equilibria in Shared Effort Games}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.}, year={2014}, pages={861–868}, collection={AAMAS ’14} }","mla":"Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 861–68.","apa":"Polevoy, G., Trajanovski, S., & de Weerdt, M. M. (2014). Nash Equilibria in Shared Effort Games. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 861–868). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:861-868.","chicago":"Polevoy, Gleb, Stojan Trajanovski, and Mathijs M. de Weerdt. “Nash Equilibria in Shared Effort Games.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 861–68. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.","ieee":"G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared Effort Games,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 861–868.","short":"G. Polevoy, S. Trajanovski, M.M. de Weerdt, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 861–868."},"year":"2014","type":"conference","page":"861-868","language":[{"iso":"eng"}],"series_title":"AAMAS '14","title":"Nash Equilibria in Shared Effort Games","user_id":"83983","extern":"1","place":"Richland, SC","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"status":"public","date_created":"2020-08-06T15:21:26Z","author":[{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"Trajanovski","first_name":"Stojan","full_name":"Trajanovski, Stojan"},{"last_name":"de Weerdt","full_name":"de Weerdt, Mathijs M.","first_name":"Mathijs M."}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","department":[{"_id":"63"},{"_id":"541"}],"keyword":["competition","equilibrium","market","models","shared effort games","simulation"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems"},{"date_updated":"2022-01-06T06:53:16Z","_id":"17660","series_title":"AAMAS '14","language":[{"iso":"eng"}],"type":"conference","year":"2014","citation":{"bibtex":"@inproceedings{Polevoy_de Weerdt_2014, place={Richland, SC}, series={AAMAS ’14}, title={Improving Human Interaction in Crowdsensing}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs M.}, year={2014}, pages={1741–1742}, collection={AAMAS ’14} }","mla":"Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1741–42.","chicago":"Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 1741–42. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.","ama":"Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1741-1742.","apa":"Polevoy, G., & de Weerdt, M. M. (2014). Improving Human Interaction in Crowdsensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1741–1742). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ieee":"G. Polevoy and M. M. de Weerdt, “Improving Human Interaction in Crowdsensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1741–1742.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 1741–1742."},"page":"1741-1742","place":"Richland, SC","extern":"1","user_id":"83983","title":"Improving Human Interaction in Crowdsensing","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"full_name":"de Weerdt, Mathijs M.","first_name":"Mathijs M.","last_name":"de Weerdt"}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","department":[{"_id":"63"},{"_id":"541"}],"keyword":["dynamics","emotion modeling","negotiation","network interaction","shared effort game"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","status":"public","date_created":"2020-08-06T15:21:35Z","publication_identifier":{"isbn":["978-1-4503-2738-1"]}},{"_id":"17661","date_updated":"2022-01-06T06:53:16Z","series_title":"AAMAS '14","page":"1651-1652","citation":{"short":"T.C. King, Q. Liu, G. Polevoy, M. de Weerdt, V. Dignum, M.B. van Riemsdijk, M. Warnier, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 1651–1652.","ieee":"T. C. King et al., “Request Driven Social Sensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1651–1652.","chicago":"King, Thomas C., Qingzhi Liu, Gleb Polevoy, Mathijs de Weerdt, Virginia Dignum, M. Birna van Riemsdijk, and Martijn Warnier. “Request Driven Social Sensing.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 1651–52. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.","apa":"King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk, M. B., & Warnier, M. (2014). Request Driven Social Sensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1651-1652.","mla":"King, Thomas C., et al. “Request Driven Social Sensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1651–52.","bibtex":"@inproceedings{King_Liu_Polevoy_de Weerdt_Dignum_van Riemsdijk_Warnier_2014, place={Richland, SC}, series={AAMAS ’14}, title={Request Driven Social Sensing}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={King, Thomas C. and Liu, Qingzhi and Polevoy, Gleb and de Weerdt, Mathijs and Dignum, Virginia and van Riemsdijk, M. Birna and Warnier, Martijn}, year={2014}, pages={1651–1652}, collection={AAMAS ’14} }"},"type":"conference","year":"2014","language":[{"iso":"eng"}],"extern":"1","place":"Richland, SC","title":"Request Driven Social Sensing","user_id":"83983","publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","department":[{"_id":"63"},{"_id":"541"}],"keyword":["crowd-sensing","crowdsourcing","data aggregation","game theory","norms","reciprocation","self interested agents","simulation"],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"full_name":"King, Thomas C.","first_name":"Thomas C.","last_name":"King"},{"first_name":"Qingzhi","full_name":"Liu, Qingzhi","last_name":"Liu"},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"first_name":"Mathijs","full_name":"de Weerdt, Mathijs","last_name":"de Weerdt"},{"last_name":"Dignum","full_name":"Dignum, Virginia","first_name":"Virginia"},{"first_name":"M. Birna","full_name":"van Riemsdijk, M. Birna","last_name":"van Riemsdijk"},{"full_name":"Warnier, Martijn","first_name":"Martijn","last_name":"Warnier"}],"publication_identifier":{"isbn":["978-1-4503-2738-1"]},"date_created":"2020-08-06T15:21:45Z","status":"public"},{"department":[{"_id":"63"},{"_id":"541"}],"publication_identifier":{"issn":["2167-8375"]},"title":"Signaling Competition and Social Welfare","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z","doi":"10.1145/2560766","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Smorodinsky","first_name":"Rann","full_name":"Smorodinsky, Rann"},{"last_name":"Tennenholtz","first_name":"Moshe","full_name":"Tennenholtz, Moshe"}],"publisher":"ACM","keyword":["Competition","efficiency","equilibrium","market","social welfare"],"publication":"ACM Trans. Econ. Comput.","status":"public","date_created":"2020-08-06T15:21:55Z","volume":2,"extern":"1","user_id":"83983","type":"journal_article","citation":{"ieee":"G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and Social Welfare,” ACM Trans. Econ. Comput., vol. 2, no. 1, pp. 1:1-1:16, 2014.","short":"G. Polevoy, R. Smorodinsky, M. Tennenholtz, ACM Trans. Econ. Comput. 2 (2014) 1:1-1:16.","mla":"Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.” ACM Trans. Econ. Comput., vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:10.1145/2560766.","bibtex":"@article{Polevoy_Smorodinsky_Tennenholtz_2014, title={Signaling Competition and Social Welfare}, volume={2}, DOI={10.1145/2560766}, 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} }","ama":"Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare. ACM Trans Econ Comput. 2014;2(1):1:1-1:16. doi:10.1145/2560766","apa":"Polevoy, G., Smorodinsky, R., & Tennenholtz, M. (2014). Signaling Competition and Social Welfare. ACM Trans. Econ. Comput., 2(1), 1:1-1:16. https://doi.org/10.1145/2560766","chicago":"Polevoy, Gleb, Rann Smorodinsky, and Moshe Tennenholtz. “Signaling Competition and Social Welfare.” ACM Trans. Econ. Comput. 2, no. 1 (2014): 1:1-1:16. https://doi.org/10.1145/2560766."},"year":"2014","page":"1:1-1:16","intvolume":" 2","_id":"17662","issue":"1"},{"place":"Universität Paderborn","user_id":"15415","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12816","relation":"confirmation"}]},"title":"Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit","department":[{"_id":"63"}],"author":[{"last_name":"Petring","full_name":"Petring, Ralf","first_name":"Ralf"}],"date_created":"2020-09-04T13:20:12Z","status":"public","date_updated":"2022-01-06T06:53:57Z","_id":"19039","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. Universität Paderborn, 2014.","apa":"Petring, R. (2014). Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit. Universität Paderborn.","ama":"Petring R. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. Universität Paderborn; 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} }","mla":"Petring, Ralf. Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit. 2014.","short":"R. Petring, Multi-Algorithmen-Rendering: Darstellung Heterogener 3-D-Szenen in Echtzeit, Universität Paderborn, 2014.","ieee":"R. Petring, Multi-Algorithmen-Rendering: Darstellung heterogener 3-D-Szenen in Echtzeit. Universität Paderborn, 2014."},"type":"dissertation","year":"2014"},{"_id":"451","type":"conference","citation":{"ieee":"M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.","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.","bibtex":"@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={10.1007/978-3-662-44803-8_10}, 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} }","mla":"Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.","chicago":"Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10.","apa":"Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121). https://doi.org/10.1007/978-3-662-44803-8_10","ama":"Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121. doi:10.1007/978-3-662-44803-8_10"},"year":"2014","page":"110-121","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."}],"ddc":["040"],"user_id":"477","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file_date_updated":"2018-03-16T11:25:10Z","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","file":[{"date_updated":"2018-03-16T11:25:10Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":283266,"file_id":"1344","creator":"florida","access_level":"closed","file_name":"451-DRS14.pdf","date_created":"2018-03-16T11:25:10Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:20Z","date_updated":"2022-01-06T07:01:07Z","doi":"10.1007/978-3-662-44803-8_10","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"title":"Budget-restricted utility games with ordered strategic decisions","department":[{"_id":"63"},{"_id":"541"}],"editor":[{"full_name":"Lavi, Ron","first_name":"Ron","last_name":"Lavi"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"file_date_updated":"2018-03-16T11:24:40Z","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","author":[{"full_name":"Abshoff, Sebastian","first_name":"Sebastian","last_name":"Abshoff"},{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"file":[{"file_size":84783,"file_id":"1343","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-16T11:24:40Z","success":1,"relation":"main_file","file_name":"452-title_multilevel-sagt.pdf","date_created":"2018-03-16T11:24:40Z","access_level":"closed"}],"date_created":"2017-10-17T12:42:20Z","status":"public","has_accepted_license":"1","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"}],"ddc":["040"],"user_id":"15415","page":"294","year":"2014","citation":{"mla":"Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, 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} }","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (p. 294).","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.","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."},"type":"conference","_id":"452","department":[{"_id":"63"},{"_id":"541"}],"editor":[{"last_name":"Lavi","first_name":"Ron","full_name":"Lavi, Ron"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Brief Announcement: A Model for Multilevel Network Games","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:08Z"},{"title":"Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"date_updated":"2022-01-06T07:01:09Z","doi":"10.1007/978-3-319-13129-0_3","series_title":"LNCS","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"14052","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","file_date_updated":"2018-03-16T11:24:11Z","author":[{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"file":[{"relation":"main_file","success":1,"date_updated":"2018-03-16T11:24:11Z","content_type":"application/pdf","creator":"florida","file_id":"1342","file_size":324307,"access_level":"closed","date_created":"2018-03-16T11:24:11Z","file_name":"453-WINE14FGS.pdf"}],"date_created":"2017-10-17T12:42:20Z","status":"public","has_accepted_license":"1","_id":"453","page":"30-43","citation":{"mla":"Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.","bibtex":"@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={10.1007/978-3-319-13129-0_3}, 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} }","chicago":"Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.","apa":"Feldotto, M., Gairing, M., & Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 30–43). https://doi.org/10.1007/978-3-319-13129-0_3","ama":"Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3","ieee":"M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.","short":"M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43."},"year":"2014","type":"conference"},{"department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Approximate pure Nash equilibria in weighted congestion games","series_title":"LIPIcs","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:09Z","doi":"10.4230/LIPIcs.APPROX-RANDOM.2014.242","file":[{"file_name":"455-HKS14.pdf","date_created":"2018-03-16T11:23:40Z","access_level":"closed","file_id":"1341","creator":"florida","file_size":512712,"success":1,"relation":"main_file","date_updated":"2018-03-16T11:23:40Z","content_type":"application/pdf"}],"author":[{"last_name":"Hansknecht","full_name":"Hansknecht, Christoph","first_name":"Christoph"},{"first_name":"Max","full_name":"Klimm, Max","last_name":"Klimm"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"publication":"Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","file_date_updated":"2018-03-16T11:23:40Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:20Z","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"}],"user_id":"477","ddc":["040"],"citation":{"bibtex":"@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={10.4230/LIPIcs.APPROX-RANDOM.2014.242}, 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} }","mla":"Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57, doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.","chicago":"Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.","apa":"Hansknecht, C., Klimm, M., & Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (pp. 242–257). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242","ama":"Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LIPIcs. ; 2014:242-257. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242","ieee":"C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.","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."},"year":"2014","type":"conference","page":"242 - 257","_id":"455"},{"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]."}],"user_id":"477","ddc":["040"],"file":[{"date_created":"2018-03-16T11:22:57Z","file_name":"456-WINE14final.pdf","access_level":"closed","file_size":377378,"creator":"florida","file_id":"1340","content_type":"application/pdf","date_updated":"2018-03-16T11:22:57Z","success":1,"relation":"main_file"}],"file_date_updated":"2018-03-16T11:22:57Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","author":[{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"first_name":"Grammateia","full_name":"Kotsialou, Grammateia","last_name":"Kotsialou"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:21Z","has_accepted_license":"1","status":"public","_id":"456","page":"480 - 485","type":"conference","year":"2014","citation":{"apa":"Gairing, M., Kotsialou, G., & Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 480–485). https://doi.org/10.1007/978-3-319-13129-0_43","ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:480-485. doi:10.1007/978-3-319-13129-0_43","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 480–85. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43.","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={10.1007/978-3-319-13129-0_43}, 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} }","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43.","short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485."},"title":"Approximate pure Nash equilibria in Social Context Congestion Games","department":[{"_id":"541"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T07:01:10Z","doi":"10.1007/978-3-319-13129-0_43","series_title":"LNCS","language":[{"iso":"eng"}]},{"title":"Algorithmic Aspects of Resource Management in the Cloud","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"doi":"10.1007/978-3-319-09620-9_1","date_updated":"2022-01-06T07:01:14Z","series_title":"LNCS","user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","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."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:21Z","file":[{"success":1,"relation":"main_file","date_updated":"2018-03-16T11:21:54Z","content_type":"application/pdf","creator":"florida","file_id":"1338","file_size":274496,"access_level":"closed","file_name":"459-SIROCCO2014.pdf","date_created":"2018-03-16T11:21:54Z"}],"author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"last_name":"Markarian","id":"37612","first_name":"Christine","full_name":"Markarian, Christine"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","file_date_updated":"2018-03-16T11:21:54Z","_id":"459","type":"conference","year":"2014","citation":{"ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","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.","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={10.1007/978-3-319-09620-9_1}, 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} }","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1."},"page":"1-13"},{"year":"2014","type":"conference","citation":{"ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","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.","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={10.5220/0005110406250630}, 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.” Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–30, doi:10.5220/0005110406250630.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630.","apa":"Feldotto, M., & Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014) (pp. 625–630). https://doi.org/10.5220/0005110406250630","ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014). ; 2014:625-630. doi:10.5220/0005110406250630"},"page":"625-630","_id":"462","date_updated":"2022-01-06T07:01:15Z","doi":"10.5220/0005110406250630","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-16T11:21:24Z","content_type":"application/pdf","file_id":"1337","creator":"florida","file_size":993721,"access_level":"closed","date_created":"2018-03-16T11:21:24Z","file_name":"462-FS2014SIMULTECH.pdf"}],"author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"file_date_updated":"2018-03-16T11:21:24Z","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)","department":[{"_id":"63"},{"_id":"541"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:22Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"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"}],"user_id":"14052","ddc":["040"],"title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games"},{"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:09Z","file":[{"access_level":"closed","file_name":"395-WINE2014ACJS.pdf","date_created":"2018-03-20T06:59:20Z","date_updated":"2018-03-20T06:59:20Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":161479,"file_id":"1382","creator":"florida"}],"author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"file_date_updated":"2018-03-20T06:59:20Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","user_id":"15415","ddc":["040"],"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."}],"type":"conference","citation":{"mla":"Abshoff, Sebastian, et al. “Multilevel Network Games.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–40, doi:10.1007/978-3-319-13129-0_36.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Multilevel Network Games}, DOI={10.1007/978-3-319-13129-0_36}, 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} }","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Multilevel Network Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:435-440. doi:10.1007/978-3-319-13129-0_36","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Multilevel Network Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 435–440). https://doi.org/10.1007/978-3-319-13129-0_36","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Multilevel Network Games,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 435–440.","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."},"year":"2014","page":"435-440","_id":"395","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Multilevel Network Games","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-13129-0_36","date_updated":"2022-01-06T06:59:59Z"},{"date_created":"2017-10-17T12:42:12Z","has_accepted_license":"1","status":"public","publication":"Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P)","file_date_updated":"2018-03-16T11:34:00Z","author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"file":[{"content_type":"application/pdf","date_updated":"2018-03-16T11:34:00Z","success":1,"relation":"main_file","file_size":472321,"creator":"florida","file_id":"1361","access_level":"closed","date_created":"2018-03-16T11:34:00Z","file_name":"412-FSG2014P2P.pdf"}],"ddc":["040"],"user_id":"14052","abstract":[{"lang":"eng","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."}],"page":"1-10","type":"conference","year":"2014","citation":{"ieee":"M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.","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.","mla":"Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.","bibtex":"@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300}, 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} }","ama":"Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300","apa":"Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp. 1–10). https://doi.org/10.1109/P2P.2014.6934300","chicago":"Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300."},"_id":"412","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","external_id":{"arxiv":["1408.0395"]},"doi":"10.1109/P2P.2014.6934300","date_updated":"2022-01-06T07:00:20Z"},{"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:15Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file":[{"date_updated":"2018-03-16T11:31:29Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":792106,"creator":"florida","file_id":"1356","access_level":"closed","date_created":"2018-03-16T11:31:29Z","file_name":"431-Peter_Kling_PhDThesis_01.pdf"}],"author":[{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"}],"publisher":"Universität Paderborn","file_date_updated":"2018-03-16T11:31:29Z","department":[{"_id":"63"}],"user_id":"477","ddc":["040"],"title":"Energy-efficient Scheduling Algorithms","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"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"2014","citation":{"bibtex":"@book{Kling_2014, title={Energy-efficient Scheduling Algorithms}, publisher={Universität Paderborn}, author={Kling, Peter}, year={2014} }","mla":"Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn, 2014.","apa":"Kling, P. (2014). Energy-efficient Scheduling Algorithms. Universität Paderborn.","ama":"Kling P. Energy-Efficient Scheduling Algorithms. Universität Paderborn; 2014.","chicago":"Kling, Peter. Energy-Efficient Scheduling Algorithms. Universität Paderborn, 2014.","ieee":"P. Kling, Energy-efficient Scheduling Algorithms. Universität Paderborn, 2014.","short":"P. Kling, Energy-Efficient Scheduling Algorithms, Universität Paderborn, 2014."},"type":"dissertation","_id":"431","date_updated":"2022-01-06T07:00:52Z"},{"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"}],"ddc":["040"],"user_id":"477","author":[{"last_name":"Antoniadis","first_name":"Antonios","full_name":"Antoniadis, Antonios"},{"last_name":"Barcelo","full_name":"Barcelo, Neal","first_name":"Neal"},{"first_name":"Mario","full_name":"Consuegra, Mario","last_name":"Consuegra"},{"last_name":"Kling","full_name":"Kling, Peer","first_name":"Peer"},{"last_name":"Nugent","full_name":"Nugent, Michael","first_name":"Michael"},{"first_name":"Kirk","full_name":"Pruhs, Kirk","last_name":"Pruhs"},{"first_name":"Michele","full_name":"Scquizzato, Michele","last_name":"Scquizzato"}],"file_date_updated":"2018-03-16T11:30:23Z","publication":"Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)","file":[{"access_level":"closed","file_name":"435-Kling_C2_STACS2014.pdf","date_created":"2018-03-16T11:30:23Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-16T11:30:23Z","file_id":"1354","creator":"florida","file_size":525851}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:16Z","_id":"435","year":"2014","type":"conference","citation":{"mla":"Antoniadis, Antonios, et al. “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.” Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74, doi:10.4230/LIPIcs.STACS.2014.63.","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={10.4230/LIPIcs.STACS.2014.63}, 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} }","ama":"Antoniadis A, Barcelo N, Consuegra M, et al. Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In: Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs. ; 2014:63--74. doi:10.4230/LIPIcs.STACS.2014.63","apa":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., & Scquizzato, M. (2014). Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 63--74). https://doi.org/10.4230/LIPIcs.STACS.2014.63","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 Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 63--74. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.STACS.2014.63.","ieee":"A. Antoniadis et al., “Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules,” in Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), 2014, pp. 63--74.","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."},"page":"63--74","title":"Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_updated":"2022-01-06T07:00:58Z","doi":"10.4230/LIPIcs.STACS.2014.63","series_title":"LIPIcs","language":[{"iso":"eng"}]},{"publication_status":"published","volume":8243,"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642453458","9783642453465"]},"editor":[{"last_name":"Flocchini","first_name":"Paola","full_name":"Flocchini, Paola"},{"last_name":"Gao","full_name":"Gao, Jie","first_name":"Jie"},{"first_name":"Evangelos","full_name":"Kranakis, Evangelos","last_name":"Kranakis"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-27T10:31:57Z","status":"public","department":[{"_id":"63"}],"publisher":"Springer","title":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013","user_id":"15415","place":"Berlin, Heidelberg","type":"book_editor","year":"2014","citation":{"ieee":"P. Flocchini, J. Gao, E. Kranakis, and 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, vol. 8243. Berlin, Heidelberg: Springer, 2014.","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.","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={10.1007/978-3-642-45346-5}, publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science} }","mla":"Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.","chicago":"Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm 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. Vol. 8243. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.","apa":"Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5","ama":"Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5"},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-45346-5","_id":"16870","date_updated":"2022-01-06T06:52:58Z","intvolume":" 8243"},{"status":"public","date_created":"2020-04-03T07:58:53Z","publication_identifier":{"isbn":["9783319144719","9783319144726"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","author":[{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"user_id":"15415","title":"Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots","place":"Cham","language":[{"iso":"eng"}],"year":"2014","type":"book_chapter","citation":{"apa":"Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17","ama":"Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In: Lecture Notes in Computer Science. Cham; 2014. doi:10.1007/978-3-319-14472-6_17","chicago":"Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” In Lecture Notes in Computer Science. Cham, 2014. https://doi.org/10.1007/978-3-319-14472-6_17.","mla":"Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science, 2014, doi:10.1007/978-3-319-14472-6_17.","bibtex":"@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots}, DOI={10.1007/978-3-319-14472-6_17}, 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.","ieee":"T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots,” in Lecture Notes in Computer Science, Cham, 2014."},"doi":"10.1007/978-3-319-14472-6_17","_id":"16394","date_updated":"2022-01-06T06:52:50Z"},{"language":[{"iso":"eng"}],"type":"book_chapter","citation":{"apa":"Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity. Cham. https://doi.org/10.1007/978-3-319-09620-9_16","ama":"Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc Networks. In: Structural Information and Communication Complexity. Cham; 2014. doi:10.1007/978-3-319-09620-9_16","chicago":"Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” In Structural Information and Communication Complexity. Cham, 2014. https://doi.org/10.1007/978-3-319-09620-9_16.","mla":"Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity, 2014, doi:10.1007/978-3-319-09620-9_16.","bibtex":"@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous Aggregation in Dynamic Ad-Hoc Networks}, DOI={10.1007/978-3-319-09620-9_16}, booktitle={Structural Information and Communication Complexity}, author={Abshoff, Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }","short":"S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Cham, 2014.","ieee":"S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic Ad-Hoc Networks,” in Structural Information and Communication Complexity, Cham, 2014."},"year":"2014","doi":"10.1007/978-3-319-09620-9_16","date_updated":"2022-01-06T06:52:50Z","_id":"16395","status":"public","date_created":"2020-04-03T09:00:16Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319096193","9783319096209"]},"publication_status":"published","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Structural Information and Communication Complexity","user_id":"15415","title":"Continuous Aggregation in Dynamic Ad-Hoc Networks","place":"Cham"},{"language":[{"iso":"eng"}],"citation":{"chicago":"Mertsching, Bärbel, Mohammad Divband Soorati, and Tobias Kotthauser. “Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds.” IEEE International Conference on Robotics and Biomimetics (ROBIO), 2013, 661–67.","apa":"Mertsching, B., Divband Soorati, M., & Kotthauser, T. (2013). Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds. IEEE International Conference on Robotics and Biomimetics (ROBIO), 661–667.","ama":"Mertsching B, Divband Soorati M, Kotthauser T. Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds. 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.” IEEE International Conference on Robotics and Biomimetics (ROBIO), 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} }","short":"B. Mertsching, M. Divband Soorati, T. Kotthauser, IEEE International Conference on Robotics and Biomimetics (ROBIO) (2013) 661–667.","ieee":"B. Mertsching, M. Divband Soorati, and T. Kotthauser, “Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds,” IEEE International Conference on Robotics and Biomimetics (ROBIO), pp. 661–667, 2013."},"year":"2013","type":"journal_article","page":"661-667","_id":"19981","date_updated":"2022-01-06T06:54:17Z","status":"public","date_created":"2020-10-12T13:21:53Z","author":[{"last_name":"Mertsching","first_name":"Bärbel","full_name":"Mertsching, Bärbel"},{"last_name":"Divband Soorati","first_name":"Mohammad","full_name":"Divband Soorati, Mohammad"},{"full_name":"Kotthauser, Tobias","first_name":"Tobias","last_name":"Kotthauser"}],"publication":"IEEE International Conference on Robotics and Biomimetics (ROBIO)","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","title":"Automatic Reconstruction of Polygonal Room Models from 3D Point Clouds"},{"_id":"20148","intvolume":" 75","date_updated":"2022-01-06T06:54:20Z","issue":"7","doi":"10.1007/s11538-013-9851-4 ","language":[{"iso":"eng"}],"page":"1181-1206","citation":{"ieee":"H. Hamann, I. Karsai, and T. Schmickl, “Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning,” Bulletin of Mathematical Biology, vol. 75, no. 7, pp. 1181–1206, 2013.","short":"H. Hamann, I. Karsai, T. Schmickl, Bulletin of Mathematical Biology 75 (2013) 1181–1206.","mla":"Hamann, Heiko, et al. “Time Delay Implies Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.” Bulletin of Mathematical Biology, vol. 75, no. 7, 2013, pp. 1181–206, doi:10.1007/s11538-013-9851-4 .","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={10.1007/s11538-013-9851-4 }, number={7}, journal={Bulletin of Mathematical Biology}, author={Hamann, Heiko and Karsai, Istvan and Schmickl, Thomas}, year={2013}, pages={1181–1206} }","ama":"Hamann H, Karsai I, Schmickl T. Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning. Bulletin of Mathematical Biology. 2013;75(7):1181-1206. doi:10.1007/s11538-013-9851-4 ","apa":"Hamann, H., Karsai, I., & Schmickl, T. (2013). Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning. Bulletin of Mathematical Biology, 75(7), 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 ","chicago":"Hamann, Heiko, Istvan Karsai, and Thomas Schmickl. “Time Delay Implies Cost on Task Switching: A Model to Investigate the Efficiency of Task Partitioning.” Bulletin of Mathematical Biology 75, no. 7 (2013): 1181–1206. https://doi.org/10.1007/s11538-013-9851-4 ."},"type":"journal_article","year":"2013","user_id":"15415","title":"Time delay implies cost on task switching: A model to investigate the efficiency of task partitioning","publication":"Bulletin of Mathematical Biology","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Karsai","first_name":"Istvan","full_name":"Karsai, Istvan"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"}],"date_created":"2020-10-21T08:41:17Z","status":"public","volume":75},{"user_id":"15415","title":"Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems","date_created":"2020-10-21T08:46:02Z","status":"public","volume":50,"department":[{"_id":"63"},{"_id":"238"}],"publication":"Chaos, Solitons & Fractals","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"},{"last_name":"Thenius","first_name":"Ronald","full_name":"Thenius, Ronald"},{"last_name":"Zahadat","first_name":"Payam","full_name":"Zahadat, Payam"}],"doi":"10.1016/j.chaos.2013.01.011","date_updated":"2022-01-06T06:54:20Z","_id":"20150","intvolume":" 50","language":[{"iso":"eng"}],"page":"100-114","year":"2013","citation":{"bibtex":"@article{Hamann_Schmickl_Stradner_Crailsheim_Thenius_Zahadat_2013, title={Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems}, volume={50}, DOI={10.1016/j.chaos.2013.01.011}, journal={Chaos, Solitons & 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} }","mla":"Hamann, Heiko, et al. “Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems.” Chaos, Solitons & Fractals, vol. 50, 2013, pp. 100–14, doi:10.1016/j.chaos.2013.01.011.","apa":"Hamann, H., Schmickl, T., Stradner, J., Crailsheim, K., Thenius, R., & Zahadat, P. (2013). Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems. Chaos, Solitons & Fractals, 50, 100–114. https://doi.org/10.1016/j.chaos.2013.01.011","ama":"Hamann H, Schmickl T, Stradner J, Crailsheim K, Thenius R, Zahadat P. Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems. Chaos, Solitons & Fractals. 2013;50:100-114. doi:10.1016/j.chaos.2013.01.011","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.” Chaos, Solitons & Fractals 50 (2013): 100–114. https://doi.org/10.1016/j.chaos.2013.01.011.","ieee":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, and P. Zahadat, “Algorithmic Requirements for Swarm Intelligence in Differently Coupled Collective Systems,” Chaos, Solitons & Fractals, vol. 50, pp. 100–114, 2013.","short":"H. Hamann, T. Schmickl, J. Stradner, K. Crailsheim, R. Thenius, P. Zahadat, Chaos, Solitons & Fractals 50 (2013) 100–114."},"type":"journal_article"},{"year":"2013","citation":{"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.","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 Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013), 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 Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013), 7835:579–88, 2013. https://doi.org/10.1007/978-3-642-37192-9_58.","ama":"Hamann H, Schmickl T, Stradner J, Schwarzer C, Michiels NK, Esparcia-Alcazar AI. Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In: Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013). Vol 7835. ; 2013:579-588. doi:10.1007/978-3-642-37192-9_58","apa":"Hamann, H., Schmickl, T., Stradner, J., Schwarzer, C., Michiels, N. K., & Esparcia-Alcazar, A. I. (2013). Virtual Spatiality in Agent Controllers: Encoding Compartmentalization. In Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013) (Vol. 7835, pp. 579–588). https://doi.org/10.1007/978-3-642-37192-9_58","bibtex":"@inproceedings{Hamann_Schmickl_Stradner_Schwarzer_Michiels_Esparcia-Alcazar_2013, title={Virtual Spatiality in Agent Controllers: Encoding Compartmentalization}, volume={7835}, DOI={10.1007/978-3-642-37192-9_58}, 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} }","mla":"Hamann, Heiko, et al. “Virtual Spatiality in Agent Controllers: Encoding Compartmentalization.” Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013), vol. 7835, 2013, pp. 579–88, doi:10.1007/978-3-642-37192-9_58."},"type":"conference","page":"579-588","language":[{"iso":"eng"}],"intvolume":" 7835","_id":"20151","date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/978-3-642-37192-9_58","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Schmickl","full_name":"Schmickl, Thomas","first_name":"Thomas"},{"last_name":"Stradner","first_name":"Jürgen","full_name":"Stradner, Jürgen"},{"last_name":"Schwarzer","full_name":"Schwarzer, Christopher","first_name":"Christopher"},{"last_name":"Michiels","full_name":"Michiels, Nico K.","first_name":"Nico K."},{"first_name":"Anna Isabel","full_name":"Esparcia-Alcazar, Anna Isabel","last_name":"Esparcia-Alcazar"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Applications of Evolutionary Computation - 16th European Conference (EvoApplications 2013)","volume":7835,"status":"public","date_created":"2020-10-21T08:53:30Z","title":"Virtual Spatiality in Agent Controllers: Encoding Compartmentalization","user_id":"15415"}]