[{"publication_identifier":{"issn":["2296-9144"]},"publication_status":"published","date_created":"2020-10-09T14:04:05Z","status":"public","publication":"Frontiers in Robotics and AI","department":[{"_id":"63"},{"_id":"238"}],"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Yara","full_name":"Khaluf, Yara","last_name":"Khaluf"},{"last_name":"Botev","full_name":"Botev, Jean","first_name":"Jean"},{"last_name":"Divband Soorati","full_name":"Divband Soorati, Mohammad","first_name":"Mohammad"},{"full_name":"Ferrante, Eliseo","first_name":"Eliseo","last_name":"Ferrante"},{"last_name":"Kosak","first_name":"Oliver","full_name":"Kosak, Oliver"},{"last_name":"Montanier","full_name":"Montanier, Jean-Marc","first_name":"Jean-Marc"},{"last_name":"Mostaghim","first_name":"Sanaz","full_name":"Mostaghim, Sanaz"},{"first_name":"Richard","full_name":"Redpath, Richard","last_name":"Redpath"},{"full_name":"Timmis, Jon","first_name":"Jon","last_name":"Timmis"},{"last_name":"Veenstra","full_name":"Veenstra, Frank","first_name":"Frank"},{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"},{"full_name":"Zamuda, Aleš","first_name":"Aleš","last_name":"Zamuda"}],"title":"Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems","user_id":"15415","citation":{"ieee":"H. Hamann et al., “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems,” Frontiers in Robotics and AI, 2016.","short":"H. Hamann, Y. Khaluf, J. Botev, M. Divband Soorati, E. Ferrante, O. Kosak, J.-M. Montanier, S. Mostaghim, R. Redpath, J. Timmis, F. Veenstra, M. Wahby, A. Zamuda, Frontiers in Robotics and AI (2016).","bibtex":"@article{Hamann_Khaluf_Botev_Divband Soorati_Ferrante_Kosak_Montanier_Mostaghim_Redpath_Timmis_et al._2016, title={Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems}, DOI={10.3389/frobt.2016.00014}, journal={Frontiers in Robotics and AI}, author={Hamann, Heiko and Khaluf, Yara and Botev, Jean and Divband Soorati, Mohammad and Ferrante, Eliseo and Kosak, Oliver and Montanier, Jean-Marc and Mostaghim, Sanaz and Redpath, Richard and Timmis, Jon and et al.}, year={2016} }","mla":"Hamann, Heiko, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016, doi:10.3389/frobt.2016.00014.","apa":"Hamann, H., Khaluf, Y., Botev, J., Divband Soorati, M., Ferrante, E., Kosak, O., … Zamuda, A. (2016). Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. https://doi.org/10.3389/frobt.2016.00014","ama":"Hamann H, Khaluf Y, Botev J, et al. Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems. Frontiers in Robotics and AI. 2016. doi:10.3389/frobt.2016.00014","chicago":"Hamann, Heiko, Yara Khaluf, Jean Botev, Mohammad Divband Soorati, Eliseo Ferrante, Oliver Kosak, Jean-Marc Montanier, et al. “Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-Organizing Systems.” Frontiers in Robotics and AI, 2016. https://doi.org/10.3389/frobt.2016.00014."},"type":"journal_article","year":"2016","language":[{"iso":"eng"}],"doi":"10.3389/frobt.2016.00014","date_updated":"2022-01-06T06:54:17Z","_id":"19969"},{"year":"2016","type":"conference","citation":{"short":"H. Hamann, M. Divband Soorati, in: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.","ieee":"H. Hamann and M. Divband Soorati, “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.","ama":"Hamann H, Divband Soorati M. Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). ; 2016. doi:10.1109/IROS.2016.7759845","apa":"Hamann, H., & Divband Soorati, M. (2016). Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016). https://doi.org/10.1109/IROS.2016.7759845","chicago":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016. https://doi.org/10.1109/IROS.2016.7759845.","bibtex":"@inproceedings{Hamann_Divband Soorati_2016, title={Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures}, DOI={10.1109/IROS.2016.7759845}, booktitle={IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)}, author={Hamann, Heiko and Divband Soorati, Mohammad}, year={2016} }","mla":"Hamann, Heiko, and Mohammad Divband Soorati. “Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures.” IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016, doi:10.1109/IROS.2016.7759845."},"language":[{"iso":"eng"}],"doi":"10.1109/IROS.2016.7759845","_id":"19979","date_updated":"2022-01-06T06:54:17Z","date_created":"2020-10-12T13:06:07Z","status":"public","publication":"IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016)","department":[{"_id":"63"},{"_id":"238"}],"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Divband Soorati","first_name":"Mohammad","full_name":"Divband Soorati, Mohammad"}],"title":"Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures","user_id":"15415"},{"language":[{"iso":"eng"}],"year":"2016","citation":{"short":"M. Dorigo, H. Hamann, G. Valentini, E. Ferrante, Journal of Autonomous Agents and Multi-Agent Systems 30 (2016) 553–580.","ieee":"M. Dorigo, H. Hamann, G. Valentini, and E. Ferrante, “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems,” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, pp. 553–580, 2016.","ama":"Dorigo M, Hamann H, Valentini G, Ferrante E. Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems. 2016;30(3):553-580. doi:10.1007/s10458-015-9323-3","apa":"Dorigo, M., Hamann, H., Valentini, G., & Ferrante, E. (2016). Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems. Journal of Autonomous Agents and Multi-Agent Systems, 30(3), 553–580. https://doi.org/10.1007/s10458-015-9323-3","chicago":"Dorigo, Marco, Heiko Hamann, Gabriele Valentini, and Eliseo Ferrante. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems 30, no. 3 (2016): 553–80. https://doi.org/10.1007/s10458-015-9323-3.","mla":"Dorigo, Marco, et al. “Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems.” Journal of Autonomous Agents and Multi-Agent Systems, vol. 30, no. 3, 2016, pp. 553–80, doi:10.1007/s10458-015-9323-3.","bibtex":"@article{Dorigo_Hamann_Valentini_Ferrante_2016, title={Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems}, volume={30}, DOI={10.1007/s10458-015-9323-3}, number={3}, journal={Journal of Autonomous Agents and Multi-Agent Systems}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Ferrante, Eliseo}, year={2016}, pages={553–580} }"},"type":"journal_article","page":"553-580","intvolume":" 30","_id":"19983","date_updated":"2022-01-06T06:54:17Z","issue":"3","doi":"10.1007/s10458-015-9323-3","author":[{"last_name":"Dorigo","first_name":"Marco","full_name":"Dorigo, Marco"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"last_name":"Valentini","first_name":"Gabriele","full_name":"Valentini, Gabriele"},{"last_name":"Ferrante","first_name":"Eliseo","full_name":"Ferrante, Eliseo"}],"publication":"Journal of Autonomous Agents and Multi-Agent Systems","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-13T08:33:37Z","volume":30,"user_id":"15415","title":"Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems"},{"citation":{"mla":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","bibtex":"@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }","ama":"Drees M. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn; 2016.","apa":"Drees, M. (2016). Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn.","chicago":"Drees, Maximilian. Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","ieee":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games. Universität Paderborn, 2016.","short":"M. Drees, Existence and Properties of Pure Nash Equilibria in Budget Games, Universität Paderborn, 2016."},"type":"dissertation","year":"2016","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"_id":"200","file_date_updated":"2018-03-21T10:45:57Z","publisher":"Universität Paderborn","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"}],"file":[{"file_name":"200-thesis.pdf","date_created":"2018-03-21T10:45:57Z","access_level":"closed","file_size":880390,"creator":"florida","file_id":"1525","content_type":"application/pdf","date_updated":"2018-03-21T10:45:57Z","relation":"main_file","success":1}],"date_created":"2017-10-17T12:41:31Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15415","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:18Z","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Existence and Properties of Pure Nash Equilibria in Budget Games","related_material":{"link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915","relation":"confirmation"}]}},{"department":[{"_id":"63"},{"_id":"238"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Gabriele","full_name":"Valentini, Gabriele","last_name":"Valentini"},{"last_name":"Dorigo","full_name":"Dorigo, Marco","first_name":"Marco"}],"date_created":"2020-10-15T09:55:35Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319444260","9783319444277"]},"publication_status":"published","place":"Cham","user_id":"15415","title":"Population Coding: A New Design Paradigm for Embodied Distributed Systems","language":[{"iso":"eng"}],"year":"2016","citation":{"ama":"Hamann H, Valentini G, Dorigo M. Population Coding: A New Design Paradigm for Embodied Distributed Systems. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham; 2016. doi:10.1007/978-3-319-44427-7_15","apa":"Hamann, H., Valentini, G., & Dorigo, M. (2016). Population Coding: A New Design Paradigm for Embodied Distributed Systems. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham. https://doi.org/10.1007/978-3-319-44427-7_15","chicago":"Hamann, Heiko, Gabriele Valentini, and Marco Dorigo. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. Cham, 2016. https://doi.org/10.1007/978-3-319-44427-7_15.","bibtex":"@inproceedings{Hamann_Valentini_Dorigo_2016, place={Cham}, title={Population Coding: A New Design Paradigm for Embodied Distributed Systems}, DOI={10.1007/978-3-319-44427-7_15}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Hamann, Heiko and Valentini, Gabriele and Dorigo, Marco}, year={2016} }","mla":"Hamann, Heiko, et al. “Population Coding: A New Design Paradigm for Embodied Distributed Systems.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_15.","short":"H. Hamann, G. Valentini, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, Cham, 2016.","ieee":"H. Hamann, G. Valentini, and M. Dorigo, “Population Coding: A New Design Paradigm for Embodied Distributed Systems,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016."},"type":"conference","_id":"20000","date_updated":"2022-01-06T06:54:18Z","doi":"10.1007/978-3-319-44427-7_15"},{"citation":{"ieee":"S. von Mammen, H. Hamann, and M. Heider, “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems,” in ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.","short":"S. von Mammen, H. Hamann, M. Heider, in: ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.","mla":"von Mammen, Sebastian, et al. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” ACM Symposium on Virtual Reality Software and Technology (VRST), 2016, doi:10.1145/2993369.2993400.","bibtex":"@inproceedings{von Mammen_Hamann_Heider_2016, title={Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems}, DOI={10.1145/2993369.2993400}, booktitle={ACM Symposium on Virtual Reality Software and Technology (VRST)}, author={von Mammen, Sebastian and Hamann, Heiko and Heider, Michael}, year={2016} }","chicago":"Mammen, Sebastian von, Heiko Hamann, and Michael Heider. “Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems.” In ACM Symposium on Virtual Reality Software and Technology (VRST), 2016. https://doi.org/10.1145/2993369.2993400.","apa":"von Mammen, S., Hamann, H., & Heider, M. (2016). Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In ACM Symposium on Virtual Reality Software and Technology (VRST). https://doi.org/10.1145/2993369.2993400","ama":"von Mammen S, Hamann H, Heider M. Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems. In: ACM Symposium on Virtual Reality Software and Technology (VRST). ; 2016. doi:10.1145/2993369.2993400"},"year":"2016","type":"conference","language":[{"iso":"eng"}],"doi":"10.1145/2993369.2993400","date_updated":"2022-01-06T06:54:18Z","_id":"20001","publication_status":"published","publication_identifier":{"isbn":["9781450344913"]},"status":"public","date_created":"2020-10-15T10:00:23Z","author":[{"last_name":"von Mammen","first_name":"Sebastian","full_name":"von Mammen, Sebastian"},{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"first_name":"Michael","full_name":"Heider, Michael","last_name":"Heider"}],"publication":"ACM Symposium on Virtual Reality Software and Technology (VRST)","department":[{"_id":"63"},{"_id":"238"}],"title":"Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems","user_id":"15415"},{"_id":"20002","date_updated":"2022-01-06T06:54:18Z","doi":"10.1145/2908812.2908815","language":[{"iso":"eng"}],"type":"conference","year":"2016","citation":{"bibtex":"@inproceedings{Rybář_Hamann_2016, title={Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes}, DOI={10.1145/2908812.2908815}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)}, author={Rybář, Milan and Hamann, Heiko}, year={2016} }","mla":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016, doi:10.1145/2908812.2908815.","apa":"Rybář, M., & Hamann, H. (2016). Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). https://doi.org/10.1145/2908812.2908815","ama":"Rybář M, Hamann H. Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016). ; 2016. doi:10.1145/2908812.2908815","chicago":"Rybář, Milan, and Heiko Hamann. “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes.” In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016. https://doi.org/10.1145/2908812.2908815.","ieee":"M. Rybář and H. Hamann, “Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.","short":"M. Rybář, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016."},"user_id":"15415","title":"Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes","author":[{"last_name":"Rybář","full_name":"Rybář, Milan","first_name":"Milan"},{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"}],"department":[{"_id":"63"},{"_id":"238"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016)","status":"public","date_created":"2020-10-15T10:05:11Z","publication_identifier":{"isbn":["9781450342063"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:54:18Z","_id":"20003","intvolume":" 9882","language":[{"iso":"eng"}],"year":"2016","citation":{"ieee":"Y. Khaluf and H. Hamann, “On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations,” in ANTS 2016, 2016, vol. 9882, p. 298.","short":"Y. Khaluf, H. Hamann, in: ANTS 2016, 2016, p. 298.","bibtex":"@inproceedings{Khaluf_Hamann_2016, title={On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations}, volume={9882}, booktitle={ANTS 2016}, author={Khaluf, Yara and Hamann, Heiko}, year={2016}, pages={298} }","mla":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” ANTS 2016, vol. 9882, 2016, p. 298.","apa":"Khaluf, Y., & Hamann, H. (2016). On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In ANTS 2016 (Vol. 9882, p. 298).","ama":"Khaluf Y, Hamann H. On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations. In: ANTS 2016. Vol 9882. ; 2016:298.","chicago":"Khaluf, Yara, and Heiko Hamann. “On the Definition of Self-Organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations.” In ANTS 2016, 9882:298, 2016."},"type":"conference","page":"298","user_id":"15415","title":"On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations","author":[{"last_name":"Khaluf","full_name":"Khaluf, Yara","first_name":"Yara"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"}],"publication":"ANTS 2016","department":[{"_id":"63"},{"_id":"238"}],"status":"public","date_created":"2020-10-15T10:16:39Z","volume":9882},{"date_created":"2020-10-15T10:22:20Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319444260","9783319444277"]},"publication_status":"published","department":[{"_id":"63"},{"_id":"238"}],"publication":"10th Int. Conf. on Swarm Intelligence, ANTS 2016","author":[{"last_name":"Valentini","full_name":"Valentini, Gabriele","first_name":"Gabriele"},{"last_name":"Brambilla","full_name":"Brambilla, Davide","first_name":"Davide"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Dorigo","full_name":"Dorigo, Marco","first_name":"Marco"}],"user_id":"15415","title":"Collective Perception of Environmental Features in a Robot Swarm","language":[{"iso":"eng"}],"year":"2016","citation":{"bibtex":"@inproceedings{Valentini_Brambilla_Hamann_Dorigo_2016, title={Collective Perception of Environmental Features in a Robot Swarm}, DOI={10.1007/978-3-319-44427-7_6}, booktitle={10th Int. Conf. on Swarm Intelligence, ANTS 2016}, author={Valentini, Gabriele and Brambilla, Davide and Hamann, Heiko and Dorigo, Marco}, year={2016} }","mla":"Valentini, Gabriele, et al. “Collective Perception of Environmental Features in a Robot Swarm.” 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016, doi:10.1007/978-3-319-44427-7_6.","chicago":"Valentini, Gabriele, Davide Brambilla, Heiko Hamann, and Marco Dorigo. “Collective Perception of Environmental Features in a Robot Swarm.” In 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016. https://doi.org/10.1007/978-3-319-44427-7_6.","apa":"Valentini, G., Brambilla, D., Hamann, H., & Dorigo, M. (2016). Collective Perception of Environmental Features in a Robot Swarm. In 10th Int. Conf. on Swarm Intelligence, ANTS 2016. https://doi.org/10.1007/978-3-319-44427-7_6","ama":"Valentini G, Brambilla D, Hamann H, Dorigo M. Collective Perception of Environmental Features in a Robot Swarm. In: 10th Int. Conf. on Swarm Intelligence, ANTS 2016. ; 2016. doi:10.1007/978-3-319-44427-7_6","ieee":"G. Valentini, D. Brambilla, H. Hamann, and M. Dorigo, “Collective Perception of Environmental Features in a Robot Swarm,” in 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.","short":"G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016."},"type":"conference","doi":"10.1007/978-3-319-44427-7_6","_id":"20004","date_updated":"2022-01-06T06:54:18Z"},{"user_id":"14052","title":"Congestion Games with Mixed Objectives","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:33Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"}],"_id":"210","date_updated":"2022-01-06T06:54:42Z","supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"type":"mastersthesis","year":"2016","citation":{"short":"L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016.","ieee":"L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","apa":"Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn.","ama":"Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016.","chicago":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","mla":"Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016.","bibtex":"@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }"}},{"abstract":[{"text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.","lang":"eng"}],"user_id":"14955","ddc":["040"],"file":[{"content_type":"application/pdf","date_updated":"2018-03-21T10:41:40Z","success":1,"relation":"main_file","file_size":352996,"creator":"florida","file_id":"1518","access_level":"closed","date_created":"2018-03-21T10:41:40Z","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf"}],"author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-03-21T10:41:40Z","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:33Z","_id":"215","citation":{"bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.","apa":"Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427."},"year":"2016","type":"conference","page":"417--427","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_updated":"2022-01-06T06:55:02Z","doi":"10.1145/2935764.2935783","language":[{"iso":"eng"}]},{"series_title":"Frontiers in Artificial Intelligence and Applications","type":"conference","citation":{"mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }","chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. https://doi.org/10.3233/978-1-61499-672-9-417.","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: Proceedings of the 2016 European Conference on Artificial Intelligence. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:10.3233/978-1-61499-672-9-417","apa":"Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417","ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425."},"year":"2016","page":"417-425","language":[{"iso":"eng"}],"_id":"17655","date_updated":"2022-01-06T06:53:16Z","doi":"10.3233/978-1-61499-672-9-417","author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."},{"full_name":"Jonker, C.M.","first_name":"C.M.","last_name":"Jonker"}],"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","department":[{"_id":"63"},{"_id":"541"}],"volume":"Volume 285: ECAI 2016","status":"public","date_created":"2020-08-06T15:20:30Z","extern":"1","title":"The Game of Reciprocation Habits","user_id":"83983"},{"date_updated":"2022-01-06T06:53:16Z","_id":"17656","series_title":"AAMAS '16","page":"1431-1432","type":"conference","citation":{"chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","apa":"Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432."},"year":"2016","language":[{"iso":"eng"}],"extern":"1","place":"Richland, SC","title":"The Convergence of Reciprocation","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"last_name":"de Weerdt","first_name":"Mathijs","full_name":"de Weerdt, Mathijs"},{"full_name":"Jonker, Catholijn","first_name":"Catholijn","last_name":"Jonker"}],"publication_identifier":{"isbn":["978-1-4503-4239-1"]},"date_created":"2020-08-06T15:20:45Z","status":"public"},{"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-48749-6_35","date_updated":"2022-01-06T06:53:17Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","page":"477-488","year":"2016","type":"conference","citation":{"bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={10.1007/978-3-319-48749-6_35}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_35.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488."},"_id":"177","date_created":"2017-10-17T12:41:26Z","has_accepted_license":"1","status":"public","file":[{"access_level":"closed","file_name":"OnTheParameterizedParallelComp.pdf","date_created":"2018-11-02T14:15:18Z","date_updated":"2018-11-02T14:15:18Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":293345,"creator":"ups","file_id":"5266"}],"publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:15:18Z","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N."},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"first_name":"Christine","full_name":"Markarian, Christine","last_name":"Markarian","id":"37612"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"user_id":"477","ddc":["000"],"abstract":[{"lang":"eng","text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus."}]},{"_id":"187","date_updated":"2022-01-06T06:53:51Z","issue":"1","doi":"10.1145/2936716","citation":{"ama":"Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.; 2016. doi:10.1145/2936716","apa":"Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716","chicago":"Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.","bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={10.1145/2936716}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016.","ieee":"F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016."},"type":"journal_editor","year":"2016","page":"1","user_id":"15504","title":"Introduction to the Special Issue on SPAA 2014","ddc":["040"],"file":[{"file_size":34053,"creator":"florida","file_id":"1531","date_updated":"2018-03-21T12:31:42Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"187-a1-heide.pdf","date_created":"2018-03-21T12:31:42Z","access_level":"closed"}],"department":[{"_id":"63"}],"file_date_updated":"2018-03-21T12:31:42Z","publication":"Transactions on Parallel Computing (TOPC)","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:28Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"editor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}]},{"_id":"207","year":"2016","citation":{"ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592. doi:10.1007/978-3-319-48749-6_42"},"type":"conference","page":"578--592","abstract":[{"text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}","lang":"eng"}],"user_id":"477","ddc":["000"],"file":[{"success":1,"relation":"main_file","date_updated":"2018-11-02T14:18:51Z","content_type":"application/pdf","file_id":"5268","creator":"ups","file_size":608614,"access_level":"closed","file_name":"Cost-EfficientSchedulingOnMach.pdf","date_created":"2018-11-02T14:18:51Z"}],"author":[{"last_name":"Mäcker","id":"13536","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:18:51Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:32Z","date_updated":"2022-01-06T06:54:33Z","doi":"10.1007/978-3-319-48749-6_42","language":[{"iso":"eng"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"_id":"209","page":"655--669","year":"2016","type":"conference","citation":{"chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669). https://doi.org/10.1007/978-3-319-48749-6_47","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={10.1007/978-3-319-48749-6_47}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669."},"abstract":[{"text":"We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.","lang":"eng"}],"ddc":["000"],"user_id":"14052","file_date_updated":"2018-10-31T17:03:44Z","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"first_name":"Lennart","full_name":"Leder, Lennart","last_name":"Leder"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"file":[{"file_size":235739,"file_id":"5233","creator":"feldi","date_updated":"2018-10-31T17:03:44Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","date_created":"2018-10-31T17:03:44Z","access_level":"closed"}],"date_created":"2017-10-17T12:41:32Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:54:41Z","doi":"10.1007/978-3-319-48749-6_47","series_title":"LNCS","language":[{"iso":"eng"}],"external_id":{"arxiv":["1607.05143"]},"title":"Congestion Games with Mixed Objectives","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":"Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden","user_id":"22704","author":[{"last_name":"Bülling","full_name":"Bülling, Jonas","first_name":"Jonas"}],"department":[{"_id":"63"}],"status":"public","date_created":"2018-11-07T09:26:42Z","date_updated":"2022-01-06T07:01:51Z","_id":"5406","type":"bachelorsthesis","year":"2016","citation":{"ieee":"J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016.","short":"J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","bibtex":"@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}, author={Bülling, Jonas}, year={2016} }","mla":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.","apa":"Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.","ama":"Bülling J. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.; 2016.","chicago":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016."},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2016","type":"bachelorsthesis","citation":{"short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","ieee":"J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.","chicago":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","ama":"Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.","apa":"Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","mla":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016."},"_id":"5407","date_updated":"2022-01-06T07:01:51Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-11-07T09:45:57Z","status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Koepe","full_name":"Koepe, Jörn","first_name":"Jörn"}],"publisher":"Universität Paderborn","user_id":"477","title":"Price-Based Allocation Games"},{"date_created":"2017-11-14T06:50:35Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"last_name":"Kutzias","full_name":"Kutzias, Damian","first_name":"Damian"}],"user_id":"477","title":"Friendship Processes in Network Creation Games","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"2016","type":"mastersthesis","citation":{"mla":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","ama":"Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016.","apa":"Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.","chicago":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","ieee":"D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016."},"_id":"688","date_updated":"2022-01-06T07:03:23Z"}]