[{"language":[{"iso":"eng"}],"type":"conference","citation":{"ama":"Hamann H, Wahby M, Schmickl T, et al. Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). ; 2015. doi:10.1109/ssci.2015.158","apa":"Hamann, H., Wahby, M., Schmickl, T., Zahadat, P., Hofstadler, D., Stoy, K., … Wojtaszek, P. (2015). Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids. In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15). https://doi.org/10.1109/ssci.2015.158","chicago":"Hamann, Heiko, Mostafa Wahby, Thomas Schmickl, Payam Zahadat, Daniel Hofstadler, Kasper Stoy, Sebastian Risi, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” In Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015. https://doi.org/10.1109/ssci.2015.158.","bibtex":"@inproceedings{Hamann_Wahby_Schmickl_Zahadat_Hofstadler_Stoy_Risi_Faina_Veenstra_Kernbach_et al._2015, title={Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids}, DOI={10.1109/ssci.2015.158}, booktitle={Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15)}, author={Hamann, Heiko and Wahby, Mostafa and Schmickl, Thomas and Zahadat, Payam and Hofstadler, Daniel and Stoy, Kasper and Risi, Sebastian and Faina, Andres and Veenstra, Frank and Kernbach, Serge and et al.}, year={2015} }","mla":"Hamann, Heiko, et al. “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids.” Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015, doi:10.1109/ssci.2015.158.","short":"H. Hamann, M. Wahby, T. Schmickl, P. Zahadat, D. Hofstadler, K. Stoy, S. Risi, A. Faina, F. Veenstra, S. Kernbach, I. Kuksin, O. Kernbach, P. Ayres, P. Wojtaszek, in: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015.","ieee":"H. Hamann et al., “Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids,” in Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE’15), 2015."},"year":"2015","_id":"19960","date_updated":"2022-01-06T06:54:17Z","doi":"10.1109/ssci.2015.158","publication":"Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE'15)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Wahby","first_name":"Mostafa","full_name":"Wahby, Mostafa"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"full_name":"Zahadat, Payam","first_name":"Payam","last_name":"Zahadat"},{"first_name":"Daniel","full_name":"Hofstadler, Daniel","last_name":"Hofstadler"},{"last_name":"Stoy","first_name":"Kasper","full_name":"Stoy, Kasper"},{"last_name":"Risi","full_name":"Risi, Sebastian","first_name":"Sebastian"},{"last_name":"Faina","first_name":"Andres","full_name":"Faina, Andres"},{"first_name":"Frank","full_name":"Veenstra, Frank","last_name":"Veenstra"},{"last_name":"Kernbach","first_name":"Serge","full_name":"Kernbach, Serge"},{"full_name":"Kuksin, Igor","first_name":"Igor","last_name":"Kuksin"},{"first_name":"Olga","full_name":"Kernbach, Olga","last_name":"Kernbach"},{"last_name":"Ayres","first_name":"Phil","full_name":"Ayres, Phil"},{"full_name":"Wojtaszek, Przemyslaw","first_name":"Przemyslaw","last_name":"Wojtaszek"}],"date_created":"2020-10-08T12:44:10Z","status":"public","publication_identifier":{"isbn":["9781479975600"]},"publication_status":"published","abstract":[{"text":"Besides the life-as-it-could-be driver of artificial life research there is also the concept of extending natural life by creating hybrids or mixed societies that are built from natural and artificial components. In this paper we motivate and present the research program of the project flora robotica. Our objective is to develop and to investigate closely linked symbiotic relationships between robots and natural plants and to explore the potentials of a plant-robot society able to produce architectural artifacts and living spaces. These robot-plant bio-hybrids create synergies that allow for new functions of plants and robots. They also create novel design opportunities for an architecture that fuses the design and construction phase. The bio-hybrid is an example of mixed societies between 'hard' artificial and 'wet' natural life, which enables an interaction between natural and artificial ecologies. They form an embodied, self-organizing, and distributed cognitive system which is supposed to grow and develop over long periods of time resulting in the creation of meaningful architectural structures. A key idea is to assign equal roles to robots and plants in order to create a highly integrated, symbiotic system. Besides the gain of knowledge, this project has the objective to create a bio-hybrid system with a defined function and application -- growing architectural artifacts.","lang":"eng"}],"user_id":"15415","title":"Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids"},{"publication":"Artificial Life","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"}],"publication_identifier":{"issn":["1064-5462","1530-9185"]},"publication_status":"published","date_created":"2020-10-08T14:36:25Z","status":"public","abstract":[{"text":"Recent approaches in evolutionary robotics (ER) propose to generate behavioral diversity in order to evolve desired behaviors more easily. These approaches require the definition of a behavioral distance, which often includes task-specific features and hence a priori knowledge. Alternative methods, which do not explicitly force selective pressure towards diversity (SPTD) but still generate it, are known from the field of artificial life, such as in artificial ecologies (AEs). In this study, we investigate how SPTD is generated without task-specific behavioral features or other forms of a priori knowledge and detect how methods of generating SPTD can be transferred from the domain of AE to ER. A promising finding is that in both types of systems, in systems from ER that generate behavioral diversity and also in the investigated speciation model, selective pressure is generated towards unpopulated regions of search space. In a simple case study we investigate the practical implications of these findings and point to options for transferring the idea of self-organizing SPTD in AEs to the domain of ER.","lang":"eng"}],"title":"Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity","user_id":"15415","page":"464-480","type":"journal_article","year":"2015","citation":{"short":"H. Hamann, Artificial Life (2015) 464–480.","ieee":"H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.","chicago":"Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, 464–80. https://doi.org/10.1162/artl_a_00186.","ama":"Hamann H. Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life. 2015:464-480. doi:10.1162/artl_a_00186","apa":"Hamann, H. (2015). Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity. Artificial Life, 464–480. https://doi.org/10.1162/artl_a_00186","bibtex":"@article{Hamann_2015, title={Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity}, DOI={10.1162/artl_a_00186}, journal={Artificial Life}, author={Hamann, Heiko}, year={2015}, pages={464–480} }","mla":"Hamann, Heiko. “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity.” Artificial Life, 2015, pp. 464–80, doi:10.1162/artl_a_00186."},"language":[{"iso":"eng"}],"_id":"19962","date_updated":"2022-01-06T06:54:17Z","doi":"10.1162/artl_a_00186"},{"publication_status":"published","publication_identifier":{"isbn":["9781631901003"]},"date_created":"2020-10-09T13:41:56Z","status":"public","publication":"Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"},{"last_name":"Weinhold","first_name":"Alexander","full_name":"Weinhold, Alexander"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"title":"Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings","user_id":"15415","abstract":[{"lang":"eng","text":"Aggregation is a crucial task in swarm robotics to ensure cooperation. We investigate the task of aggregation on an area specified indirectly by certain environmental features, here it is a light distribution. We extend the original BEECLUST algorithm, that implements an aggregation behavior, to an adaptive variant that automatically adapts to any light conditions. We compare these two control algorithms in a number of swarm robot experiments with different light conditions. The improved, adaptive variant is found to be significantly better in the tested setup."}],"year":"2015","citation":{"apa":"Wahby, M., Weinhold, A., & Hamann, H. (2015). Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS). https://doi.org/10.4108/eai.3-12-2015.2262877","ama":"Wahby M, Weinhold A, Hamann H. Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings. In: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS). ; 2015. doi:10.4108/eai.3-12-2015.2262877","chicago":"Wahby, Mostafa, Alexander Weinhold, and Heiko Hamann. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” In Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015. https://doi.org/10.4108/eai.3-12-2015.2262877.","mla":"Wahby, Mostafa, et al. “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings.” Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015, doi:10.4108/eai.3-12-2015.2262877.","bibtex":"@inproceedings{Wahby_Weinhold_Hamann_2015, title={Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings}, DOI={10.4108/eai.3-12-2015.2262877}, booktitle={Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)}, author={Wahby, Mostafa and Weinhold, Alexander and Hamann, Heiko}, year={2015} }","short":"M. Wahby, A. Weinhold, H. Hamann, in: Proceedings of the 9th EAI International Conference on Bio-Inspired Information and Communications Technologies (Formerly BIONETICS), 2015.","ieee":"M. Wahby, A. Weinhold, and H. Hamann, “Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings,” in Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS), 2015."},"type":"conference","language":[{"iso":"eng"}],"doi":"10.4108/eai.3-12-2015.2262877","_id":"19966","date_updated":"2022-01-06T06:54:17Z"},{"status":"public","date_created":"2020-10-09T13:50:38Z","author":[{"first_name":"Mostafa","full_name":"Wahby, Mostafa","last_name":"Wahby"},{"first_name":"Mohammad","full_name":"Divband Soorati, Mohammad","last_name":"Divband Soorati"},{"last_name":"von Mammen","first_name":"Sebastian","full_name":"von Mammen, Sebastian"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings. 25. Computational Intelligence Workshop","title":"Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion","user_id":"15415","year":"2015","type":"conference","citation":{"ieee":"M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion,” in Proceedings. 25. Computational Intelligence Workshop, 2015.","short":"M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings. 25. Computational Intelligence Workshop, 2015.","bibtex":"@inproceedings{Wahby_Divband Soorati_von Mammen_Hamann_2015, title={Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion}, booktitle={Proceedings. 25. Computational Intelligence Workshop}, author={Wahby, Mostafa and Divband Soorati, Mohammad and von Mammen, Sebastian and Hamann, Heiko}, year={2015} }","mla":"Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” Proceedings. 25. Computational Intelligence Workshop, 2015.","apa":"Wahby, M., Divband Soorati, M., von Mammen, S., & Hamann, H. (2015). Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In Proceedings. 25. Computational Intelligence Workshop.","ama":"Wahby M, Divband Soorati M, von Mammen S, Hamann H. Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion. In: Proceedings. 25. Computational Intelligence Workshop. ; 2015.","chicago":"Wahby, Mostafa, Mohammad Divband Soorati, Sebastian von Mammen, and Heiko Hamann. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion.” In Proceedings. 25. Computational Intelligence Workshop, 2015."},"language":[{"iso":"eng"}],"_id":"19967","date_updated":"2022-01-06T06:54:17Z"},{"abstract":[{"text":"Fitness function design is known to be a critical feature of the evolutionary-robotics approach. Potentially, the complexity of evolving a successful controller for a given task can be reduced by integrating a priori knowledge into the fitness function which complicates the comparability of studies in evolutionary robotics. Still, there are only few publications that study the actual effects of different fitness functions on the robot's performance. In this paper, we follow the fitness function classification of Nelson et al. (2009) and investigate a selection of four classes of fitness functions that require different degrees of a priori knowledge. The robot controllers are evolved in simulation using NEAT and we investigate different tasks including obstacle avoidance and (periodic) goal homing. The best evolved controllers were then post-evaluated by examining their potential for adaptation, determining their convergence rates, and using cross-comparisons based on the different fitness function classes. The results confirm that the integration of more a priori knowledge can simplify a task and show that more attention should be paid to fitness function classes when comparing different studies.","lang":"eng"}],"user_id":"15415","title":"The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Divband Soorati","first_name":"Mohammad","full_name":"Divband Soorati, Mohammad"}],"publisher":"ACM","publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-12T13:12:25Z","_id":"19980","date_updated":"2022-01-06T06:54:17Z","doi":"10.1145/2739480.2754676","language":[{"iso":"eng"}],"citation":{"short":"H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.","ieee":"H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 2015, pp. 153–160.","chicago":"Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), 153–60. ACM, 2015. https://doi.org/10.1145/2739480.2754676.","ama":"Hamann H, Divband Soorati M. The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015). ACM; 2015:153-160. doi:10.1145/2739480.2754676","apa":"Hamann, H., & Divband Soorati, M. (2015). The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) (pp. 153–160). ACM. https://doi.org/10.1145/2739480.2754676","bibtex":"@inproceedings{Hamann_Divband Soorati_2015, title={The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge}, DOI={10.1145/2739480.2754676}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)}, publisher={ACM}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2015}, pages={153–160} }","mla":"Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–60, doi:10.1145/2739480.2754676."},"type":"conference","year":"2015","page":"153-160"},{"language":[{"iso":"eng"}],"page":"174","type":"conference","citation":{"chicago":"Hamann, Heiko, Thomas Schmickl, and Payam Zahadat. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” In 13th European Conference on Artificial Life (ECAL 2015), 174. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch036.","apa":"Hamann, H., Schmickl, T., & Zahadat, P. (2015). Evolving Collective Behaviors With Diverse But Predictable Sensor States. In 13th European Conference on Artificial Life (ECAL 2015) (p. 174). MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch036","ama":"Hamann H, Schmickl T, Zahadat P. Evolving Collective Behaviors With Diverse But Predictable Sensor States. In: 13th European Conference on Artificial Life (ECAL 2015). MIT Press; 2015:174. doi:10.7551/978-0-262-33027-5-ch036","bibtex":"@inproceedings{Hamann_Schmickl_Zahadat_2015, title={Evolving Collective Behaviors With Diverse But Predictable Sensor States}, DOI={10.7551/978-0-262-33027-5-ch036}, booktitle={13th European Conference on Artificial Life (ECAL 2015)}, publisher={MIT Press}, author={Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}, year={2015}, pages={174} }","mla":"Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable Sensor States.” 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174, doi:10.7551/978-0-262-33027-5-ch036.","short":"H. Hamann, T. Schmickl, P. Zahadat, in: 13th European Conference on Artificial Life (ECAL 2015), MIT Press, 2015, p. 174.","ieee":"H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With Diverse But Predictable Sensor States,” in 13th European Conference on Artificial Life (ECAL 2015), 2015, p. 174."},"year":"2015","doi":"10.7551/978-0-262-33027-5-ch036","date_updated":"2022-01-06T06:54:17Z","_id":"19988","date_created":"2020-10-13T08:50:38Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"13th European Conference on Artificial Life (ECAL 2015)","publisher":"MIT Press","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"full_name":"Zahadat, Payam","first_name":"Payam","last_name":"Zahadat"}],"user_id":"15415","title":"Evolving Collective Behaviors With Diverse But Predictable Sensor States"},{"user_id":"15415","title":"Probabilistic Modeling of Swarming Systems","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Nikolaus","full_name":"Correll, Nikolaus","last_name":"Correll"},{"full_name":"Kacprzyk, Janusz","first_name":"Janusz","last_name":"Kacprzyk"},{"last_name":"Pedrycz","first_name":"Witold","full_name":"Pedrycz, Witold"}],"publisher":"Springer","department":[{"_id":"63"},{"_id":"238"}],"publication":"Springer Handbook of Computational Intelligence","status":"public","date_created":"2020-10-13T09:04:19Z","date_updated":"2022-01-06T06:54:17Z","_id":"19989","doi":"10.1007/978-3-662-43505-2_74","language":[{"iso":"eng"}],"year":"2015","citation":{"short":"H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.","ieee":"H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling of Swarming Systems,” in Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.","chicago":"Hamann, Heiko, Nikolaus Correll, Janusz Kacprzyk, and Witold Pedrycz. “Probabilistic Modeling of Swarming Systems.” In Springer Handbook of Computational Intelligence, 1423–31. Springer, 2015. https://doi.org/10.1007/978-3-662-43505-2_74.","ama":"Hamann H, Correll N, Kacprzyk J, Pedrycz W. Probabilistic Modeling of Swarming Systems. In: Springer Handbook of Computational Intelligence. Springer; 2015:1423-1431. doi:10.1007/978-3-662-43505-2_74","apa":"Hamann, H., Correll, N., Kacprzyk, J., & Pedrycz, W. (2015). Probabilistic Modeling of Swarming Systems. In Springer Handbook of Computational Intelligence (pp. 1423–1431). Springer. https://doi.org/10.1007/978-3-662-43505-2_74","bibtex":"@inbook{Hamann_Correll_Kacprzyk_Pedrycz_2015, title={Probabilistic Modeling of Swarming Systems}, DOI={10.1007/978-3-662-43505-2_74}, booktitle={Springer Handbook of Computational Intelligence}, publisher={Springer}, author={Hamann, Heiko and Correll, Nikolaus and Kacprzyk, Janusz and Pedrycz, Witold}, year={2015}, pages={1423–1431} }","mla":"Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.” Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–31, doi:10.1007/978-3-662-43505-2_74."},"type":"book_chapter","page":"1423-1431"},{"date_created":"2020-10-13T09:09:20Z","status":"public","publication":"First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Ding","first_name":"Hongli","full_name":"Ding, Hongli"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"title":"Dependability in Swarm Robotics: Error Detection and Correction","user_id":"15415","type":"conference","year":"2015","citation":{"short":"H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","ieee":"H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection and Correction,” in First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","ama":"Ding H, Hamann H. Dependability in Swarm Robotics: Error Detection and Correction. In: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015). ; 2015.","apa":"Ding, H., & Hamann, H. (2015). Dependability in Swarm Robotics: Error Detection and Correction. In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015).","chicago":"Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” In First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.","bibtex":"@inproceedings{Ding_Hamann_2015, title={Dependability in Swarm Robotics: Error Detection and Correction}, booktitle={First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015)}, author={Ding, Hongli and Hamann, Heiko}, year={2015} }","mla":"Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection and Correction.” First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:17Z","_id":"19990"},{"language":[{"iso":"eng"}],"page":"201-217","citation":{"short":"H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, F. Wotawa, in: Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.","ieee":"H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa, “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms,” in Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.","chicago":"Hamann, Heiko, Thomas Schmickl, Daniela Kengyel, Payam Zahadat, Gerald Radspieler, and Franz Wotawa. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” In Principles and Practice of Multi-Agent Systems (PRIMA 2015), 201–17, 2015.","apa":"Hamann, H., Schmickl, T., Kengyel, D., Zahadat, P., Radspieler, G., & Wotawa, F. (2015). Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In Principles and Practice of Multi-Agent Systems (PRIMA 2015) (pp. 201–217).","ama":"Hamann H, Schmickl T, Kengyel D, Zahadat P, Radspieler G, Wotawa F. Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms. In: Principles and Practice of Multi-Agent Systems (PRIMA 2015). ; 2015:201-217.","bibtex":"@inproceedings{Hamann_Schmickl_Kengyel_Zahadat_Radspieler_Wotawa_2015, title={Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms}, booktitle={Principles and Practice of Multi-Agent Systems (PRIMA 2015)}, author={Hamann, Heiko and Schmickl, Thomas and Kengyel, Daniela and Zahadat, Payam and Radspieler, Gerald and Wotawa, Franz}, year={2015}, pages={201–217} }","mla":"Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.” Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–17."},"year":"2015","type":"conference","date_updated":"2022-01-06T06:54:17Z","_id":"19991","publication":"Principles and Practice of Multi-Agent Systems (PRIMA 2015)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Thomas","full_name":"Schmickl, Thomas","last_name":"Schmickl"},{"full_name":"Kengyel, Daniela","first_name":"Daniela","last_name":"Kengyel"},{"first_name":"Payam","full_name":"Zahadat, Payam","last_name":"Zahadat"},{"first_name":"Gerald","full_name":"Radspieler, Gerald","last_name":"Radspieler"},{"last_name":"Wotawa","full_name":"Wotawa, Franz","first_name":"Franz"}],"date_created":"2020-10-13T09:24:32Z","status":"public","user_id":"15415","title":"Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms"},{"page":"153-176","year":"2015","citation":{"ieee":"G. Valentini and H. Hamann, “Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes,” Swarm Intelligence, pp. 153–176, 2015.","short":"G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176.","bibtex":"@article{Valentini_Hamann_2015, title={Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes}, DOI={10.1007/s11721-015-0108-8}, journal={Swarm Intelligence}, author={Valentini, Gabriele and Hamann, Heiko}, year={2015}, pages={153–176} }","mla":"Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, pp. 153–76, doi:10.1007/s11721-015-0108-8.","chicago":"Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood Sizes.” Swarm Intelligence, 2015, 153–76. https://doi.org/10.1007/s11721-015-0108-8.","ama":"Valentini G, Hamann H. Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence. 2015:153-176. doi:10.1007/s11721-015-0108-8","apa":"Valentini, G., & Hamann, H. (2015). Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes. Swarm Intelligence, 153–176. https://doi.org/10.1007/s11721-015-0108-8"},"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s11721-015-0108-8","date_updated":"2022-01-06T06:54:17Z","_id":"19992","publication_identifier":{"issn":["1935-3812","1935-3820"]},"publication_status":"published","date_created":"2020-10-13T09:27:48Z","status":"public","publication":"Swarm Intelligence","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"}],"title":"Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes","user_id":"15415"},{"user_id":"15415","title":"Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off","author":[{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"full_name":"Valentini, Gabriele","first_name":"Gabriele","last_name":"Valentini"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)","status":"public","date_created":"2020-10-15T12:29:26Z","date_updated":"2022-01-06T06:54:18Z","_id":"20005","language":[{"iso":"eng"}],"type":"conference","citation":{"ama":"Dorigo M, Hamann H, Valentini G. Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015). ; 2015.","apa":"Dorigo, M., Hamann, H., & Valentini, G. (2015). Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015).","chicago":"Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.","mla":"Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.","bibtex":"@inproceedings{Dorigo_Hamann_Valentini_2015, title={Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}, booktitle={Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }","short":"M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.","ieee":"M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015."},"year":"2015"},{"year":"2015","citation":{"ieee":"M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions in a robot swarm,” in AAAI-15 Video Proceedings, 2015.","short":"M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.","bibtex":"@inproceedings{Dorigo_Hamann_Valentini_2015, title={Self-organized collective decisions in a robot swarm}, booktitle={AAAI-15 Video Proceedings}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }","mla":"Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.” AAAI-15 Video Proceedings, 2015.","apa":"Dorigo, M., Hamann, H., & Valentini, G. (2015). Self-organized collective decisions in a robot swarm. In AAAI-15 Video Proceedings.","ama":"Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a robot swarm. In: AAAI-15 Video Proceedings. ; 2015.","chicago":"Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective Decisions in a Robot Swarm.” In AAAI-15 Video Proceedings, 2015."},"type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:18Z","_id":"20006","status":"public","date_created":"2020-10-15T12:38:13Z","author":[{"full_name":"Dorigo, Marco","first_name":"Marco","last_name":"Dorigo"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"AAAI-15 Video Proceedings","title":"Self-organized collective decisions in a robot swarm","user_id":"15415"},{"author":[{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","file_date_updated":"2018-03-21T09:33:11Z","file":[{"file_name":"266-p343-markarian.pdf","date_created":"2018-03-21T09:33:11Z","access_level":"closed","file_id":"1478","creator":"florida","file_size":679580,"relation":"main_file","success":1,"date_updated":"2018-03-21T09:33:11Z","content_type":"application/pdf"}],"status":"public","has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:41:44Z","abstract":[{"lang":"eng","text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". "}],"title":"Online Resource Leasing","ddc":["040"],"user_id":"15504","type":"conference","year":"2015","citation":{"chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.","apa":"Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454","ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ; 2015:343-344. doi:10.1145/2767386.2767454","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={10.1145/2767386.2767454}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344."},"page":"343-344","_id":"266","date_updated":"2022-01-06T06:57:22Z","doi":"10.1145/2767386.2767454"},{"ddc":["040"],"title":"Online Resource Leasing","user_id":"15415","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656"}]},"file_date_updated":"2018-03-21T09:33:41Z","department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"}],"file":[{"file_name":"267-Dissertation_-_Markarian.pdf","date_created":"2018-03-21T09:33:41Z","access_level":"closed","file_size":1328685,"creator":"florida","file_id":"1479","date_updated":"2018-03-21T09:33:41Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_created":"2017-10-17T12:41:44Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:57:26Z","_id":"267","type":"dissertation","year":"2015","citation":{"short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.","ieee":"C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.","chicago":"Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015.","ama":"Markarian C. Online Resource Leasing. Universität Paderborn; 2015.","apa":"Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.","bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","mla":"Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"doi":"10.1145/2614687","date_updated":"2022-01-06T06:59:04Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","abstract":[{"text":"We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.","lang":"eng"}],"volume":3,"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:54Z","author":[{"last_name":"Caragiannis","first_name":"Ioannis","full_name":"Caragiannis, Ioannis"},{"full_name":"Fanelli, Angelo","first_name":"Angelo","last_name":"Fanelli"},{"first_name":"Nick","full_name":"Gravin, Nick","last_name":"Gravin"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"publisher":"ACM","file_date_updated":"2018-03-20T07:40:55Z","publication":"Transactions on Economics and Computation","file":[{"content_type":"application/pdf","date_updated":"2018-03-20T07:40:55Z","relation":"main_file","success":1,"file_size":260503,"file_id":"1433","creator":"florida","access_level":"closed","date_created":"2018-03-20T07:40:55Z","file_name":"320-a2-caragiannis.pdf"}],"article_number":"2","issue":"1","_id":"320","intvolume":" 3","citation":{"ieee":"I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015).","bibtex":"@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={10.1145/2614687}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }","mla":"Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.","chicago":"Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation 3, no. 1 (2015). https://doi.org/10.1145/2614687.","ama":"Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687","apa":"Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation, 3(1). https://doi.org/10.1145/2614687"},"type":"journal_article","year":"2015"},{"title":"Budget Games with priced strategies","user_id":"14052","author":[{"last_name":"Pautz","first_name":"Jannis","full_name":"Pautz, Jannis"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:41:53Z","date_updated":"2022-01-06T06:59:01Z","_id":"316","year":"2015","type":"bachelorsthesis","citation":{"short":"J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.","ieee":"J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015.","ama":"Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015.","apa":"Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn.","chicago":"Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.","mla":"Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.","bibtex":"@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }"},"supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}]},{"language":[{"iso":"ger"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"year":"2015","type":"dissertation","citation":{"ieee":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.","short":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015.","mla":"Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015.","bibtex":"@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015} }","apa":"Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn.","ama":"Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn; 2015.","chicago":"Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015."},"_id":"317","date_updated":"2022-01-06T06:59:02Z","file":[{"access_level":"closed","file_name":"317-Dissertation_ClaudiusJaehn.pdf","date_created":"2018-03-21T09:20:34Z","content_type":"application/pdf","date_updated":"2018-03-21T09:20:34Z","success":1,"relation":"main_file","file_size":20442332,"creator":"florida","file_id":"1462"}],"author":[{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"}],"publisher":"Universität Paderborn","file_date_updated":"2018-03-21T09:20:34Z","department":[{"_id":"63"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:53Z","user_id":"14052","title":"Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen","ddc":["040"]},{"ddc":["040"],"title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:41:44Z","has_accepted_license":"1","status":"public","department":[{"_id":"63"}],"file_date_updated":"2018-03-21T09:30:02Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"}],"publisher":"Universität Paderborn","file":[{"date_updated":"2018-03-21T09:30:02Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":448614,"file_id":"1476","creator":"florida","access_level":"closed","date_created":"2018-03-21T09:30:02Z","file_name":"270-Dissertation_-_Abshoff.pdf"}],"date_updated":"2022-01-06T06:57:32Z","_id":"270","year":"2015","type":"dissertation","citation":{"ieee":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn, 2015.","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","mla":"Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015.","bibtex":"@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }","chicago":"Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015.","apa":"Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn.","ama":"Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn; 2015."},"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:57:34Z","doi":"10.1007/978-3-662-48433-3_14","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"external_id":{"arxiv":["1507.02908"]},"title":"On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games","page":"178-189","type":"conference","citation":{"chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.","apa":"Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14","mla":"Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes in Computer Science}, title={On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14}, booktitle={Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture Notes in Computer Science} }","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189."},"year":"2015","_id":"271","file_date_updated":"2018-03-21T09:29:34Z","publication":"Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"file":[{"file_id":"1475","creator":"florida","file_size":256718,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-21T09:29:34Z","file_name":"271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf","date_created":"2018-03-21T09:29:34Z","access_level":"closed"}],"date_created":"2017-10-17T12:41:45Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"In \\emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\\alpha$ through unilateral strategy changes. There is a threshold $\\alpha_\\delta$ (where $\\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\\alpha$-approximate pure Nash equilibria always exist for $\\alpha \\geq \\alpha_\\delta$, but not for $\\alpha < \\alpha_\\delta$. We give both upper and lower bounds on this threshold $\\alpha_\\delta$ and show that the corresponding decision problem is ${\\sf NP}$-hard. We also show that the $\\alpha$-approximate price of anarchy for BAGs is $\\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum."}],"ddc":["040"],"user_id":"14052"},{"date_updated":"2022-01-06T06:57:39Z","doi":"10.1007/978-3-319-21840-3_45","series_title":"Lecture Notes in Computer Science","title":"Non-preemptive Scheduling on Machines with Setup Times","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"editor":[{"last_name":"Dehne","first_name":"Frank","full_name":"Dehne, Frank"},{"last_name":"Sack","first_name":"Jörg Rüdiger","full_name":"Sack, Jörg Rüdiger"},{"last_name":"Stege","full_name":"Stege, Ulrike","first_name":"Ulrike"}],"_id":"274","page":"542--553","type":"conference","year":"2015","citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553. doi:10.1007/978-3-319-21840-3_45","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553). https://doi.org/10.1007/978-3-319-21840-3_45","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.","mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={10.1007/978-3-319-21840-3_45}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553."},"abstract":[{"lang":"eng","text":"Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2."}],"user_id":"15504","ddc":["040"],"file":[{"access_level":"closed","file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","date_created":"2018-03-21T09:28:34Z","success":1,"relation":"main_file","date_updated":"2018-03-21T09:28:34Z","content_type":"application/pdf","creator":"florida","file_id":"1473","file_size":215498}],"publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","file_date_updated":"2018-03-21T09:28:34Z","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"date_created":"2017-10-17T12:41:45Z","has_accepted_license":"1","status":"public"},{"type":"conference","citation":{"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.","short":"A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.","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} }","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","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."},"year":"2015","page":"248--260","_id":"275","author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Lenzner, Pascal","first_name":"Pascal","last_name":"Lenzner"}],"publication":"Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)","file_date_updated":"2018-03-21T09:27:12Z","file":[{"date_updated":"2018-03-21T09:27:12Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":279995,"creator":"florida","file_id":"1472","access_level":"closed","file_name":"275-978-3-662-48054-0_21.pdf","date_created":"2018-03-21T09:27:12Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:45Z","abstract":[{"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.","lang":"eng"}],"ddc":["040"],"user_id":"477","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:57:40Z","doi":"10.1007/978-3-662-48054-0_21","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Network Creation Games: Think Global - Act Local"},{"department":[{"_id":"63"},{"_id":"541"}],"author":[{"last_name":"Kothe","full_name":"Kothe, Nils","first_name":"Nils"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:46Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","user_id":"14052","title":"Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2015","citation":{"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.","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."},"_id":"277","date_updated":"2022-01-06T06:57:44Z"},{"page":"65-78","year":"2015","type":"conference","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.","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.","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.","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} }","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."},"language":[{"iso":"eng"}],"_id":"17425","intvolume":" 343","date_updated":"2022-01-06T06:53:11Z","volume":343,"date_created":"2020-07-28T09:49:42Z","status":"public","publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Berssenbrügge","first_name":"Jan ","full_name":"Berssenbrügge, Jan "},{"last_name":"Wiederkehr","full_name":"Wiederkehr, Olga","first_name":"Olga"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","title":"Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme","user_id":"15415","place":"Paderborn"},{"language":[{"iso":"eng"}],"page":"107-120","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.","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.","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.","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.","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.","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} }"},"type":"conference","year":"2015","intvolume":" 342","_id":"17427","date_updated":"2022-01-06T06:53:11Z","publication":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"author":[{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Gerges","first_name":"Maria","full_name":"Gerges, Maria"},{"last_name":"Berssenbrügge","first_name":"Jan","full_name":"Berssenbrügge, Jan"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_created":"2020-07-28T10:23:18Z","status":"public","volume":342,"place":"Paderborn","user_id":"15415","title":"Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell"},{"language":[{"iso":"eng"}],"year":"2015","type":"book_editor","citation":{"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.","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} }","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.","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.","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.","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.","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."},"date_updated":"2022-01-06T06:53:12Z","_id":"17431","intvolume":" 342","edition":"12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_created":"2020-07-28T13:39:25Z","status":"public","volume":342,"editor":[{"full_name":"Gausemeier, Jürgen","first_name":"Jürgen","last_name":"Gausemeier"},{"first_name":"Michael","full_name":"Grafe, Michael","last_name":"Grafe"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"place":"Paderborn","user_id":"15415","title":"Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR"},{"doi":"10.1109/TCC.2015.2487964","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"title":"Inter-Datacenter Scheduling of Large Data Flows","publication_identifier":{"issn":["2168-7161"]},"department":[{"_id":"63"},{"_id":"541"}],"issue":"99","_id":"17657","type":"journal_article","year":"2015","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.","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","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."},"page":"1-1","user_id":"83983","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."}],"volume":"PP","status":"public","date_created":"2020-08-06T15:20:58Z","author":[{"last_name":"Cohen","first_name":"R.","full_name":"Cohen, R."},{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"}],"publication":"Cloud Computing, IEEE Transactions on","keyword":["Approximation algorithms","Approximation methods","Bandwidth","Cloud computing","Routing","Schedules","Scheduling"]},{"_id":"17658","intvolume":" 194","page":"23 - 36","year":"2015","citation":{"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.","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.","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} }","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015) 23–36.","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."},"type":"journal_article","user_id":"83983","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. "}],"extern":"1","date_created":"2020-08-06T15:21:15Z","status":"public","volume":194,"keyword":["Local ratio"],"publication":"Discrete Applied Mathematics ","publisher":"Elsevier","author":[{"first_name":"Reuven","full_name":"Bar-Yehuda, Reuven","last_name":"Bar-Yehuda"},{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"Rawitz","full_name":"Rawitz, Dror","first_name":"Dror"}],"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"}]},{"department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"title":"Towards Flexible Demands in Online Leasing Problems","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:56:05Z","doi":"10.1007/978-3-319-21398-9_22","file":[{"content_type":"application/pdf","date_updated":"2018-03-21T10:28:50Z","success":1,"relation":"main_file","file_size":264482,"creator":"florida","file_id":"1498","access_level":"closed","file_name":"240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf","date_created":"2018-03-21T10:28:50Z"}],"author":[{"last_name":"Li","first_name":"Shouwei","full_name":"Li, Shouwei"},{"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"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"file_date_updated":"2018-03-21T10:28:50Z","publication":"Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:38Z","abstract":[{"lang":"eng","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."}],"user_id":"15504","ddc":["040"],"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","type":"conference","page":"277--288","_id":"240"},{"type":"preprint","citation":{"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).","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.","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.","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."},"year":"2015","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16449","department":[{"_id":"63"}],"publication":"arXiv:1510.05454","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":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"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","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"}],"title":"Gathering a Closed Chain of Robots on a Grid","user_id":"15415"},{"type":"preprint","year":"2015","citation":{"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.","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, 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} }","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.","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.","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.","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."},"language":[{"iso":"eng"}],"_id":"16452","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-07T12:22:48Z","status":"public","publication":"arXiv:1510.01866","department":[{"_id":"63"}],"author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. ","first_name":"Faisal N. "},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Michael","full_name":"Schubert, Michael","last_name":"Schubert"}],"title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks","user_id":"15415","abstract":[{"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.","lang":"eng"}],"external_id":{"arxiv":["1510.01866"]}},{"publisher":"IEEE","author":[{"full_name":"Mäcker, Alexander","first_name":"Alexander","last_name":"Mäcker"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS)","status":"public","date_created":"2020-04-08T07:02:15Z","external_id":{"arxiv":["1410.7912"]},"abstract":[{"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.","lang":"eng"}],"user_id":"15415","title":"Online Top-k-Position Monitoring of Distributed Data Streams","language":[{"iso":"eng"}],"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.","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","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","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","year":"2015","page":"357-364","date_updated":"2022-01-06T06:52:50Z","_id":"16460","doi":"10.1109/IPDPS.2015.40"},{"user_id":"15415","title":"Linear and Competitive Strategies for Continuous Robot Formation Problems","department":[{"_id":"63"}],"publication":"ACM Transactions on Parallel Computing","author":[{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"date_created":"2020-04-03T06:40:56Z","status":"public","publication_status":"published","publication_identifier":{"issn":["2329-4949"]},"_id":"16391","date_updated":"2022-01-06T06:52:50Z","doi":"10.1145/2742341","language":[{"iso":"eng"}],"page":"1-18","type":"journal_article","year":"2015","citation":{"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.","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} }","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","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.","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."}},{"user_id":"15415","title":"Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case","external_id":{"arxiv":["1501.04877"]},"abstract":[{"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.","lang":"eng"}],"status":"public","date_created":"2020-04-03T09:36:54Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"last_name":"Andreas Cord-Landwehr","first_name":"Andreas","full_name":"Andreas Cord-Landwehr, Andreas"},{"full_name":"Jung, Daniel","first_name":"Daniel","id":"37827","last_name":"Jung"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication":"ArXiv: 1501.04877","department":[{"_id":"63"}],"_id":"16397","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"type":"preprint","year":"2015","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).","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} }","mla":"Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 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.","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.","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."}},{"title":"The common stomach: Organizing task allocation in wasp societies","user_id":"15415","publication":"Symposium on Biomathematics and Ecology: Education and Research","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Karsai","full_name":"Karsai, Istvan","first_name":"Istvan"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"full_name":"Hilbun, Allison","first_name":"Allison","last_name":"Hilbun"}],"date_created":"2020-10-15T13:56:46Z","status":"public","_id":"20007","date_updated":"2022-01-06T06:54:18Z","type":"conference","year":"2014","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.","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.","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.","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} }","mla":"Hamann, Heiko, et al. “The Common Stomach: Organizing Task Allocation in Wasp Societies.” Symposium on Biomathematics and Ecology: Education and Research, 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."},"language":[{"iso":"eng"}]},{"title":"Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins","user_id":"15415","place":"Cham","publication_identifier":{"isbn":["9783319099514","9783319099521"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","status":"public","date_created":"2020-10-15T14:13:51Z","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"}],"publication":"Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)","department":[{"_id":"63"},{"_id":"238"}],"doi":"10.1007/978-3-319-09952-1_15","date_updated":"2022-01-06T06:54:18Z","_id":"20008","type":"conference","citation":{"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.","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} }","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","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.","short":"H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), Cham, 2014."},"year":"2014","language":[{"iso":"eng"}]},{"citation":{"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.","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} }","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.","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.","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","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"},"year":"2014","type":"journal_article","page":"77-93","language":[{"iso":"eng"}],"doi":"10.1162/ARTL_a_00097","issue":"1","intvolume":" 20","_id":"20120","date_updated":"2022-01-06T06:54:20Z","volume":20,"status":"public","date_created":"2020-10-19T08:41:18Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Crailsheim","full_name":"Crailsheim, Karl","first_name":"Karl"}],"publication":"Artificial Life","department":[{"_id":"63"},{"_id":"238"}],"title":"Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem","user_id":"15415","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."}]},{"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)","author":[{"first_name":"Marco","full_name":"Dorigo, Marco","last_name":"Dorigo"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Valentini","first_name":"Gabriele","full_name":"Valentini, Gabriele"},{"first_name":"Alessio","full_name":"Lomuscio, Alessio","last_name":"Lomuscio"},{"full_name":"Scerri, Paul","first_name":"Paul","last_name":"Scerri"},{"last_name":"Bazzan","full_name":"Bazzan, Ana","first_name":"Ana"},{"last_name":"Huhns","first_name":"Michael","full_name":"Huhns, Michael"}],"date_created":"2020-10-19T08:49:05Z","status":"public","abstract":[{"lang":"eng","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."}],"user_id":"15415","title":"Self-Organized Collective Decision Making: The Weighted Voter Model","language":[{"iso":"eng"}],"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.","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} }","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.","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."},"year":"2014","type":"conference","_id":"20121","date_updated":"2022-01-06T06:54:20Z"},{"year":"2014","citation":{"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","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} }","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.","short":"H. Hamann, in: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014), 2014, pp. 31–32.","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."},"type":"conference","page":"31-32","language":[{"iso":"eng"}],"doi":"10.1145/2598394.2598507","date_updated":"2022-01-06T06:54:20Z","_id":"20126","status":"public","date_created":"2020-10-20T07:45:46Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)","title":"Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal","user_id":"15415"},{"volume":8667,"date_created":"2020-10-20T07:54:18Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)","author":[{"first_name":"Mauro","full_name":"Birattari, Mauro","last_name":"Birattari"},{"full_name":"Dorigo, Marco","first_name":"Marco","last_name":"Dorigo"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Garnier","first_name":"Simon","full_name":"Garnier, Simon"},{"first_name":"Marco","full_name":"Montes de Oca, Marco","last_name":"Montes de Oca"},{"full_name":"Solnon, Christine","first_name":"Christine","last_name":"Solnon"},{"last_name":"Stuetzle","full_name":"Stuetzle, Thomas","first_name":"Thomas"},{"last_name":"Ding","first_name":"Hongli","full_name":"Ding, Hongli"}],"title":"Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation","user_id":"15415","page":"262-269","type":"conference","year":"2014","citation":{"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.","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.","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.","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","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."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-09952-1_25","_id":"20127","date_updated":"2022-01-06T06:54:20Z","intvolume":" 8667"},{"_id":"20128","date_updated":"2022-01-06T06:54:20Z","intvolume":" 8672","doi":"10.1007/978-3-319-10762-2_18","language":[{"iso":"eng"}],"year":"2014","type":"book_chapter","citation":{"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.","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} }","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.","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","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.","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."},"page":"181-190","user_id":"15415","title":"Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements","publisher":"Springer","author":[{"last_name":"Khaluf","first_name":"Yara","full_name":"Khaluf, Yara"},{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"full_name":"Hamann, Heiko","first_name":"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"}],"publication":"13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-20T08:26:59Z","volume":8672},{"title":"Evolution of Collective Behaviors by Minimizing Surprise","user_id":"15415","date_created":"2020-10-20T09:02:49Z","status":"public","department":[{"_id":"63"},{"_id":"238"}],"publication":"14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)","publisher":"MIT Press","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Hiroki","full_name":"Sayama, Hiroki","last_name":"Sayama"},{"last_name":"Rieffel","full_name":"Rieffel, John","first_name":"John"},{"first_name":"Sebastian","full_name":"Risi, Sebastian","last_name":"Risi"},{"last_name":"Doursat","full_name":"Doursat, Rene","first_name":"Rene"},{"last_name":"Lipson","full_name":"Lipson, Hod","first_name":"Hod"}],"doi":"10.7551/978-0-262-32621-6-ch055","date_updated":"2022-01-06T06:54:20Z","_id":"20129","page":"344-351","type":"conference","year":"2014","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} }","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","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","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."},"language":[{"iso":"eng"}]},{"intvolume":" 8575","_id":"20130","date_updated":"2022-01-06T06:54:20Z","doi":"10.1007/978-3-319-08864-8_26","language":[{"iso":"eng"}],"page":"270-279","type":"conference","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.","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} }","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.","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","user_id":"15415","title":"A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs","department":[{"_id":"63"},{"_id":"238"}],"publication":"Simulation of Adaptive Behavior (SAB 2014)","author":[{"full_name":"Cervera, Enric","first_name":"Enric","last_name":"Cervera"},{"full_name":"Khaluf, Yara","first_name":"Yara","last_name":"Khaluf"},{"first_name":"Mauro","full_name":"Birattari, Mauro","last_name":"Birattari"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"last_name":"Pobil","first_name":"Angel P. del","full_name":"Pobil, Angel P. del"},{"last_name":"Chinellato","full_name":"Chinellato, Eris","first_name":"Eris"},{"last_name":"Martinez-Martin","first_name":"Ester","full_name":"Martinez-Martin, Ester"},{"full_name":"Hallam, John","first_name":"John","last_name":"Hallam"},{"full_name":"Morales, Antonio","first_name":"Antonio","last_name":"Morales"}],"date_created":"2020-10-20T09:09:59Z","status":"public","volume":8575},{"type":"conference","citation":{"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} }","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.","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","page":"128-137","_id":"368","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:42:03Z","file":[{"access_level":"closed","file_name":"368-BKMNRS14.pdf","date_created":"2018-03-20T07:17:38Z","date_updated":"2018-03-20T07:17:38Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":485767,"file_id":"1403","creator":"florida"}],"author":[{"last_name":"Brinkmann","full_name":"Brinkmann, Andre","first_name":"Andre"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Lars","full_name":"Nagel, Lars","last_name":"Nagel"},{"first_name":"Sören","full_name":"Riechers, 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)","user_id":"15415","ddc":["040"],"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"}],"language":[{"iso":"eng"}],"doi":"10.1145/2612669.2612698","date_updated":"2022-01-06T06:59:30Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"title":"Scheduling Shared Continuous Resources on Many-Cores"},{"department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Routing Games with Progressive Filling","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:30Z","doi":"10.1109/TNET.2015.2468571","file":[{"success":1,"relation":"main_file","date_updated":"2018-03-20T07:17:04Z","content_type":"application/pdf","creator":"florida","file_id":"1402","file_size":179583,"access_level":"closed","file_name":"370-HHSS14.pdf","date_created":"2018-03-20T07:17:04Z"}],"publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","file_date_updated":"2018-03-20T07:17:04Z","author":[{"last_name":"Harks","first_name":"Tobias","full_name":"Harks, Tobias"},{"first_name":"Martin","full_name":"Höfer, Martin","last_name":"Höfer"},{"full_name":"Schewior, Kevin","first_name":"Kevin","last_name":"Schewior"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"date_created":"2017-10-17T12:42:04Z","status":"public","has_accepted_license":"1","abstract":[{"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. ","lang":"eng"}],"user_id":"477","ddc":["040"],"page":"352-360","citation":{"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.","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.","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.","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","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","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.","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} }"},"year":"2014","type":"conference","_id":"370"},{"type":"bachelorsthesis","citation":{"chicago":"Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014.","ama":"Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014.","apa":"Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn.","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} }","short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","ieee":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014."},"year":"2014","language":[{"iso":"ger"}],"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"date_updated":"2022-01-06T06:59:31Z","_id":"373","publisher":"Universität Paderborn","author":[{"last_name":"Pahl","first_name":"David","full_name":"Pahl, David"}],"department":[{"_id":"63"},{"_id":"541"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:04Z","title":"Reputationssysteme für zusammengesetzte Dienstleistungen","user_id":"14052"},{"_id":"379","page":"25-34","year":"2014","citation":{"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.","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} }","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.","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","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","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.","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."},"type":"conference","ddc":["040"],"user_id":"15504","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."}],"date_created":"2017-10-17T12:42:06Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-20T07:12:57Z","publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastian","first_name":"Sebastian"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-20T07:12:57Z","creator":"florida","file_id":"1395","file_size":214299,"access_level":"closed","file_name":"379-COCOA14.pdf","date_created":"2018-03-20T07:12:57Z"}],"doi":"10.1007/978-3-319-12691-3_3","date_updated":"2022-01-06T06:59:36Z","series_title":"LNCS","title":"Randomized Online Algorithms for Set Cover Leasing Problems","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}]},{"doi":"10.1007/978-3-319-13129-0_34","_id":"380","date_updated":"2022-01-06T06:59:36Z","page":"423-428","year":"2014","type":"conference","citation":{"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.","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.","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} }","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","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","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."},"title":"Quality of Service in Network Creation Games","ddc":["040"],"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}"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2017-10-17T12:42:06Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","department":[{"_id":"63"}],"author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"file":[{"date_created":"2018-03-20T07:05:59Z","file_name":"380-WINE2014.pdf","access_level":"closed","file_id":"1394","creator":"florida","file_size":166640,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-03-20T07:05:59Z"}]},{"publication_identifier":{"isbn":["978-1-4503-2738-1"]},"status":"public","date_created":"2020-08-06T15:21:26Z","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"first_name":"Stojan","full_name":"Trajanovski, Stojan","last_name":"Trajanovski"},{"first_name":"Mathijs M.","full_name":"de Weerdt, Mathijs M.","last_name":"de Weerdt"}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","keyword":["competition","equilibrium","market","models","shared effort games","simulation"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","department":[{"_id":"63"},{"_id":"541"}],"title":"Nash Equilibria in Shared Effort Games","user_id":"83983","extern":"1","place":"Richland, SC","type":"conference","citation":{"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.","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.","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} }","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.","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.","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."},"year":"2014","page":"861-868","language":[{"iso":"eng"}],"series_title":"AAMAS '14","_id":"17659","date_updated":"2022-01-06T06:53:16Z"},{"status":"public","date_created":"2020-08-06T15:21:35Z","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"id":"83983","last_name":"Polevoy","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"de Weerdt","first_name":"Mathijs M.","full_name":"de Weerdt, Mathijs M."}],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","department":[{"_id":"63"},{"_id":"541"}],"keyword":["dynamics","emotion modeling","negotiation","network interaction","shared effort game"],"user_id":"83983","title":"Improving Human Interaction in Crowdsensing","place":"Richland, SC","extern":"1","language":[{"iso":"eng"}],"type":"conference","year":"2014","citation":{"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.","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.","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.","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.","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."},"page":"1741-1742","series_title":"AAMAS '14","_id":"17660","date_updated":"2022-01-06T06:53:16Z"},{"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"first_name":"Thomas C.","full_name":"King, Thomas C.","last_name":"King"},{"last_name":"Liu","first_name":"Qingzhi","full_name":"Liu, Qingzhi"},{"last_name":"Polevoy","id":"83983","first_name":"Gleb","full_name":"Polevoy, Gleb"},{"last_name":"de Weerdt","first_name":"Mathijs","full_name":"de Weerdt, Mathijs"},{"first_name":"Virginia","full_name":"Dignum, Virginia","last_name":"Dignum"},{"last_name":"van Riemsdijk","first_name":"M. Birna","full_name":"van Riemsdijk, M. Birna"},{"first_name":"Martijn","full_name":"Warnier, Martijn","last_name":"Warnier"}],"keyword":["crowd-sensing","crowdsourcing","data aggregation","game theory","norms","reciprocation","self interested agents","simulation"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","department":[{"_id":"63"},{"_id":"541"}],"status":"public","date_created":"2020-08-06T15:21:45Z","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"place":"Richland, SC","extern":"1","user_id":"83983","title":"Request Driven Social Sensing","series_title":"AAMAS '14","language":[{"iso":"eng"}],"year":"2014","type":"conference","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.","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.","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.","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} }","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."},"page":"1651-1652","_id":"17661","date_updated":"2022-01-06T06:53:16Z"}]