--- _id: '1094' abstract: - lang: eng text: Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, gamification is hardly used in education, because current approaches to gamification require instructors to engage in the time-consuming preparation of their course contents for use in quizzes, mini-games and the like. Drawing on research on limited attention and present bias, we propose a "lean" approach to gamification, which relies on gamifying learning activities (rather than learning contents) and increasing their salience. In this paper, we present the app StudyNow that implements such a lean gamification approach. With this app, we aim to enable more students and instructors to benefit from the advantages of gamification. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, John T, Kundisch D, Hemsen P, Klingsieck K, Skopalik A. Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST). LNCS. ; 2017:462-467. doi:10.1007/978-3-319-59144-5_32' apa: 'Feldotto, M., John, T., Kundisch, D., Hemsen, P., Klingsieck, K., & Skopalik, A. (2017). Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) (pp. 462–467). https://doi.org/10.1007/978-3-319-59144-5_32' bibtex: '@inproceedings{Feldotto_John_Kundisch_Hemsen_Klingsieck_Skopalik_2017, series={LNCS}, title={Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App}, DOI={10.1007/978-3-319-59144-5_32}, booktitle={Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST)}, author={Feldotto, Matthias and John, Thomas and Kundisch, Dennis and Hemsen, Paul and Klingsieck, Katrin and Skopalik, Alexander}, year={2017}, pages={462–467}, collection={LNCS} }' chicago: 'Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.' ieee: 'M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, and A. Skopalik, “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App,” in Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.' mla: 'Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.' short: 'M. Feldotto, T. John, D. Kundisch, P. Hemsen, K. Klingsieck, A. Skopalik, in: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–467.' date_created: 2018-01-05T08:37:52Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '276' doi: 10.1007/978-3-319-59144-5_32 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:01:09Z date_updated: 2018-10-31T17:01:09Z file_id: '5230' file_name: Feldotto2017_Chapter_MakingGamificationEasyForThePr.pdf file_size: 1576363 relation: main_file success: 1 file_date_updated: 2018-10-31T17:01:09Z has_accepted_license: '1' language: - iso: eng page: 462-467 publication: Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST) series_title: LNCS status: public title: 'Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App' type: conference user_id: '14052' year: '2017' ... --- _id: '1095' abstract: - lang: eng text: 'Many university students struggle with motivational problems, and gamification has the potential to address these problems. However, using gamification currently is rather tedious and time-consuming for instructors because current approaches to gamification require instructors to engage in the time-consuming preparation of course contents (e.g., for quizzes or mini-games). In reply to this issue, we propose a “lean” approach to gamification, which relies on gamifying learning activities rather than learning contents. The learning activities that are gamified in the lean approach can typically be drawn from existing course syllabi (e.g., attend certain lectures, hand in assignments, read book chapters and articles). Hence, compared to existing approaches, lean gamification substantially lowers the time requirements posed on instructors for gamifying a given course. Drawing on research on limited attention and the present bias, we provide the theoretical foundation for the lean gamification approach. In addition, we present a mobile application that implements lean gamification and outline a mixed-methods study that is currently under way for evaluating whether lean gamification does indeed have the potential to increase students’ motivation. We thereby hope to allow more students and instructors to benefit from the advantages of gamification. ' author: - first_name: Thomas full_name: John, Thomas id: '3952' last_name: John - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Paul full_name: Hemsen, Paul id: '22546' last_name: Hemsen - first_name: Katrin full_name: Klingsieck, Katrin last_name: Klingsieck - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: Mike full_name: Langendorf, Mike last_name: Langendorf citation: ama: 'John T, Feldotto M, Hemsen P, Klingsieck K, Kundisch D, Langendorf M. Towards a Lean Approach for Gamifying Education. In: Proceedings of the 25th European Conference on Information Systems (ECIS). ; 2017:2970-2979.' apa: John, T., Feldotto, M., Hemsen, P., Klingsieck, K., Kundisch, D., & Langendorf, M. (2017). Towards a Lean Approach for Gamifying Education. In Proceedings of the 25th European Conference on Information Systems (ECIS) (pp. 2970–2979). bibtex: '@inproceedings{John_Feldotto_Hemsen_Klingsieck_Kundisch_Langendorf_2017, title={Towards a Lean Approach for Gamifying Education}, booktitle={Proceedings of the 25th European Conference on Information Systems (ECIS)}, author={John, Thomas and Feldotto, Matthias and Hemsen, Paul and Klingsieck, Katrin and Kundisch, Dennis and Langendorf, Mike}, year={2017}, pages={2970–2979} }' chicago: John, Thomas, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, and Mike Langendorf. “Towards a Lean Approach for Gamifying Education.” In Proceedings of the 25th European Conference on Information Systems (ECIS), 2970–79, 2017. ieee: T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, and M. Langendorf, “Towards a Lean Approach for Gamifying Education,” in Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979. mla: John, Thomas, et al. “Towards a Lean Approach for Gamifying Education.” Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–79. short: 'T. John, M. Feldotto, P. Hemsen, K. Klingsieck, D. Kundisch, M. Langendorf, in: Proceedings of the 25th European Conference on Information Systems (ECIS), 2017, pp. 2970–2979.' date_created: 2018-01-05T08:39:41Z date_updated: 2022-01-06T06:50:53Z ddc: - '000' department: - _id: '63' - _id: '541' - _id: '178' - _id: '185' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:02:07Z date_updated: 2018-10-31T17:02:07Z file_id: '5232' file_name: TOWARDS A LEAN APPROACH TO GAMIFYING EDUCATION.pdf file_size: 485333 relation: main_file success: 1 file_date_updated: 2018-10-31T17:02:07Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://aisel.aisnet.org/ecis2017_rip/46 oa: '1' page: 2970-2979 publication: Proceedings of the 25th European Conference on Information Systems (ECIS) status: public title: Towards a Lean Approach for Gamifying Education type: conference user_id: '14052' year: '2017' ... --- _id: '110' abstract: - lang: eng text: 'We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al.: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. Theoretical algorithm design for speed scaling problems often tends to discretize problems, as our tools in the discrete realm are often better developed or understood. Using the above speed scaling variant with variable, continuous maximal processor speeds and energy prices as an example, we demonstrate that a more direct approach via tools from variational calculus can not only lead to a very concise and elegant formulation and analysis, but also avoids the “explosion of variables/constraints” that often comes with discretizing. Using well-known tools from calculus of variations, we derive combinatorial optimality characteristics for our continuous problem and provide a quite concise and simple correctness proof.' author: - first_name: Antonios full_name: Antoniadis, Antonios last_name: Antoniadis - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Sebastian full_name: Ott, Sebastian last_name: Ott - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science. 2017:1-13. doi:10.1016/j.tcs.2017.03.021' apa: 'Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2017). Continuous Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer Science, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021' bibtex: '@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling with Variability: A Simple and Direct Approach}, DOI={10.1016/j.tcs.2017.03.021}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017}, pages={1–13} }' chicago: 'Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, 2017, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021.' ieee: 'A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling with Variability: A Simple and Direct Approach,” Theoretical Computer Science, pp. 1–13, 2017.' mla: 'Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical Computer Science, Elsevier, 2017, pp. 1–13, doi:10.1016/j.tcs.2017.03.021.' short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science (2017) 1–13. date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:55Z ddc: - '040' department: - _id: '63' doi: 10.1016/j.tcs.2017.03.021 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:07:43Z date_updated: 2018-03-21T13:07:43Z file_id: '1567' file_name: 110-TCSSubmission.pdf file_size: 494600 relation: main_file success: 1 file_date_updated: 2018-03-21T13:07:43Z has_accepted_license: '1' language: - iso: eng page: 1-13 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Theoretical Computer Science publisher: Elsevier status: public title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach' type: journal_article user_id: '477' year: '2017' ... --- _id: '16338' abstract: - lang: eng text: To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system’s virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Brandt S, Fischer M, Gerges M, Jähn C, Berssenbrügge J. Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In: Volume 1: 37th Computers and Information in Engineering Conference. Vol 1. ; 2017:91:1-91:10. doi:10.1115/detc2017-67528' apa: 'Brandt, S., Fischer, M., Gerges, M., Jähn, C., & Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA. https://doi.org/10.1115/detc2017-67528' bibtex: '@inproceedings{Brandt_Fischer_Gerges_Jähn_Berssenbrügge_2017, title={Automatic Derivation of Geometric Properties of Components From 3D Polygon Models}, volume={1}, DOI={10.1115/detc2017-67528}, booktitle={Volume 1: 37th Computers and Information in Engineering Conference}, author={Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }' chicago: 'Brandt, Sascha, Matthias Fischer, Maria Gerges, Claudius Jähn, and Jan Berssenbrügge. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” In Volume 1: 37th Computers and Information in Engineering Conference, 1:91:1-91:10, 2017. https://doi.org/10.1115/detc2017-67528.' ieee: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.' mla: 'Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” Volume 1: 37th Computers and Information in Engineering Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.' short: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, J. Berssenbrügge, in: Volume 1: 37th Computers and Information in Engineering Conference, 2017, pp. 91:1-91:10.' conference: end_date: 2017-08-09 location: Cleveland, USA name: 37th Computers and Information in Engineering Conference start_date: 2017-08-06 date_created: 2020-03-24T08:36:05Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1115/detc2017-67528 intvolume: ' 1' language: - iso: eng page: 91:1-91:10 publication: 'Volume 1: 37th Computers and Information in Engineering Conference' publication_identifier: isbn: - '9780791858110' publication_status: published status: public title: Automatic Derivation of Geometric Properties of Components From 3D Polygon Models type: conference user_id: '15415' volume: 1 year: '2017' ... --- _id: '16339' abstract: - lang: ger text: In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Brandt S, Fischer M. Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2017:415-427.' apa: 'Brandt, S., & Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.' bibtex: '@inproceedings{Brandt_Fischer_2017, place={Paderborn}, title={Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}, volume={369}, booktitle={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Brandt, Sascha and Fischer, Matthias}, year={2017}, pages={415–427} }' chicago: 'Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, 369:415–27. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017.' ieee: S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427. mla: Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 415–27. short: 'S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.' conference: end_date: 2017-05-12 location: Paderborn name: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 start_date: 2017-05-11 date_created: 2020-03-24T08:44:25Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' intvolume: ' 369' language: - iso: ger page: 415-427 place: Paderborn publication: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 publication_status: published publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell type: conference user_id: '11648' volume: 369 year: '2017' ... --- _id: '16347' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13' apa: 'Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13' bibtex: '@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria}, series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A. and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture Notes in Computer Science} }' chicago: 'Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.' ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181. mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13. short: 'M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski, M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, Springer, Vienna, Austria, 2017, pp. 168–181.' date_created: 2020-03-27T14:32:39Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1007/978-3-319-72751-6_13 editor: - first_name: Antonio full_name: Fernández Anta, Antonio last_name: Fernández Anta - first_name: Tomasz full_name: Jurdzinski, Tomasz last_name: Jurdzinski - first_name: Miguel A. full_name: Mosteiro, Miguel A. last_name: Mosteiro - first_name: Yanyong full_name: Zhang, Yanyong last_name: Zhang intvolume: ' 10718' language: - iso: eng page: 168-181 place: Vienna, Austria publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: conference user_id: '15415' volume: 10718 year: '2017' ... --- _id: '16348' author: - first_name: Felix full_name: Biermeier, Felix last_name: Biermeier - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Biermeier F, Feldkord B, Malatyali M, Meyer auf der Heide F. A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2017:285-300. doi:10.1007/978-3-319-89441-6_21' apa: Biermeier, F., Feldkord, B., Malatyali, M., & Meyer auf der Heide, F. (2017). A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries. In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) (pp. 285–300). Springer. https://doi.org/10.1007/978-3-319-89441-6_21 bibtex: '@inproceedings{Biermeier_Feldkord_Malatyali_Meyer auf der Heide_2017, title={A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries}, DOI={10.1007/978-3-319-89441-6_21}, booktitle={Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Biermeier, Felix and Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2017}, pages={285–300} }' chicago: Biermeier, Felix, Björn Feldkord, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” In Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 285–300. Springer, 2017. https://doi.org/10.1007/978-3-319-89441-6_21. ieee: F. Biermeier, B. Feldkord, M. Malatyali, and F. Meyer auf der Heide, “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries,” in Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), 2017, pp. 285–300. mla: Biermeier, Felix, et al. “A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries.” Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300, doi:10.1007/978-3-319-89441-6_21. short: 'F. Biermeier, B. Feldkord, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2017, pp. 285–300.' date_created: 2020-03-30T09:25:18Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1007/978-3-319-89441-6_21 language: - iso: eng page: 285 - 300 publication: Proceedings of the 15th Workshop on Approximation and Online Algorithms (WAOA) publisher: Springer status: public title: A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries type: conference user_id: '15415' year: '2017' ... --- _id: '16349' author: - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Podlipyan P, Li S, Markarian C, Meyer auf der Heide F. A Continuous Strategy for Collisionless Gathering. In: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS). ; 2017:182-197. doi:10.1007/978-3-319-72751-6_14 ' apa: Podlipyan, P., Li, S., Markarian, C., & Meyer auf der Heide, F. (2017). A Continuous Strategy for Collisionless Gathering. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) (pp. 182–197). https://doi.org/10.1007/978-3-319-72751-6_14 bibtex: '@inproceedings{Podlipyan_Li_Markarian_Meyer auf der Heide_2017, title={A Continuous Strategy for Collisionless Gathering}, DOI={10.1007/978-3-319-72751-6_14 }, booktitle={Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)}, author={Podlipyan, Pavel and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={182–197} }' chicago: Podlipyan, Pavel, Shouwei Li, Christine Markarian, and Friedhelm Meyer auf der Heide. “A Continuous Strategy for Collisionless Gathering.” In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 182–97, 2017. https://doi.org/10.1007/978-3-319-72751-6_14 . ieee: P. Podlipyan, S. Li, C. Markarian, and F. Meyer auf der Heide, “A Continuous Strategy for Collisionless Gathering,” in Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197. mla: Podlipyan, Pavel, et al. “A Continuous Strategy for Collisionless Gathering.” Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–97, doi:10.1007/978-3-319-72751-6_14 . short: 'P. Podlipyan, S. Li, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS), 2017, pp. 182–197.' date_created: 2020-03-30T09:43:05Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-72751-6_14 ' language: - iso: eng page: 182-197 publication: Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) status: public title: A Continuous Strategy for Collisionless Gathering type: conference user_id: '15415' year: '2017' ... --- _id: '19961' abstract: - lang: eng text: The self-organizing bio-hybrid collaboration ofrobots and natural plants allows for a variety of interestingapplications. As an example we investigate how robots can beused to control the growth and motion of a natural plant, using LEDs to provide stimuli. We follow an evolutionaryrobotics approach where task performance is determined bymonitoring the plant's reaction. First, we do initial plantexperiments with simple, predetermined controllers. Then weuse image sampling data as a model of the dynamics ofthe plant tip xy position. Second, we use this approach toevolve robot controllers in simulation. The task is to makethe plant approach three predetermined, distinct points in anxy-plane. Finally, we test the evolved controllers in real plantexperiments and find that we cross the reality gap successfully. We shortly describe how we have extended from plant tipto many points on the plant, for a model of the plant stemdynamics. Future work will extend to two-axes image samplingfor a 3-d approach. author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Daniel Nicolas full_name: Hofstadler, Daniel Nicolas last_name: Hofstadler - first_name: Mary Katherine full_name: Heinrich, Mary Katherine last_name: Heinrich - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Wahby M, Hofstadler DN, Heinrich MK, Zahadat P, Hamann H. An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. ; 2016. doi:10.1109/saso.2016.8' apa: 'Wahby, M., Hofstadler, D. N., Heinrich, M. K., Zahadat, P., & Hamann, H. (2016). An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap. In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems. https://doi.org/10.1109/saso.2016.8' bibtex: '@inproceedings{Wahby_Hofstadler_Heinrich_Zahadat_Hamann_2016, title={An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap}, DOI={10.1109/saso.2016.8}, booktitle={Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems}, author={Wahby, Mostafa and Hofstadler, Daniel Nicolas and Heinrich, Mary Katherine and Zahadat, Payam and Hamann, Heiko}, year={2016} }' chicago: 'Wahby, Mostafa, Daniel Nicolas Hofstadler, Mary Katherine Heinrich, Payam Zahadat, and Heiko Hamann. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” In Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016. https://doi.org/10.1109/saso.2016.8.' ieee: 'M. Wahby, D. N. Hofstadler, M. K. Heinrich, P. Zahadat, and H. Hamann, “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap,” in Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.' mla: 'Wahby, Mostafa, et al. “An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap.” Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016, doi:10.1109/saso.2016.8.' short: 'M. Wahby, D.N. Hofstadler, M.K. Heinrich, P. Zahadat, H. Hamann, in: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems, 2016.' date_created: 2020-10-08T12:57:13Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/saso.2016.8 language: - iso: eng publication: Proc. of the 10th International Conference on Self-Adaptive and Self-Organizing Systems publication_identifier: isbn: - '9781509035342' publication_status: published status: public title: 'An Evolutionary Robotics Approach to the Control of Plant Growth and Motion: Modeling Plants and Crossing the Reality Gap' type: conference user_id: '15415' year: '2016' ... --- _id: '19968' author: - first_name: Mary Katherine full_name: Heinrich, Mary Katherine last_name: Heinrich - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Daniel Nicolas full_name: Hofstadler, Daniel Nicolas last_name: Hofstadler - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Phil full_name: Ayres, Phil last_name: Ayres - first_name: Kasper full_name: Stoy, Kasper last_name: Stoy - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Heinrich MK, Wahby M, Divband Soorati M, et al. Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). ; 2016. doi:10.1109/fas-w.2016.43' apa: 'Heinrich, M. K., Wahby, M., Divband Soorati, M., Hofstadler, D. N., Zahadat, P., Ayres, P., … Hamann, H. (2016). Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures. In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO). https://doi.org/10.1109/fas-w.2016.43' bibtex: '@inproceedings{Heinrich_Wahby_Divband Soorati_Hofstadler_Zahadat_Ayres_Stoy_Hamann_2016, title={Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures}, DOI={10.1109/fas-w.2016.43}, booktitle={Proc. of the 1st International Workshop on Self-Organising Construction (SOCO)}, author={Heinrich, Mary Katherine and Wahby, Mostafa and Divband Soorati, Mohammad and Hofstadler, Daniel Nicolas and Zahadat, Payam and Ayres, Phil and Stoy, Kasper and Hamann, Heiko}, year={2016} }' chicago: 'Heinrich, Mary Katherine, Mostafa Wahby, Mohammad Divband Soorati, Daniel Nicolas Hofstadler, Payam Zahadat, Phil Ayres, Kasper Stoy, and Heiko Hamann. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” In Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016. https://doi.org/10.1109/fas-w.2016.43.' ieee: 'M. K. Heinrich et al., “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures,” in Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.' mla: 'Heinrich, Mary Katherine, et al. “Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures.” Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016, doi:10.1109/fas-w.2016.43.' short: 'M.K. Heinrich, M. Wahby, M. Divband Soorati, D.N. Hofstadler, P. Zahadat, P. Ayres, K. Stoy, H. Hamann, in: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO), 2016.' date_created: 2020-10-09T13:57:21Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/fas-w.2016.43 language: - iso: eng publication: Proc. of the 1st International Workshop on Self-Organising Construction (SOCO) publication_identifier: isbn: - '9781509036516' publication_status: published status: public title: 'Self-Organized Construction with Continuous Building Material: Higher Flexibility Based on Braided Structures' type: conference user_id: '15415' year: '2016' ... --- _id: '19969' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Jean full_name: Botev, Jean last_name: Botev - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Eliseo full_name: Ferrante, Eliseo last_name: Ferrante - first_name: Oliver full_name: Kosak, Oliver last_name: Kosak - first_name: Jean-Marc full_name: Montanier, Jean-Marc last_name: Montanier - first_name: Sanaz full_name: Mostaghim, Sanaz last_name: Mostaghim - first_name: Richard full_name: Redpath, Richard last_name: Redpath - first_name: Jon full_name: Timmis, Jon last_name: Timmis - first_name: Frank full_name: Veenstra, Frank last_name: Veenstra - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Aleš full_name: Zamuda, Aleš last_name: Zamuda citation: 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' 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' 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} }' 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.' 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.' 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.' 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). date_created: 2020-10-09T14:04:05Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.3389/frobt.2016.00014 language: - iso: eng publication: Frontiers in Robotics and AI publication_identifier: issn: - 2296-9144 publication_status: published status: public title: 'Hybrid Societies: Challenges and Perspectives in the Design of Collective Behavior in Self-organizing Systems' type: journal_article user_id: '15415' year: '2016' ... --- _id: '19979' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati citation: 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' 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} }' 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.' 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.' 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.' short: 'H. Hamann, M. Divband Soorati, in: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016), 2016.' date_created: 2020-10-12T13:06:07Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/IROS.2016.7759845 language: - iso: eng publication: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2016) status: public title: 'Robot Self-Assembly as Adaptive Growth Process: Collective Selection of Seed Position and Self-Organizing Tree-Structures' type: conference user_id: '15415' year: '2016' ... --- _id: '19983' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Eliseo full_name: Ferrante, Eliseo last_name: Ferrante citation: 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' 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} }' 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.' 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.' 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.' short: M. Dorigo, H. Hamann, G. Valentini, E. Ferrante, Journal of Autonomous Agents and Multi-Agent Systems 30 (2016) 553–580. date_created: 2020-10-13T08:33:37Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/s10458-015-9323-3 intvolume: ' 30' issue: '3' language: - iso: eng page: 553-580 publication: Journal of Autonomous Agents and Multi-Agent Systems status: public title: 'Collective Decision with 100 Kilobots: Speed vs Accuracy in Binary Discrimination Problems' type: journal_article user_id: '15415' volume: 30 year: '2016' ... --- _id: '200' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees citation: 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. bibtex: '@book{Drees_2016, title={Existence and Properties of Pure Nash Equilibria in Budget Games}, publisher={Universität Paderborn}, author={Drees, Maximilian}, year={2016} }' 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. mla: Drees, Maximilian. 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. date_created: 2017-10-17T12:41:31Z date_updated: 2022-01-06T06:54:18Z ddc: - '040' department: - _id: '63' - _id: '541' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:45:57Z date_updated: 2018-03-21T10:45:57Z file_id: '1525' file_name: 200-thesis.pdf file_size: 880390 relation: main_file success: 1 file_date_updated: 2018-03-21T10:45:57Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn related_material: link: - relation: confirmation url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-24915 status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Existence and Properties of Pure Nash Equilibria in Budget Games type: dissertation user_id: '15415' year: '2016' ... --- _id: '20000' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo 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' 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} }' 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.' 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.' 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.' date_created: 2020-10-15T09:55:35Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-44427-7_15 language: - iso: eng place: Cham publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016 publication_identifier: isbn: - '9783319444260' - '9783319444277' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Population Coding: A New Design Paradigm for Embodied Distributed Systems' type: conference user_id: '15415' year: '2016' ... --- _id: '20001' author: - first_name: Sebastian full_name: von Mammen, Sebastian last_name: von Mammen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Michael full_name: Heider, Michael last_name: Heider citation: 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' 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' 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.' 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.' 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.' short: 'S. von Mammen, H. Hamann, M. Heider, in: ACM Symposium on Virtual Reality Software and Technology (VRST), 2016.' date_created: 2020-10-15T10:00:23Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1145/2993369.2993400 language: - iso: eng publication: ACM Symposium on Virtual Reality Software and Technology (VRST) publication_identifier: isbn: - '9781450344913' publication_status: published status: public title: 'Robot Gardens: An Augmented Reality Prototype for Plant-Robot Biohybrid Systems' type: conference user_id: '15415' year: '2016' ... --- _id: '20002' author: - first_name: Milan full_name: Rybář, Milan last_name: Rybář - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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' 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} }' 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.' 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.' short: 'M. Rybář, H. Hamann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016), 2016.' date_created: 2020-10-15T10:05:11Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1145/2908812.2908815 language: - iso: eng publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2016) publication_identifier: isbn: - '9781450342063' publication_status: published status: public title: 'Inspiration-Triggered Search: Towards Higher Complexities by Mimicking Creative Processes' type: conference user_id: '15415' year: '2016' ... --- _id: '20003' author: - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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.' 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).' 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} }' 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.' 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.' 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.' short: 'Y. Khaluf, H. Hamann, in: ANTS 2016, 2016, p. 298.' date_created: 2020-10-15T10:16:39Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' intvolume: ' 9882' language: - iso: eng page: '298' publication: ANTS 2016 status: public title: 'On the Definition of Self-organizing Systems: Relevance of Positive/Negative Feedback and Fluctuations' type: conference user_id: '15415' volume: 9882 year: '2016' ... --- _id: '20004' author: - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Davide full_name: Brambilla, Davide last_name: Brambilla - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo citation: 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' 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 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} }' 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. 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. 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. short: 'G. Valentini, D. Brambilla, H. Hamann, M. Dorigo, in: 10th Int. Conf. on Swarm Intelligence, ANTS 2016, 2016.' date_created: 2020-10-15T10:22:20Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-44427-7_6 language: - iso: eng publication: 10th Int. Conf. on Swarm Intelligence, ANTS 2016 publication_identifier: isbn: - '9783319444260' - '9783319444277' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Collective Perception of Environmental Features in a Robot Swarm type: conference user_id: '15415' year: '2016' ... --- _id: '210' author: - first_name: Lennart full_name: Leder, Lennart last_name: Leder citation: ama: Leder L. Congestion Games with Mixed Objectives. Universität Paderborn; 2016. apa: Leder, L. (2016). Congestion Games with Mixed Objectives. Universität Paderborn. bibtex: '@book{Leder_2016, title={Congestion Games with Mixed Objectives}, publisher={Universität Paderborn}, author={Leder, Lennart}, year={2016} }' chicago: Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016. ieee: L. Leder, Congestion Games with Mixed Objectives. Universität Paderborn, 2016. mla: Leder, Lennart. Congestion Games with Mixed Objectives. Universität Paderborn, 2016. short: L. Leder, Congestion Games with Mixed Objectives, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:54:42Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Congestion Games with Mixed Objectives type: mastersthesis user_id: '14052' year: '2016' ... --- _id: '215' abstract: - lang: eng 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.' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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' 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 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:33Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1145/2935764.2935783 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:41:40Z date_updated: 2018-03-21T10:41:40Z file_id: '1518' file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf file_size: 352996 relation: main_file success: 1 file_date_updated: 2018-03-21T10:41:40Z has_accepted_license: '1' language: - iso: eng page: 417--427 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration type: conference user_id: '14955' year: '2016' ... --- _id: '17655' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt - first_name: C.M. full_name: Jonker, C.M. last_name: Jonker citation: 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' 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.' 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.' 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.' short: 'G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.' date_created: 2020-08-06T15:20:30Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.3233/978-1-61499-672-9-417 extern: '1' keyword: - agents - action - repeated reciprocation - fixed - floating - network - Nash equilibrium - social welfare - price of anarchy - price of stability - convex combination language: - iso: eng page: 417-425 publication: Proceedings of the 2016 European Conference on Artificial Intelligence series_title: Frontiers in Artificial Intelligence and Applications status: public title: The Game of Reciprocation Habits type: conference user_id: '83983' volume: 'Volume 285: ECAI 2016' year: '2016' ... --- _id: '17656' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs full_name: de Weerdt, Mathijs last_name: de Weerdt - first_name: Catholijn full_name: Jonker, Catholijn last_name: Jonker citation: 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.' 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.' 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} }' 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.' 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. 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.' date_created: 2020-08-06T15:20:45Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - agent's influence - behavior - convergence - perron-frobenius - reciprocal interaction - repeated reciprocation language: - iso: eng page: 1431-1432 place: Richland, SC publication: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems publication_identifier: isbn: - 978-1-4503-4239-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '16 status: public title: The Convergence of Reciprocation type: conference user_id: '83983' year: '2016' ... --- _id: '177' 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.' author: - first_name: Faisal N. full_name: Abu-Khzam, Faisal N. last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: 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 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:26Z date_updated: 2022-01-06T06:53:17Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_35 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:15:18Z date_updated: 2018-11-02T14:15:18Z file_id: '5266' file_name: OnTheParameterizedParallelComp.pdf file_size: 293345 relation: main_file success: 1 file_date_updated: 2018-11-02T14:15:18Z has_accepted_license: '1' language: - iso: eng page: 477-488 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: On the Parameterized Parallel Complexity and the Vertex Cover Problem type: conference user_id: '477' year: '2016' ... --- _id: '187' 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 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} }' 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. ieee: F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 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. date_created: 2017-10-17T12:41:28Z date_updated: 2022-01-06T06:53:51Z ddc: - '040' department: - _id: '63' doi: 10.1145/2936716 editor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:31:42Z date_updated: 2018-03-21T12:31:42Z file_id: '1531' file_name: 187-a1-heide.pdf file_size: 34053 relation: main_file success: 1 file_date_updated: 2018-03-21T12:31:42Z has_accepted_license: '1' issue: '1' page: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Parallel Computing (TOPC) status: public title: Introduction to the Special Issue on SPAA 2014 type: journal_editor user_id: '15504' year: '2016' ... --- _id: '207' abstract: - lang: eng 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} author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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' 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 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. 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. 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. 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.' date_created: 2017-10-17T12:41:32Z date_updated: 2022-01-06T06:54:33Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_42 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:18:51Z date_updated: 2018-11-02T14:18:51Z file_id: '5268' file_name: Cost-EfficientSchedulingOnMach.pdf file_size: 608614 relation: main_file success: 1 file_date_updated: 2018-11-02T14:18:51Z has_accepted_license: '1' language: - iso: eng page: 578--592 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) status: public title: Cost-efficient Scheduling on Machines from the Cloud type: conference user_id: '477' year: '2016' ... --- _id: '209' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:32Z date_updated: 2022-01-06T06:54:41Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-48749-6_47 external_id: arxiv: - '1607.05143' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:03:44Z date_updated: 2018-10-31T17:03:44Z file_id: '5233' file_name: Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf file_size: 235739 relation: main_file success: 1 file_date_updated: 2018-10-31T17:03:44Z has_accepted_license: '1' language: - iso: eng page: 655--669 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Congestion Games with Mixed Objectives type: conference user_id: '14052' year: '2016' ... --- _id: '5406' author: - first_name: Jonas full_name: Bülling, Jonas last_name: Bülling citation: ama: Bülling J. 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. 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} }' chicago: Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016. ieee: J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016. mla: Bülling, Jonas. 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. date_created: 2018-11-07T09:26:42Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng status: public title: Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden type: bachelorsthesis user_id: '22704' year: '2016' ... --- _id: '5407' author: - first_name: Jörn full_name: Koepe, Jörn last_name: Koepe citation: 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} }' chicago: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. ieee: J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016. mla: Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016. short: J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016. date_created: 2018-11-07T09:45:57Z date_updated: 2022-01-06T07:01:51Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public title: Price-Based Allocation Games type: bachelorsthesis user_id: '477' year: '2016' ... --- _id: '688' author: - first_name: Damian full_name: Kutzias, Damian last_name: Kutzias citation: 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. bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }' 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. mla: Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016. short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016. date_created: 2017-11-14T06:50:35Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Friendship Processes in Network Creation Games type: mastersthesis user_id: '477' year: '2016' ... --- _id: '689' author: - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: ama: Schaefer JS. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn; 2016. apa: Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn. bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }' chicago: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. ieee: J. S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. mla: Schaefer, Johannes Sebastian. Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn, 2016. short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016. date_created: 2017-11-14T06:51:37Z date_updated: 2022-01-06T07:03:23Z department: - _id: '63' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Routing Algorithms on Delayed Networks for Disaster Management Support type: mastersthesis user_id: '477' year: '2016' ... --- _id: '16450' abstract: - lang: eng text: "In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$." author: - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016. apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303. bibtex: '@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }' chicago: Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016. mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. short: A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016). date_created: 2020-04-07T07:20:47Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1602.03303' language: - iso: eng publication: arXiv:1602.03303 status: public title: Asymptotically Optimal Gathering on a Grid type: preprint user_id: '15415' year: '2016' ... --- _id: '169' abstract: - lang: eng text: We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study. author: - first_name: Thomas full_name: Kühne, Thomas id: '49079' last_name: Kühne - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016). LNCS 9594. ; 2016:278--293. doi:10.1007/978-3-319-30668-1_18' apa: 'Kühne, T., Hamann, H., Arifulina, S., & Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) (pp. 278--293). https://doi.org/10.1007/978-3-319-30668-1_18' bibtex: '@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={10.1007/978-3-319-30668-1_18}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }' chicago: 'Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 278--293. LNCS 9594, 2016. https://doi.org/10.1007/978-3-319-30668-1_18.' ieee: 'T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.' mla: 'Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293, doi:10.1007/978-3-319-30668-1_18.' short: 'T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.' date_created: 2017-10-17T12:41:25Z date_updated: 2022-01-06T06:52:58Z ddc: - '040' department: - _id: '66' - _id: '238' - _id: '63' doi: 10.1007/978-3-319-30668-1_18 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:41:08Z date_updated: 2018-03-21T12:41:08Z file_id: '1540' file_name: 169-kuehne.pdf file_size: 2069427 relation: main_file success: 1 file_date_updated: 2018-03-21T12:41:08Z has_accepted_license: '1' language: - iso: eng page: 278--293 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016) series_title: LNCS 9594 status: public title: 'Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application' type: conference user_id: '57458' year: '2016' ... --- _id: '1082' author: - first_name: Tobias full_name: Handirk, Tobias last_name: Handirk citation: ama: Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016. apa: Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn. bibtex: '@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }' chicago: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. ieee: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. mla: Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016. short: T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016. date_created: 2017-12-19T10:10:17Z date_updated: 2022-01-06T06:50:51Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Über die Rolle von Informationen in Verkehrsnetzwerken type: bachelorsthesis user_id: '14052' year: '2016' ... --- _id: '154' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr citation: ama: Cord-Landwehr A. Selfish Network Creation - On Variants of Network Creation Games. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016. apa: Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. ieee: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. mla: Cord-Landwehr, Andreas. Selfish Network Creation - On Variants of Network Creation Games. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016. date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:23Z ddc: - '040' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:52:03Z date_updated: 2018-03-21T12:52:03Z file_id: '1551' file_name: 154-dissertation.pdf file_size: 800101 relation: main_file success: 1 file_date_updated: 2018-03-21T12:52:03Z has_accepted_license: '1' intvolume: ' 353' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-942647-72-4 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Selfish Network Creation - On Variants of Network Creation Games type: dissertation user_id: '5786' volume: 353 year: '2016' ... --- _id: '157' abstract: - lang: eng text: Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees. author: - first_name: Jürgen full_name: König, Jürgen last_name: König - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:563--577. doi:10.1007/978-3-319-48749-6_41' apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41 bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }' chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41. ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577. mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41. short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.' date_created: 2017-10-17T12:41:22Z date_updated: 2022-01-06T06:52:32Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-48749-6_41 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:50:29Z date_updated: 2018-03-21T12:50:29Z file_id: '1549' file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf file_size: 753147 relation: main_file success: 1 file_date_updated: 2018-03-21T12:50:29Z has_accepted_license: '1' page: 563--577 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Scheduling with Interjob Communication on Parallel Processors type: conference user_id: '15504' year: '2016' ... --- _id: '159' abstract: - lang: eng text: Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived. author: - first_name: Tobias full_name: Harks, Tobias last_name: Harks - first_name: Martin full_name: Höfer, Martin last_name: Höfer - first_name: Kevin full_name: Schewior, Kevin last_name: Schewior - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571 apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562. https://doi.org/10.1109/TNET.2015.2468571 bibtex: '@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }' chicago: 'Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.' ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016. mla: Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571. short: T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562. date_created: 2017-10-17T12:41:23Z date_updated: 2022-01-06T06:52:40Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1109/TNET.2015.2468571 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:48:02Z date_updated: 2018-03-21T12:48:02Z file_id: '1547' file_name: 159-Harks-Hoefer-Schewior-Skopalik2016.pdf file_size: 1655309 relation: main_file success: 1 file_date_updated: 2018-03-21T12:48:02Z has_accepted_license: '1' issue: '4' language: - iso: eng page: 2553 - 2562 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: IEEE/ACM Transactions on Networking publisher: IEEE status: public title: Routing Games With Progressive Filling type: journal_article user_id: '477' year: '2016' ... --- _id: '149' abstract: - lang: eng text: 'In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).' author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43' apa: Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43 bibtex: '@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }' chicago: Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43. ieee: M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607. mla: Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43. short: 'M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.' date_created: 2017-10-17T12:41:21Z date_updated: 2022-01-06T06:52:10Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-48749-6_43 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:55:43Z date_updated: 2018-03-21T12:55:43Z file_id: '1553' file_name: 149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf file_size: 236253 relation: main_file success: 1 file_date_updated: 2018-03-21T12:55:43Z has_accepted_license: '1' language: - iso: eng page: 593--607 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Strategic Online Facility Location type: conference user_id: '477' year: '2016' ... --- _id: '163' citation: ama: Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016. doi:10.1145/2942358 apa: 'Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358' bibtex: '@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}, DOI={10.1145/2942358}, publisher={ACM}, year={2016} }' chicago: Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358. ieee: F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016. mla: Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM, 2016, doi:10.1145/2942358. short: F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016. conference: end_date: 2016-07-08 location: Paderborn, Germany name: MobiHoc start_date: 2016-07-04 date_created: 2017-10-17T12:41:23Z date_updated: 2022-01-06T06:52:48Z department: - _id: '63' doi: 10.1145/2942358 editor: - first_name: Falko full_name: Dressler, Falko last_name: Dressler - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: ACM status: public title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) type: conference_editor user_id: '15504' year: '2016' ... --- _id: '16351' abstract: - lang: eng text: "Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.\r\n" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Ralf full_name: Petring, Ralf last_name: Petring citation: ama: 'Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 ' apa: Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7 bibtex: '@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS}, title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220}, DOI={10.1007/978-3-319-49487-6_7 }, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}, editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244}, collection={LNCS} }' chicago: Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7 . ieee: M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016, vol. 9220, pp. 226–244. mla: Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 . short: 'M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann, P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.' date_created: 2020-03-30T10:21:53Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-49487-6_7 ' editor: - first_name: Lasse full_name: Kliemann, Lasse last_name: Kliemann - first_name: Peter full_name: Sanders, Peter last_name: Sanders intvolume: ' 9220' language: - iso: eng page: 226-244 publication: Algorithm Engineering publisher: Springer series_title: LNCS status: public title: Algorithm Engineering Aspects of Real-Time Rendering Algorithms type: conference user_id: '15415' volume: 9220 year: '2016' ... --- _id: '16358' author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: 'Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer; 2016. doi:10.1007/978-3-319-53058-1_5 ' apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer. https://doi.org/10.1007/978-3-319-53058-1_5 bibtex: '@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, DOI={10.1007/978-3-319-53058-1_5 }, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016} }' chicago: Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” In Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS). Springer, 2016. https://doi.org/10.1007/978-3-319-53058-1_5 . ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2016. mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016, doi:10.1007/978-3-319-53058-1_5 . short: 'S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.' date_created: 2020-04-01T12:28:09Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-53058-1_5 ' language: - iso: eng publication: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS) publisher: Springer status: public title: The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots type: conference user_id: '15415' year: '2016' ... --- _id: '16359' abstract: - lang: eng text: In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2). author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789' apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789 bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }' chicago: Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 301–312. mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789. short: 'A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.' date_created: 2020-04-01T12:46:35Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1145/2935764.2935789 language: - iso: eng page: 301-312 publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publisher: ACM status: public title: Asymptotically Optimal Gathering on a Grid type: conference user_id: '15415' year: '2016' ... --- _id: '16360' abstract: - lang: eng text: 'We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. ' author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51' apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51 bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }' 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.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51. 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,” in Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 2016, pp. 689–699. mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51. short: 'S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.' date_created: 2020-04-01T12:56:43Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1109/IPDPS.2016.51 language: - iso: eng page: 689-699 publication: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Gathering a Closed Chain of Robots on a Grid type: conference user_id: '15415' year: '2016' ... --- _id: '16364' author: - first_name: Alexander full_name: Macker, Alexander last_name: Macker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2016. doi:10.1109/ipdps.2016.91' apa: Macker, A., Malatyali, M., & Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps.2016.91 bibtex: '@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={10.1109/ipdps.2016.91}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }' chicago: Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016. https://doi.org/10.1109/ipdps.2016.91. ieee: A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016. mla: Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016, doi:10.1109/ipdps.2016.91. short: 'A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.' date_created: 2020-04-02T10:14:25Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1109/ipdps.2016.91 language: - iso: eng publication: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS) publication_identifier: isbn: - '9781509021406' publication_status: published status: public title: On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams type: conference user_id: '15415' year: '2016' ... --- _id: '16396' abstract: - lang: eng text: "We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$." author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. arXiv:160901184. 2016. apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. ArXiv:1609.01184. bibtex: '@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }' chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016. ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” arXiv:1609.01184. 2016. mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” ArXiv:1609.01184, 2016. short: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016). date_created: 2020-04-03T09:24:28Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1609.01184' language: - iso: eng publication: arXiv:1609.01184 status: public title: Cost-efficient Scheduling on Machines from the Cloud type: preprint user_id: '15415' year: '2016' ... --- _id: '139' abstract: - lang: eng text: 'We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).' author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: 'Peter ' full_name: 'Pietrzyk, Peter ' last_name: Pietrzyk citation: ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216. doi:10.1007/s10878-015-9915-5 apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk, P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization, (4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5 bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={10.1007/s10878-015-9915-5}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }' chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.' ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” Journal of Combinatorial Optimization, no. 4, pp. 1197--1216, 2016. mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5. short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216. date_created: 2017-10-17T12:41:18Z date_updated: 2022-01-06T06:51:46Z ddc: - '000' department: - _id: '63' doi: 10.1007/s10878-015-9915-5 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:57:25Z date_updated: 2018-11-02T15:57:25Z file_id: '5318' file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf file_size: 654903 relation: main_file success: 1 file_date_updated: 2018-11-02T15:57:25Z has_accepted_license: '1' issue: '4' language: - iso: eng page: ' 1197--1216' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Journal of Combinatorial Optimization publisher: Springer status: public title: Towards the price of leasing online type: journal_article user_id: '477' year: '2016' ... --- _id: '143' abstract: - lang: eng text: 'We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].' author: - first_name: 'Faisal N. ' full_name: 'Abu-Khzam, Faisal N. ' last_name: Abu-Khzam - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Pavel full_name: Podlipyan, Pavel last_name: Podlipyan citation: ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON). LNCS. ; 2016:92-102. doi:10.1007/978-3-319-42634-1_8' apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) (pp. 92–102). https://doi.org/10.1007/978-3-319-42634-1_8 bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={10.1007/978-3-319-42634-1_8}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }' chicago: Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 92–102. LNCS, 2016. https://doi.org/10.1007/978-3-319-42634-1_8. ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102. mla: Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102, doi:10.1007/978-3-319-42634-1_8. short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.' date_created: 2017-10-17T12:41:19Z date_updated: 2022-01-06T06:51:57Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-319-42634-1_8 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:20:45Z date_updated: 2018-11-02T14:20:45Z file_id: '5269' file_name: TheMonotoneCircuitValueProblem.pdf file_size: 234587 relation: main_file success: 1 file_date_updated: 2018-11-02T14:20:45Z has_accepted_license: '1' language: - iso: eng page: 92-102 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON) series_title: LNCS status: public title: The Monotone Circuit Value Problem with Bounded Genus Is in NC type: conference user_id: '477' year: '2016' ... --- _id: '145' abstract: - lang: eng text: 'Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. ' author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi citation: ama: 'Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience. 2016;28(5):1655-1677. doi:10.1002/cpe.3716' apa: 'Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677. https://doi.org/10.1002/cpe.3716' bibtex: '@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }' chicago: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience 28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.' ieee: 'M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016.' mla: 'Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.' short: 'M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.' date_created: 2017-10-17T12:41:20Z date_updated: 2022-01-06T06:52:00Z ddc: - '040' department: - _id: '79' - _id: '63' - _id: '541' doi: 10.1002/cpe.3716 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:57:57Z date_updated: 2018-03-21T12:57:57Z file_id: '1556' file_name: 145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf file_size: 3121363 relation: main_file success: 1 file_date_updated: 2018-03-21T12:57:57Z has_accepted_license: '1' intvolume: ' 28' issue: '5' page: 1655-1677 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: 'Concurrency and Computation: Practice and Experience' publication_status: published publisher: Wiley Online Library status: public title: Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM type: journal_article user_id: '14052' volume: 28 year: '2016' ... --- _id: '251' author: - first_name: Karlson full_name: Pfannschmidt, Karlson last_name: Pfannschmidt citation: ama: Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015. apa: Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn. bibtex: '@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }' chicago: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015. ieee: K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015. mla: Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015. short: K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:41Z date_updated: 2022-01-06T06:56:50Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Solving the aggregated bandits problem type: mastersthesis user_id: '14052' year: '2015' ... --- _id: '19959' author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: 'Wahby M, Hamann H. On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In: Applications of Evolutionary Computation (EvoApplications 2015). ; 2015. doi:10.1007/978-3-319-16549-3_61' apa: 'Wahby, M., & Hamann, H. (2015). On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking. In Applications of Evolutionary Computation (EvoApplications 2015). https://doi.org/10.1007/978-3-319-16549-3_61' bibtex: '@inproceedings{Wahby_Hamann_2015, title={On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking}, DOI={10.1007/978-3-319-16549-3_61}, booktitle={Applications of Evolutionary Computation (EvoApplications 2015)}, author={Wahby, Mostafa and Hamann, Heiko}, year={2015} }' chicago: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” In Applications of Evolutionary Computation (EvoApplications 2015), 2015. https://doi.org/10.1007/978-3-319-16549-3_61.' ieee: 'M. Wahby and H. Hamann, “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking,” in Applications of Evolutionary Computation (EvoApplications 2015), 2015.' mla: 'Wahby, Mostafa, and Heiko Hamann. “On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking.” Applications of Evolutionary Computation (EvoApplications 2015), 2015, doi:10.1007/978-3-319-16549-3_61.' short: 'M. Wahby, H. Hamann, in: Applications of Evolutionary Computation (EvoApplications 2015), 2015.' date_created: 2020-10-08T12:36:48Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-16549-3_61 language: - iso: eng publication: Applications of Evolutionary Computation (EvoApplications 2015) status: public title: 'On the Tradeoff between Hardware Protection and Optimization Success: A Case Study in Onboard Evolutionary Robotics for Autonomous Parallel Parking' type: conference user_id: '15415' year: '2015' ... --- _id: '19960' abstract: - lang: eng 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. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Daniel full_name: Hofstadler, Daniel last_name: Hofstadler - first_name: Kasper full_name: Stoy, Kasper last_name: Stoy - first_name: Sebastian full_name: Risi, Sebastian last_name: Risi - first_name: Andres full_name: Faina, Andres last_name: Faina - first_name: Frank full_name: Veenstra, Frank last_name: Veenstra - first_name: Serge full_name: Kernbach, Serge last_name: Kernbach - first_name: Igor full_name: Kuksin, Igor last_name: Kuksin - first_name: Olga full_name: Kernbach, Olga last_name: Kernbach - first_name: Phil full_name: Ayres, Phil last_name: Ayres - first_name: Przemyslaw full_name: Wojtaszek, Przemyslaw last_name: Wojtaszek 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 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} }' 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. 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. 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.' date_created: 2020-10-08T12:44:10Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1109/ssci.2015.158 language: - iso: eng publication: Proceedings of the 2015 IEEE Symposium on Artificial Life (IEEE ALIFE'15) publication_identifier: isbn: - '9781479975600' publication_status: published status: public title: Flora Robotica - Mixed Societies of Symbiotic Robot-Plant Bio-Hybrids type: conference user_id: '15415' year: '2015' ... --- _id: '19962' abstract: - lang: eng 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. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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} }' 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.' ieee: 'H. Hamann, “Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity,” Artificial Life, pp. 464–480, 2015.' 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.' short: H. Hamann, Artificial Life (2015) 464–480. date_created: 2020-10-08T14:36:25Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1162/artl_a_00186 language: - iso: eng page: 464-480 publication: Artificial Life publication_identifier: issn: - 1064-5462 - 1530-9185 publication_status: published status: public title: 'Lessons from Speciation Dynamics: How to Generate Selective Pressure Towards Diversity' type: journal_article user_id: '15415' year: '2015' ... --- _id: '19966' 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. author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Alexander full_name: Weinhold, Alexander last_name: Weinhold - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2020-10-09T13:41:56Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.4108/eai.3-12-2015.2262877 language: - iso: eng publication: Proceedings of the 9th EAI International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS) publication_identifier: isbn: - '9781631901003' publication_status: published status: public title: 'Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings' type: conference user_id: '15415' year: '2015' ... --- _id: '19967' author: - first_name: Mostafa full_name: Wahby, Mostafa last_name: Wahby - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati - first_name: Sebastian full_name: von Mammen, Sebastian last_name: von Mammen - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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.' 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.' 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} }' 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.' 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.' 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.' short: 'M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings. 25. Computational Intelligence Workshop, 2015.' date_created: 2020-10-09T13:50:38Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings. 25. Computational Intelligence Workshop status: public title: 'Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth and Motion' type: conference user_id: '15415' year: '2015' ... --- _id: '19980' abstract: - lang: eng 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. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Mohammad full_name: Divband Soorati, Mohammad last_name: Divband Soorati citation: 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} }' 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.' 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.' 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.' short: 'H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.' date_created: 2020-10-12T13:12:25Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1145/2739480.2754676 language: - iso: eng page: 153-160 publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015) publisher: ACM status: public title: 'The Effect of Fitness Function Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge' type: conference user_id: '15415' year: '2015' ... --- _id: '19988' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat citation: 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' 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 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} }' 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. 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. 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.' date_created: 2020-10-13T08:50:38Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.7551/978-0-262-33027-5-ch036 language: - iso: eng page: '174' publication: 13th European Conference on Artificial Life (ECAL 2015) publisher: MIT Press status: public title: Evolving Collective Behaviors With Diverse But Predictable Sensor States type: conference user_id: '15415' year: '2015' ... --- _id: '19989' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Nikolaus full_name: Correll, Nikolaus last_name: Correll - first_name: Janusz full_name: Kacprzyk, Janusz last_name: Kacprzyk - first_name: Witold full_name: Pedrycz, Witold last_name: Pedrycz citation: 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} }' 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. 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. 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. short: 'H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of Computational Intelligence, Springer, 2015, pp. 1423–1431.' date_created: 2020-10-13T09:04:19Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-662-43505-2_74 language: - iso: eng page: 1423-1431 publication: Springer Handbook of Computational Intelligence publisher: Springer status: public title: Probabilistic Modeling of Swarming Systems type: book_chapter user_id: '15415' year: '2015' ... --- _id: '19990' author: - first_name: Hongli full_name: Ding, Hongli last_name: Ding - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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).' 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} }' 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.' 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.' 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.' short: 'H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015), 2015.' date_created: 2020-10-13T09:09:20Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng publication: First International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM 2015) status: public title: 'Dependability in Swarm Robotics: Error Detection and Correction' type: conference user_id: '15415' year: '2015' ... --- _id: '19991' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Daniela full_name: Kengyel, Daniela last_name: Kengyel - first_name: Payam full_name: Zahadat, Payam last_name: Zahadat - first_name: Gerald full_name: Radspieler, Gerald last_name: Radspieler - first_name: Franz full_name: Wotawa, Franz last_name: Wotawa citation: 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.' 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).' 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} }' 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.' 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.' 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.' 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.' date_created: 2020-10-13T09:24:32Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' language: - iso: eng page: 201-217 publication: Principles and Practice of Multi-Agent Systems (PRIMA 2015) status: public title: 'Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms' type: conference user_id: '15415' year: '2015' ... --- _id: '19992' author: - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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' 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} }' 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.' 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.' 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.' short: G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176. date_created: 2020-10-13T09:27:48Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' - _id: '238' doi: 10.1007/s11721-015-0108-8 language: - iso: eng page: 153-176 publication: Swarm Intelligence publication_identifier: issn: - 1935-3812 - 1935-3820 publication_status: published status: public title: 'Time-variant feedback processes in collective decision-making systems: influence and effect of dynamic neighborhood sizes' type: journal_article user_id: '15415' year: '2015' ... --- _id: '20005' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini 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).' 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} }' 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.' 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.' 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.' short: 'M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' date_created: 2020-10-15T12:29:26Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015) status: public title: 'Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off' type: conference user_id: '15415' year: '2015' ... --- _id: '20006' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: ama: 'Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a robot swarm. In: 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. 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} }' chicago: Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective Decisions in a Robot Swarm.” In AAAI-15 Video Proceedings, 2015. ieee: M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions in a robot swarm,” in AAAI-15 Video Proceedings, 2015. mla: Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.” AAAI-15 Video Proceedings, 2015. short: 'M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.' date_created: 2020-10-15T12:38:13Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: AAAI-15 Video Proceedings status: public title: Self-organized collective decisions in a robot swarm type: conference user_id: '15415' year: '2015' ... --- _id: '266' 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". ' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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' 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 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:22Z ddc: - '040' department: - _id: '63' doi: 10.1145/2767386.2767454 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:11Z date_updated: 2018-03-21T09:33:11Z file_id: '1478' file_name: 266-p343-markarian.pdf file_size: 679580 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:11Z has_accepted_license: '1' page: 343-344 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) status: public title: Online Resource Leasing type: conference user_id: '15504' year: '2015' ... --- _id: '267' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian citation: 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} }' chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015. mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:26Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:41Z date_updated: 2018-03-21T09:33:41Z file_id: '1479' file_name: 267-Dissertation_-_Markarian.pdf file_size: 1328685 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:41Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Resource Leasing type: dissertation user_id: '15415' year: '2015' ... --- _id: '320' abstract: - lang: eng 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.' article_number: '2' author: - first_name: Ioannis full_name: Caragiannis, Ioannis last_name: Caragiannis - first_name: Angelo full_name: Fanelli, Angelo last_name: Fanelli - first_name: Nick full_name: Gravin, Nick last_name: Gravin - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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} }' 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.' 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.' 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.' short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015). date_created: 2017-10-17T12:41:54Z date_updated: 2022-01-06T06:59:04Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/2614687 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:40:55Z date_updated: 2018-03-20T07:40:55Z file_id: '1433' file_name: 320-a2-caragiannis.pdf file_size: 260503 relation: main_file success: 1 file_date_updated: 2018-03-20T07:40:55Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Economics and Computation publisher: ACM status: public title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure' type: journal_article user_id: '477' volume: 3 year: '2015' ... --- _id: '316' author: - first_name: Jannis full_name: Pautz, Jannis last_name: Pautz citation: ama: Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015. apa: Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn. bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }' chicago: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015. ieee: J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015. mla: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015. short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:53Z date_updated: 2022-01-06T06:59:01Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Budget Games with priced strategies type: bachelorsthesis user_id: '14052' year: '2015' ... --- _id: '317' author: - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn citation: ama: Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn; 2015. apa: Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn. 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} }' chicago: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015. ieee: 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. short: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:53Z date_updated: 2022-01-06T06:59:02Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:20:34Z date_updated: 2018-03-21T09:20:34Z file_id: '1462' file_name: 317-Dissertation_ClaudiusJaehn.pdf file_size: 20442332 relation: main_file success: 1 file_date_updated: 2018-03-21T09:20:34Z has_accepted_license: '1' language: - iso: ger publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen type: dissertation user_id: '14052' year: '2015' ... --- _id: '270' author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff citation: ama: Abshoff S. 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. 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. ieee: 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. short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:32Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:30:02Z date_updated: 2018-03-21T09:30:02Z file_id: '1476' file_name: 270-Dissertation_-_Abshoff.pdf file_size: 448614 relation: main_file success: 1 file_date_updated: 2018-03-21T09:30:02Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks type: dissertation user_id: '477' year: '2015' ... --- _id: '271' 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. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:41:45Z date_updated: 2022-01-06T06:57:34Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-662-48433-3_14 external_id: arxiv: - '1507.02908' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:29:34Z date_updated: 2018-03-21T09:29:34Z file_id: '1475' file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf file_size: 256718 relation: main_file success: 1 file_date_updated: 2018-03-21T09:29:34Z has_accepted_license: '1' page: 178-189 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT) series_title: Lecture Notes in Computer Science status: public title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games type: conference user_id: '14052' year: '2015' ... --- _id: '274' 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. author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers 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' 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} }' 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.' 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.' 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.' 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.' date_created: 2017-10-17T12:41:45Z date_updated: 2022-01-06T06:57:39Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-21840-3_45 editor: - first_name: Frank full_name: Dehne, Frank last_name: Dehne - first_name: Jörg Rüdiger full_name: Sack, Jörg Rüdiger last_name: Sack - first_name: Ulrike full_name: Stege, Ulrike last_name: Stege file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:28:34Z date_updated: 2018-03-21T09:28:34Z file_id: '1473' file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf file_size: 215498 relation: main_file success: 1 file_date_updated: 2018-03-21T09:28:34Z has_accepted_license: '1' page: 542--553 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings' series_title: Lecture Notes in Computer Science status: public title: Non-preemptive Scheduling on Machines with Setup Times type: conference user_id: '15504' year: '2015' ... --- _id: '275' abstract: - lang: eng text: 'We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC''03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA''14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy.' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Pascal full_name: Lenzner, Pascal last_name: Lenzner citation: 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' 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' 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} }' 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.' 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.' 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.' short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.' date_created: 2017-10-17T12:41:45Z date_updated: 2022-01-06T06:57:40Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-662-48054-0_21 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:27:12Z date_updated: 2018-03-21T09:27:12Z file_id: '1472' file_name: 275-978-3-662-48054-0_21.pdf file_size: 279995 relation: main_file success: 1 file_date_updated: 2018-03-21T09:27:12Z has_accepted_license: '1' language: - iso: eng page: 248--260 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS) series_title: LNCS status: public title: 'Network Creation Games: Think Global - Act Local' type: conference user_id: '477' year: '2015' ... --- _id: '277' author: - first_name: Nils full_name: Kothe, Nils last_name: Kothe citation: 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} }' chicago: Kothe, Nils. 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. 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. date_created: 2017-10-17T12:41:46Z date_updated: 2022-01-06T06:57:44Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk type: bachelorsthesis user_id: '14052' year: '2015' ... --- _id: '17425' author: - first_name: 'Jan ' full_name: 'Berssenbrügge, Jan ' last_name: Berssenbrügge - first_name: Olga full_name: Wiederkehr, Olga last_name: Wiederkehr - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: 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} }' 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.' 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. 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. 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.' date_created: 2020-07-28T09:49:42Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 343' language: - iso: eng page: 65-78 place: Paderborn publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme type: conference user_id: '15415' volume: 343 year: '2015' ... --- _id: '17427' author: - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.' apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342, 107–120. 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} }' 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.' 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. 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. 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.' date_created: 2020-07-28T10:23:18Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 342' language: - iso: eng page: 107-120 place: Paderborn publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell type: conference user_id: '15415' volume: 342 year: '2015' ... --- _id: '17431' citation: 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.' 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.' 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.' 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.' 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_created: 2020-07-28T13:39:25Z date_updated: 2022-01-06T06:53:12Z department: - _id: '63' - _id: '26' edition: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung editor: - first_name: Jürgen full_name: Gausemeier, 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 id: '15523' last_name: Meyer auf der Heide intvolume: ' 342' language: - iso: eng place: Paderborn publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: 'Augmented & Virtual Reality in der Produktentstehung: Grundlagen, Methoden und Werkzeuge; Interaktions- und Visualisierungstechniken, Virtual Prototyping intelligenter technischer Systeme mit AR/VR' type: book_editor user_id: '15415' volume: 342 year: '2015' ... --- _id: '17657' 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. author: - first_name: R. full_name: Cohen, R. last_name: Cohen - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy citation: 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 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} }' 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.' 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. 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. short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1. date_created: 2020-08-06T15:20:58Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1109/TCC.2015.2487964 extern: '1' issue: '99' keyword: - Approximation algorithms - Approximation methods - Bandwidth - Cloud computing - Routing - Schedules - Scheduling language: - iso: eng page: 1-1 publication: Cloud Computing, IEEE Transactions on publication_identifier: issn: - 2168-7161 status: public title: Inter-Datacenter Scheduling of Large Data Flows type: journal_article user_id: '83983' volume: PP year: '2015' ... --- _id: '17658' 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. ' author: - first_name: Reuven full_name: Bar-Yehuda, Reuven last_name: Bar-Yehuda - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Dror full_name: Rawitz, Dror last_name: Rawitz citation: 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 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 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} }' chicago: 'Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics 194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.' ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” Discrete Applied Mathematics , vol. 194, pp. 23–36, 2015. 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. short: R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015) 23–36. date_created: 2020-08-06T15:21:15Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: http://dx.doi.org/10.1016/j.dam.2015.05.013 extern: '1' intvolume: ' 194' keyword: - Local ratio language: - iso: eng page: 23 - 36 publication: 'Discrete Applied Mathematics ' publication_identifier: issn: - 0166-218X publisher: Elsevier status: public title: Bandwidth allocation in cellular networks with multiple interferences type: journal_article user_id: '83983' volume: 194 year: '2015' ... --- _id: '240' 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. author: - first_name: Shouwei full_name: Li, Shouwei last_name: Li - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: 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 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} }' 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. 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. 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.' date_created: 2017-10-17T12:41:38Z date_updated: 2022-01-06T06:56:05Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-21398-9_22 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:28:50Z date_updated: 2018-03-21T10:28:50Z file_id: '1498' file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf file_size: 264482 relation: main_file success: 1 file_date_updated: 2018-03-21T10:28:50Z has_accepted_license: '1' page: 277--288 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON) series_title: Lecture Notes in Computer Science status: public title: Towards Flexible Demands in Online Leasing Problems type: conference user_id: '15504' year: '2015' ... --- _id: '16449' abstract: - lang: eng 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." author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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. 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} }' chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015. ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015. mla: Abshoff, Sebastian, et al. “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). date_created: 2020-04-07T07:20:46Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1510.05454' language: - iso: eng publication: arXiv:1510.05454 status: public title: Gathering a Closed Chain of Robots on a Grid type: preprint user_id: '15415' year: '2015' ... --- _id: '16452' abstract: - lang: eng text: "We consider the problem of dominating set-based virtual backbone used for\r\nrouting in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission ranges and are modeled using the well-established disk graphs. The\r\ncorresponding graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is strongly connected and each node in the graph is\r\neither in the set or has both an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem are of practical significance due to\r\nthe dynamic nature of ad-hoc networks. We present a first distributed\r\napproximation algorithm, with a constant approximation factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover we present a\r\nsimple heuristic algorithm and conduct an extensive simulation study showing\r\nthat our heuristic outperforms previously known approaches for the problem." author: - first_name: 'Faisal N. ' full_name: 'Abu-Khzam, Faisal N. ' last_name: Abu-Khzam - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Michael full_name: Schubert, Michael last_name: Schubert citation: 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. 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} }' 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. 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. mla: Abu-Khzam, Faisal N., et al. “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). date_created: 2020-04-07T12:22:48Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1510.01866' language: - iso: eng publication: arXiv:1510.01866 status: public title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks type: preprint user_id: '15415' year: '2015' ... --- _id: '16460' abstract: - lang: eng text: "Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual online data stream of numbers and, at any point in time, the\r\ncoordinator has to know the k nodes currently observing the largest values, for\r\na given k between 1 and n. We design and analyze an algorithm that solves this\r\nproblem while bounding the amount of messages exchanged between the nodes and\r\nthe coordinator. Our algorithm employs the idea of using filters which,\r\nintuitively speaking, leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous ones. The algorithm uses a number of messages that is\r\non expectation by a factor of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest value observed by any node." author: - first_name: Alexander full_name: Mäcker, 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 id: '15523' last_name: Meyer auf der Heide citation: ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring of Distributed Data Streams. In: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2015:357-364. doi:10.1109/IPDPS.2015.40' apa: Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2015). Online Top-k-Position Monitoring of Distributed Data Streams. In Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 357–364). IEEE. https://doi.org/10.1109/IPDPS.2015.40 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} }' 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. 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. 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. 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.' date_created: 2020-04-08T07:02:15Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1109/IPDPS.2015.40 external_id: arxiv: - '1410.7912' language: - iso: eng page: 357-364 publication: Proceedings of the 29th International Parallel and Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Online Top-k-Position Monitoring of Distributed Data Streams type: conference user_id: '15415' year: '2015' ... --- _id: '16391' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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} }' 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. 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. short: B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (2015) 1–18. date_created: 2020-04-03T06:40:56Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1145/2742341 language: - iso: eng page: 1-18 publication: ACM Transactions on Parallel Computing publication_identifier: issn: - 2329-4949 publication_status: published status: public title: Linear and Competitive Strategies for Continuous Robot Formation Problems type: journal_article user_id: '15415' year: '2015' ... --- _id: '16397' abstract: - lang: eng text: "In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe consider the gathering of a closed chain of point-shaped, anonymous robots\r\non a grid. The robots only have local knowledge about a constant number of\r\nneighboring robots along the chain in both directions. Actions are performed in\r\nthe fully synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain one timestamp of the global clock, also visible to its direct\r\nneighbors. In this synchronous time model, there is no limited view gathering\r\nalgorithm known to perform better than in quadratic runtime. The configurations\r\nthat show the quadratic lower bound are closed chains. In this paper, we\r\npresent the first sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains on a grid." author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Andreas full_name: Andreas Cord-Landwehr, Andreas last_name: Andreas Cord-Landwehr - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Abshoff S, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 150104877. 2015.' apa: 'Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide, F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed  Chain Case. ArXiv: 1501.04877.' 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} }' 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.' 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.' mla: 'Abshoff, Sebastian, et al. “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).' date_created: 2020-04-03T09:36:54Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1501.04877' language: - iso: eng publication: 'ArXiv: 1501.04877' status: public title: 'Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case' type: preprint user_id: '15415' year: '2015' ... --- _id: '20007' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Istvan full_name: Karsai, Istvan last_name: Karsai - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Allison full_name: Hilbun, Allison last_name: Hilbun citation: ama: 'Hamann H, Karsai I, Schmickl T, Hilbun A. The common stomach: Organizing task allocation in wasp societies. In: Symposium on Biomathematics and Ecology: Education and Research. ; 2014.' apa: 'Hamann, H., Karsai, I., Schmickl, T., & Hilbun, A. (2014). The common stomach: Organizing task allocation in wasp societies. In Symposium on Biomathematics and Ecology: Education and Research.' 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} }' 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.' 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.' 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.' date_created: 2020-10-15T13:56:46Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: 'Symposium on Biomathematics and Ecology: Education and Research' status: public title: 'The common stomach: Organizing task allocation in wasp societies' type: conference user_id: '15415' year: '2014' ... --- _id: '20008' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: 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' 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' 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.' 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.' 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.' short: 'H. Hamann, G. Valentini, in: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014), Cham, 2014.' date_created: 2020-10-15T14:13:51Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-09952-1_15 language: - iso: eng place: Cham publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014) publication_identifier: isbn: - '9783319099514' - '9783319099521' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins' type: conference user_id: '15415' year: '2014' ... --- _id: '20120' 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. author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Thomas full_name: Schmickl, Thomas last_name: Schmickl - first_name: Karl full_name: Crailsheim, Karl last_name: Crailsheim citation: 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 bibtex: '@article{Hamann_Schmickl_Crailsheim_2014, title={Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem}, volume={20}, DOI={10.1162/ARTL_a_00097}, number={1}, journal={Artificial Life}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2014}, pages={77–93} }' chicago: 'Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem.” Artificial Life 20, no. 1 (2014): 77–93. https://doi.org/10.1162/ARTL_a_00097.' 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. 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. short: H. Hamann, T. Schmickl, K. Crailsheim, Artificial Life 20 (2014) 77–93. date_created: 2020-10-19T08:41:18Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.1162/ARTL_a_00097 intvolume: ' 20' issue: '1' language: - iso: eng page: 77-93 publication: Artificial Life status: public title: Analysis of Swarm Behaviors Based on an Inversion of the Fluctuation Theorem type: journal_article user_id: '15415' volume: 20 year: '2014' ... --- _id: '20121' 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. author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: Alessio full_name: Lomuscio, Alessio last_name: Lomuscio - first_name: Paul full_name: Scerri, Paul last_name: Scerri - first_name: Ana full_name: Bazzan, Ana last_name: Bazzan - first_name: Michael full_name: Huhns, Michael last_name: Huhns 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).' 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} }' 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.' 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.' 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.' date_created: 2020-10-19T08:49:05Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014) status: public title: 'Self-Organized Collective Decision Making: The Weighted Voter Model' type: conference user_id: '15415' year: '2014' ... --- _id: '20126' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: 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} }' 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.' 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.' 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.' date_created: 2020-10-20T07:45:46Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.1145/2598394.2598507 language: - iso: eng page: 31-32 publication: Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014) status: public title: 'Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal' type: conference user_id: '15415' year: '2014' ... --- _id: '20127' author: - first_name: Mauro full_name: Birattari, Mauro last_name: Birattari - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Simon full_name: Garnier, Simon last_name: Garnier - first_name: Marco full_name: Montes de Oca, Marco last_name: Montes de Oca - first_name: Christine full_name: Solnon, Christine last_name: Solnon - first_name: Thomas full_name: Stuetzle, Thomas last_name: Stuetzle - first_name: Hongli full_name: Ding, Hongli last_name: Ding citation: ama: 'Birattari M, Dorigo M, Hamann H, et al. Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation. In: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Vol 8667. ; 2014:262-269. doi:10.1007/978-3-319-09952-1_25' apa: Birattari, M., Dorigo, M., Hamann, H., Garnier, S., Montes de Oca, M., Solnon, C., … Ding, H. (2014). Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014) (Vol. 8667, pp. 262–269). https://doi.org/10.1007/978-3-319-09952-1_25 bibtex: '@inproceedings{Birattari_Dorigo_Hamann_Garnier_Montes de Oca_Solnon_Stuetzle_Ding_2014, title={Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation}, volume={8667}, DOI={10.1007/978-3-319-09952-1_25}, booktitle={Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}, author={Birattari, Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca, Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}, year={2014}, pages={262–269} }' 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. 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. 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. 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.' date_created: 2020-10-20T07:54:18Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-09952-1_25 intvolume: ' 8667' language: - iso: eng page: 262-269 publication: Ninth Int. Conf. on Swarm Intelligence (ANTS 2014) status: public title: Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation type: conference user_id: '15415' volume: 8667 year: '2014' ... --- _id: '20128' author: - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini - first_name: T. full_name: Bartz-Beielstein, T. last_name: Bartz-Beielstein citation: 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' 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' 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.' 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.' 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.' 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.' date_created: 2020-10-20T08:26:59Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-10762-2_18 intvolume: ' 8672' language: - iso: eng page: 181-190 publication: 13th International Conference on Parallel Problem Solving from Nature (PPSN 2014) publisher: Springer status: public title: 'Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements' type: book_chapter user_id: '15415' volume: 8672 year: '2014' ... --- _id: '20129' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Hiroki full_name: Sayama, Hiroki last_name: Sayama - first_name: John full_name: Rieffel, John last_name: Rieffel - first_name: Sebastian full_name: Risi, Sebastian last_name: Risi - first_name: Rene full_name: Doursat, Rene last_name: Doursat - first_name: Hod full_name: Lipson, Hod last_name: Lipson citation: ama: 'Hamann H, Sayama H, Rieffel J, Risi S, Doursat R, Lipson H. Evolution of Collective Behaviors by Minimizing Surprise. In: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014). MIT Press; 2014:344-351. doi:10.7551/978-0-262-32621-6-ch055' apa: Hamann, H., Sayama, H., Rieffel, J., Risi, S., Doursat, R., & Lipson, H. (2014). Evolution of Collective Behaviors by Minimizing Surprise. In 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014) (pp. 344–351). MIT Press. https://doi.org/10.7551/978-0-262-32621-6-ch055 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} }' 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. 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. 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.' date_created: 2020-10-20T09:02:49Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.7551/978-0-262-32621-6-ch055 language: - iso: eng page: 344-351 publication: 14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014) publisher: MIT Press status: public title: Evolution of Collective Behaviors by Minimizing Surprise type: conference user_id: '15415' year: '2014' ... --- _id: '20130' author: - first_name: Enric full_name: Cervera, Enric last_name: Cervera - first_name: Yara full_name: Khaluf, Yara last_name: Khaluf - first_name: Mauro full_name: Birattari, Mauro last_name: Birattari - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Angel P. del full_name: Pobil, Angel P. del last_name: Pobil - first_name: Eris full_name: Chinellato, Eris last_name: Chinellato - first_name: Ester full_name: Martinez-Martin, Ester last_name: Martinez-Martin - first_name: John full_name: Hallam, John last_name: Hallam - first_name: Antonio full_name: Morales, Antonio last_name: Morales citation: 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' 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 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} }' 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. 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. 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. 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.' date_created: 2020-10-20T09:09:59Z date_updated: 2022-01-06T06:54:20Z department: - _id: '63' - _id: '238' doi: 10.1007/978-3-319-08864-8_26 intvolume: ' 8575' language: - iso: eng page: 270-279 publication: Simulation of Adaptive Behavior (SAB 2014) status: public title: A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs type: conference user_id: '15415' volume: 8575 year: '2014' ... --- _id: '368' abstract: - lang: eng 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. author: - first_name: Andre full_name: Brinkmann, Andre last_name: Brinkmann - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Lars full_name: Nagel, Lars last_name: Nagel - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: 'Tim ' full_name: 'Suess, Tim ' last_name: Suess citation: 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' 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 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} }' 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.' 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. 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.' date_created: 2017-10-17T12:42:03Z date_updated: 2022-01-06T06:59:30Z ddc: - '040' department: - _id: '63' doi: 10.1145/2612669.2612698 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:17:38Z date_updated: 2018-03-20T07:17:38Z file_id: '1403' file_name: 368-BKMNRS14.pdf file_size: 485767 relation: main_file success: 1 file_date_updated: 2018-03-20T07:17:38Z has_accepted_license: '1' language: - iso: eng page: 128-137 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '14' name: SFB 901 - Subproject C2 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: Scheduling Shared Continuous Resources on Many-Cores type: conference user_id: '15415' year: '2014' ... --- _id: '370' abstract: - lang: eng text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. ' author: - first_name: Tobias full_name: Harks, Tobias last_name: Harks - first_name: Martin full_name: Höfer, Martin last_name: Höfer - first_name: Kevin full_name: Schewior, Kevin last_name: Schewior - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: 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 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} }' chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571. ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360. 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. 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.' date_created: 2017-10-17T12:42:04Z date_updated: 2022-01-06T06:59:30Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1109/TNET.2015.2468571 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:17:04Z date_updated: 2018-03-20T07:17:04Z file_id: '1402' file_name: 370-HHSS14.pdf file_size: 179583 relation: main_file success: 1 file_date_updated: 2018-03-20T07:17:04Z has_accepted_license: '1' language: - iso: eng page: 352-360 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14) status: public title: Routing Games with Progressive Filling type: conference user_id: '477' year: '2014' ... --- _id: '373' author: - first_name: David full_name: Pahl, David last_name: Pahl citation: ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014. apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn. bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }' chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014. date_created: 2017-10-17T12:42:04Z date_updated: 2022-01-06T06:59:31Z department: - _id: '63' - _id: '541' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Reputationssysteme für zusammengesetzte Dienstleistungen type: bachelorsthesis user_id: '14052' year: '2014' ... --- _id: '379' 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. author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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 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. 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. mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3. short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.' date_created: 2017-10-17T12:42:06Z date_updated: 2022-01-06T06:59:36Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-12691-3_3 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:12:57Z date_updated: 2018-03-20T07:12:57Z file_id: '1395' file_name: 379-COCOA14.pdf file_size: 214299 relation: main_file success: 1 file_date_updated: 2018-03-20T07:12:57Z has_accepted_license: '1' page: 25-34 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA) series_title: LNCS status: public title: Randomized Online Algorithms for Set Cover Leasing Problems type: conference user_id: '15504' year: '2014' ... --- _id: '380' 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}' author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34' apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34 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} }' 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. 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. 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. 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.' date_created: 2017-10-17T12:42:06Z date_updated: 2022-01-06T06:59:36Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-13129-0_34 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:05:59Z date_updated: 2018-03-20T07:05:59Z file_id: '1394' file_name: 380-WINE2014.pdf file_size: 166640 relation: main_file success: 1 file_date_updated: 2018-03-20T07:05:59Z has_accepted_license: '1' page: 423-428 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 10th International Conference on Web and Internet Economics (WINE) status: public title: Quality of Service in Network Creation Games type: conference user_id: '15504' year: '2014' ... --- _id: '17659' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Stojan full_name: Trajanovski, Stojan last_name: Trajanovski - first_name: Mathijs M. full_name: de Weerdt, Mathijs M. last_name: de Weerdt citation: 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.' 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.' 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. 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. 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.' date_created: 2020-08-06T15:21:26Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - competition - equilibrium - market - models - shared effort games - simulation language: - iso: eng page: 861-868 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Nash Equilibria in Shared Effort Games type: conference user_id: '83983' year: '2014' ... --- _id: '17660' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs M. full_name: de Weerdt, Mathijs M. last_name: de Weerdt 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.' 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} }' 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.' 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. 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.' date_created: 2020-08-06T15:21:35Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - dynamics - emotion modeling - negotiation - network interaction - shared effort game language: - iso: eng page: 1741-1742 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Improving Human Interaction in Crowdsensing type: conference user_id: '83983' year: '2014' ... --- _id: '17661' author: - first_name: Thomas C. full_name: King, Thomas C. last_name: King - first_name: Qingzhi full_name: Liu, Qingzhi last_name: Liu - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs full_name: de Weerdt, Mathijs last_name: de Weerdt - first_name: Virginia full_name: Dignum, Virginia last_name: Dignum - first_name: M. Birna full_name: van Riemsdijk, M. Birna last_name: van Riemsdijk - first_name: Martijn full_name: Warnier, Martijn last_name: Warnier citation: 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.' 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.' 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} }' 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.' 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. 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. 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.' date_created: 2020-08-06T15:21:45Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - crowd-sensing - crowdsourcing - data aggregation - game theory - norms - reciprocation - self interested agents - simulation language: - iso: eng page: 1651-1652 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Request Driven Social Sensing type: conference user_id: '83983' year: '2014' ...