[{"doi":"10.1016/j.robot.2009.06.002","language":[{"iso":"eng"}],"intvolume":"         6","publication_status":"published","date_updated":"2022-01-06T06:54:25Z","author":[{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Wörn, Heinz","last_name":"Wörn","first_name":"Heinz"},{"first_name":"Karl","last_name":"Crailsheim","full_name":"Crailsheim, Karl"}],"publication_identifier":{"issn":["0921-8890"]},"year":"2009","title":"Two different approaches to a macroscopic model of a bio-inspired robotic swarm","department":[{"_id":"63"},{"_id":"238"}],"type":"journal_article","date_created":"2020-11-02T14:07:44Z","abstract":[{"lang":"eng","text":"By compiling macroscopic models we analyze the adaptive behavior in a swarm of autonomous robots generated by a bio-inspired, distributed control algorithm. We developed two macroscopic models by taking two different perspectives: A Stock & Flow model, which is simple to implement and fast to simulate, and a spatially resolved model based on diffusion processes. These two models were compared concerning their prediction quality and their analytical power: One model allowed easy identification of the major feedback loops governing the swarm behavior. The other model allowed analysis of the expected shapes and positions of observable robot clusters. We found a high correlation in the challenges posed by both modeling techniques and we highlighted the inherent problems of inferring emergent macroscopic rules from a microscopic description of swarm behavior."}],"publication":"Robotics and Autonomous Systems","issue":"9","volume":6,"user_id":"15415","_id":"20255","page":"913-921","status":"public","citation":{"apa":"Schmickl, T., Hamann, H., Wörn, H., &#38; Crailsheim, K. (2009). Two different approaches to a macroscopic model of a bio-inspired robotic swarm. <i>Robotics and Autonomous Systems</i>, <i>6</i>(9), 913–921. <a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">https://doi.org/10.1016/j.robot.2009.06.002</a>","ieee":"T. Schmickl, H. Hamann, H. Wörn, and K. Crailsheim, “Two different approaches to a macroscopic model of a bio-inspired robotic swarm,” <i>Robotics and Autonomous Systems</i>, vol. 6, no. 9, pp. 913–921, 2009.","short":"T. Schmickl, H. Hamann, H. Wörn, K. Crailsheim, Robotics and Autonomous Systems 6 (2009) 913–921.","chicago":"Schmickl, Thomas, Heiko Hamann, Heinz Wörn, and Karl Crailsheim. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” <i>Robotics and Autonomous Systems</i> 6, no. 9 (2009): 913–21. <a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">https://doi.org/10.1016/j.robot.2009.06.002</a>.","mla":"Schmickl, Thomas, et al. “Two Different Approaches to a Macroscopic Model of a Bio-Inspired Robotic Swarm.” <i>Robotics and Autonomous Systems</i>, vol. 6, no. 9, 2009, pp. 913–21, doi:<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>.","ama":"Schmickl T, Hamann H, Wörn H, Crailsheim K. Two different approaches to a macroscopic model of a bio-inspired robotic swarm. <i>Robotics and Autonomous Systems</i>. 2009;6(9):913-921. doi:<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>","bibtex":"@article{Schmickl_Hamann_Wörn_Crailsheim_2009, title={Two different approaches to a macroscopic model of a bio-inspired robotic swarm}, volume={6}, DOI={<a href=\"https://doi.org/10.1016/j.robot.2009.06.002\">10.1016/j.robot.2009.06.002</a>}, number={9}, journal={Robotics and Autonomous Systems}, author={Schmickl, Thomas and Hamann, Heiko and Wörn, Heinz and Crailsheim, Karl}, year={2009}, pages={913–921} }"}},{"author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"first_name":"Inge","last_name":"Troch","full_name":"Troch, Inge"},{"last_name":"Breitenecker","first_name":"F.","full_name":"Breitenecker, F."}],"year":"2009","status":"public","title":"Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System","date_updated":"2022-01-06T06:54:25Z","language":[{"iso":"eng"}],"_id":"20259","user_id":"15415","citation":{"mla":"Hamann, Heiko, et al. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009.","bibtex":"@inproceedings{Hamann_Troch_Breitenecker_2009, title={Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System}, booktitle={MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling}, author={Hamann, Heiko and Troch, Inge and Breitenecker, F.}, year={2009} }","ama":"Hamann H, Troch I, Breitenecker F. Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In: <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>. ; 2009.","ieee":"H. Hamann, I. Troch, and F. Breitenecker, “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System,” in <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009.","apa":"Hamann, H., Troch, I., &#38; Breitenecker, F. (2009). Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System. In <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>.","short":"H. Hamann, I. Troch, F. Breitenecker, in: MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling, 2009.","chicago":"Hamann, Heiko, Inge Troch, and F. Breitenecker. “Pattern Formation as a Transient Phenomenon in the Nonlinear Dynamics of a Multi-Agent System.” In <i>MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling</i>, 2009."},"publication":"MATHMOD 2009 - 6th Vienna International Conference on Mathematical Modelling","date_created":"2020-11-02T14:18:27Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference"},{"date_created":"2020-07-29T13:51:54Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Public Service Review: Science and Technology","citation":{"bibtex":"@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology}, author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }","ama":"Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>. 2009;04.","mla":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009.","chicago":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i> 04 (2009).","short":"F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and Technology 04 (2009).","ieee":"F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009.","apa":"Meyer auf der Heide, F., &#38; Rammig, F.-J. (2009). Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>, <i>04</i>."},"_id":"17453","language":[{"iso":"eng"}],"user_id":"15415","volume":"04","year":"2009","status":"public","title":"Self-Organisation and Self-Optimization","author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Rammig, Franz-Josef","last_name":"Rammig","first_name":"Franz-Josef"}],"date_updated":"2022-01-06T06:53:12Z","intvolume":"         4"},{"doi":"10.1524/itit.2009.0524","language":[{"iso":"eng"}],"intvolume":"        51","date_updated":"2022-01-06T06:53:57Z","publication_status":"published","publication_identifier":{"issn":["1611-2776"]},"author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"title":"Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)","year":"2009","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-09-04T12:05:57Z","issue":"1","publication":"it - Information Technology","volume":51,"user_id":"15415","_id":"19031","page":"62-65","status":"public","citation":{"bibtex":"@article{Briest_2009, title={Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)}, volume={51}, DOI={<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>}, number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009}, pages={62–65} }","ama":"Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). <i>it - Information Technology</i>. 2009;51(1):62-65. doi:<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>","mla":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” <i>It - Information Technology</i>, vol. 51, no. 1, 2009, pp. 62–65, doi:<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>.","short":"P. Briest, It - Information Technology 51 (2009) 62–65.","chicago":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” <i>It - Information Technology</i> 51, no. 1 (2009): 62–65. <a href=\"https://doi.org/10.1524/itit.2009.0524\">https://doi.org/10.1524/itit.2009.0524</a>.","ieee":"P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” <i>it - Information Technology</i>, vol. 51, no. 1, pp. 62–65, 2009.","apa":"Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). <i>It - Information Technology</i>, <i>51</i>(1), 62–65. <a href=\"https://doi.org/10.1524/itit.2009.0524\">https://doi.org/10.1524/itit.2009.0524</a>"}},{"date_updated":"2022-01-06T06:55:59Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"full_name":"Hoefer, Martin","last_name":"Hoefer","first_name":"Martin"},{"first_name":"Luciano","last_name":"Gualà","full_name":"Gualà, Luciano"},{"full_name":"Ventre, Carmine","first_name":"Carmine","last_name":"Ventre"}],"year":"2009","status":"public","title":"On Stackelberg Pricing with Computationally Bounded Consumers","doi":"10.1007/978-3-642-10841-9_6","user_id":"15415","_id":"23744","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.\r\n\r\nWe consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3."}],"citation":{"ieee":"P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2009.","apa":"Briest, P., Hoefer, M., Gualà, L., &#38; Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">https://doi.org/10.1007/978-3-642-10841-9_6</a>","short":"P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","chicago":"Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On Stackelberg Pricing with Computationally Bounded Consumers.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">https://doi.org/10.1007/978-3-642-10841-9_6</a>.","mla":"Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.” <i>Lecture Notes in Computer Science</i>, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>.","bibtex":"@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On Stackelberg Pricing with Computationally Bounded Consumers}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>}, booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer, Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }","ama":"Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally Bounded Consumers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-10841-9_6\">10.1007/978-3-642-10841-9_6</a>"},"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2021-09-03T10:55:38Z"},{"publication":"European Simulation and Modelling Conference (ESM 2009)","citation":{"bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model Verification and Validation during Simulation Runtime}, booktitle={European Simulation and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }","ama":"Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI; 2009.","mla":"Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” <i>European Simulation and Modelling Conference (ESM 2009)</i>, EUROSIS-ETI, 2009.","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","chicago":"Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts for Model Verification and Validation during Simulation Runtime.” In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI, 2009.","ieee":"C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in <i>European Simulation and Modelling Conference (ESM 2009)</i>, 2009.","apa":"Laroque, C., Fischer, M., &#38; Dangelmaier, W. (2009). Concepts for Model Verification and Validation during Simulation Runtime. In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI."},"abstract":[{"lang":"eng","text":"Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task."}],"date_created":"2020-08-24T07:28:23Z","type":"conference","department":[{"_id":"63"}],"title":"Concepts for Model Verification and Validation during Simulation Runtime","year":"2009","status":"public","author":[{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"date_updated":"2022-01-06T06:53:26Z","publisher":"EUROSIS-ETI","_id":"18138","language":[{"iso":"eng"}],"user_id":"15415"},{"page":"111--126","_id":"18291","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":252,"title":"Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen","year":"2009","status":"public","author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"last_name":"Huber","first_name":"Daniel","full_name":"Huber, Daniel"},{"full_name":"Laroque, Christoph ","first_name":"Christoph ","last_name":"Laroque"},{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"}],"date_updated":"2022-01-06T06:53:28Z","intvolume":"       252","date_created":"2020-08-25T14:25:41Z","type":"book_chapter","department":[{"_id":"63"},{"_id":"26"}],"publication":"Augmented & Virtual Reality in der Produktentstehung","citation":{"apa":"Suess, T., Fischer, M., Huber, D., Laroque, C., &#38; Dangelmaier, W. (2009). Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 252, pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","short":"T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","chicago":"Suess, Tim, Matthias Fischer, Daniel Huber, Christoph  Laroque, and Wilhelm Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 252:111--126. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","mla":"Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","ama":"Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 252. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009:111--126.","bibtex":"@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph  and Dangelmaier, Wilhelm}, year={2009}, pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"}},{"language":[{"iso":"eng"}],"_id":"18346","page":"203-206","user_id":"15415","author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Matthias","last_name":"Hilbig","full_name":"Hilbig, Matthias"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"year":"2009","status":"public","title":"Planar Visibility Counting","date_updated":"2022-01-06T06:53:29Z","date_created":"2020-08-26T08:49:50Z","department":[{"_id":"63"}],"type":"conference","citation":{"ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–206.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., &#38; Ziegler, M. (2009). Planar Visibility Counting. In <i>Proc. 25th European Workshop on Computational Geometry</i> (pp. 203–206).","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206.","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In <i>Proc. 25th European Workshop on Computational Geometry</i>, 203–6, 2009.","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–06.","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: <i>Proc. 25th European Workshop on Computational Geometry</i>. ; 2009:203-206."},"publication":"Proc. 25th European Workshop on Computational Geometry","abstract":[{"text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where k<n is an arbitrary parameter. We describe an\r\nimplementation of this approach and demonstrate the practical benefit of the\r\nparameter k to trade memory for query time in an empirical evaluation on three\r\nclasses of benchmark scenes.","lang":"eng"}]},{"date_created":"2020-04-06T13:52:18Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","citation":{"apa":"Kutyłowski, J., &#38; Meyer auf der Heide, F. (2009). Optimal strategies for maintaining a chain of relays between an explorer and a base camp. <i>Theoretical Computer Science</i>, 3391–3405. <a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">https://doi.org/10.1016/j.tcs.2008.04.010</a>","ieee":"J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining a chain of relays between an explorer and a base camp,” <i>Theoretical Computer Science</i>, pp. 3391–3405, 2009.","short":"J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009) 3391–3405.","chicago":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical Computer Science</i>, 2009, 3391–3405. <a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">https://doi.org/10.1016/j.tcs.2008.04.010</a>.","mla":"Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical Computer Science</i>, 2009, pp. 3391–405, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>.","ama":"Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain of relays between an explorer and a base camp. <i>Theoretical Computer Science</i>. 2009:3391-3405. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>","bibtex":"@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies for maintaining a chain of relays between an explorer and a base camp}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.04.010\">10.1016/j.tcs.2008.04.010</a>}, journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }"},"page":"3391-3405","_id":"16429","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1016/j.tcs.2008.04.010","status":"public","year":"2009","title":"Optimal strategies for maintaining a chain of relays between an explorer and a base camp","author":[{"full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski","first_name":"Jarosław"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","date_updated":"2022-01-06T06:52:50Z"},{"user_id":"15415","doi":"10.1145/1583991.1584072","_id":"16430","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Power-aware online file allocation in mobile ad hoc networks","status":"public","year":"2009","publication_identifier":{"isbn":["9781605586069"]},"author":[{"last_name":"Mehler","first_name":"Jan","full_name":"Mehler, Jan"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-06T13:53:57Z","publication":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09","citation":{"ieee":"J. Mehler and F. Meyer auf der Heide, “Power-aware online file allocation in mobile ad hoc networks,” in <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>, 2009.","apa":"Mehler, J., &#38; Meyer auf der Heide, F. (2009). Power-aware online file allocation in mobile ad hoc networks. In <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>. <a href=\"https://doi.org/10.1145/1583991.1584072\">https://doi.org/10.1145/1583991.1584072</a>","short":"J. Mehler, F. Meyer auf der Heide, in: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.","chicago":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” In <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>, 2009. <a href=\"https://doi.org/10.1145/1583991.1584072\">https://doi.org/10.1145/1583991.1584072</a>.","mla":"Mehler, Jan, and Friedhelm Meyer auf der Heide. “Power-Aware Online File Allocation in Mobile Ad Hoc Networks.” <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>, 2009, doi:<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>.","bibtex":"@inproceedings{Mehler_Meyer auf der Heide_2009, title={Power-aware online file allocation in mobile ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>}, booktitle={Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, author={Mehler, Jan and Meyer auf der Heide, Friedhelm}, year={2009} }","ama":"Mehler J, Meyer auf der Heide F. Power-aware online file allocation in mobile ad hoc networks. In: <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>. ; 2009. doi:<a href=\"https://doi.org/10.1145/1583991.1584072\">10.1145/1583991.1584072</a>"}},{"department":[{"_id":"63"}],"type":"conference_editor","date_created":"2020-04-06T13:55:23Z","citation":{"ieee":"F. Meyer auf der Heide and M. A. Bender, Eds., <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>. 2009.","apa":"Meyer auf der Heide, F., &#38; Bender, M. A. (Eds.). (2009). <i>Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09</i>. <a href=\"https://doi.org/10.1145/1583991\">https://doi.org/10.1145/1583991</a>","short":"F. Meyer auf der Heide, M.A. Bender, eds., Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09, 2009.","chicago":"Meyer auf der Heide, Friedhelm, and Michael A. Bender, eds. <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>, 2009. <a href=\"https://doi.org/10.1145/1583991\">https://doi.org/10.1145/1583991</a>.","mla":"Meyer auf der Heide, Friedhelm, and Michael A. Bender, editors. <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>. 2009, doi:<a href=\"https://doi.org/10.1145/1583991\">10.1145/1583991</a>.","bibtex":"@book{Meyer auf der Heide_Bender_2009, title={Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA ’09}, DOI={<a href=\"https://doi.org/10.1145/1583991\">10.1145/1583991</a>}, year={2009} }","ama":"Meyer auf der Heide F, Bender MA, eds. <i>Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures - SPAA ’09</i>.; 2009. doi:<a href=\"https://doi.org/10.1145/1583991\">10.1145/1583991</a>"},"editor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Bender, Michael A.","last_name":"Bender","first_name":"Michael A."}],"user_id":"15415","doi":"10.1145/1583991","language":[{"iso":"eng"}],"_id":"16431","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","publication_identifier":{"isbn":["9781605586069"]},"year":"2009","title":"Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures - SPAA '09","status":"public"},{"status":"public","year":"2009","title":"Optimal algorithms for page migration in dynamic networks","publication_identifier":{"issn":["1570-8667"]},"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"full_name":"Byrka, Jaroslaw","last_name":"Byrka","first_name":"Jaroslaw"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","page":"545-569","language":[{"iso":"eng"}],"_id":"16398","user_id":"15415","doi":"10.1016/j.jda.2008.07.006","publication":"Journal of Discrete Algorithms","citation":{"mla":"Bienkowski, Marcin, et al. “Optimal Algorithms for Page Migration in Dynamic Networks.” <i>Journal of Discrete Algorithms</i>, 2009, pp. 545–69, doi:<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>.","ama":"Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F. Optimal algorithms for page migration in dynamic networks. <i>Journal of Discrete Algorithms</i>. 2009:545-569. doi:<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>","bibtex":"@article{Bienkowski_Byrka_Korzeniowski_Meyer auf der Heide_2009, title={Optimal algorithms for page migration in dynamic networks}, DOI={<a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">10.1016/j.jda.2008.07.006</a>}, journal={Journal of Discrete Algorithms}, author={Bienkowski, Marcin and Byrka, Jaroslaw and Korzeniowski, Miroslaw and Meyer auf der Heide, Friedhelm}, year={2009}, pages={545–569} }","apa":"Bienkowski, M., Byrka, J., Korzeniowski, M., &#38; Meyer auf der Heide, F. (2009). Optimal algorithms for page migration in dynamic networks. <i>Journal of Discrete Algorithms</i>, 545–569. <a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">https://doi.org/10.1016/j.jda.2008.07.006</a>","ieee":"M. Bienkowski, J. Byrka, M. Korzeniowski, and F. Meyer auf der Heide, “Optimal algorithms for page migration in dynamic networks,” <i>Journal of Discrete Algorithms</i>, pp. 545–569, 2009.","chicago":"Bienkowski, Marcin, Jaroslaw Byrka, Miroslaw Korzeniowski, and Friedhelm Meyer auf der Heide. “Optimal Algorithms for Page Migration in Dynamic Networks.” <i>Journal of Discrete Algorithms</i>, 2009, 545–69. <a href=\"https://doi.org/10.1016/j.jda.2008.07.006\">https://doi.org/10.1016/j.jda.2008.07.006</a>.","short":"M. Bienkowski, J. Byrka, M. Korzeniowski, F. Meyer auf der Heide, Journal of Discrete Algorithms (2009) 545–569."},"date_created":"2020-04-03T10:40:45Z","type":"journal_article","department":[{"_id":"63"}]},{"_id":"19615","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":259,"title":"Distributed Resource Allocation and Management in Heterogeneous Networks","year":"2008","status":"public","publication_identifier":{"isbn":["978-3-939350-78-1"]},"author":[{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"       259","date_created":"2020-09-22T08:10:41Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"chicago":"Schomaker, Gunnar. <i>Distributed Resource Allocation and Management in Heterogeneous Networks</i>. Vol. 259. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","short":"G. Schomaker, Distributed Resource Allocation and Management in Heterogeneous Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","apa":"Schomaker, G. (2008). <i>Distributed Resource Allocation and Management in Heterogeneous Networks</i> (Vol. 259). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"G. Schomaker, <i>Distributed Resource Allocation and Management in Heterogeneous Networks</i>, vol. 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","ama":"Schomaker G. <i>Distributed Resource Allocation and Management in Heterogeneous Networks</i>. Vol 259. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008.","bibtex":"@book{Schomaker_2008, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Distributed Resource Allocation and Management in Heterogeneous Networks}, volume={259}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schomaker, Gunnar}, year={2008}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Schomaker, Gunnar. <i>Distributed Resource Allocation and Management in Heterogeneous Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008."},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090114013"}]}},{"publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","citation":{"chicago":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008. <a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">https://doi.org/10.1007/978-3-540-70575-8_66</a>.","short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","ieee":"P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008.","apa":"Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>. <a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">https://doi.org/10.1007/978-3-540-70575-8_66</a>","bibtex":"@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>}, booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }","ama":"Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>. ; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>","mla":"Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-70575-8_66\">10.1007/978-3-540-70575-8_66</a>."},"date_created":"2020-09-25T09:45:40Z","type":"conference","department":[{"_id":"63"}],"title":"Uniform Budgets and the Envy-Free Pricing Problem","status":"public","year":"2008","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540705741","9783540705758"]},"author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"date_updated":"2022-01-06T06:54:10Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"19686","doi":"10.1007/978-3-540-70575-8_66","user_id":"15415"},{"citation":{"apa":"Briest, P., Krysta, P., &#38; Babaioff, M. (2008). On the Approximability of Combinatorial Exchange Problems. In <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-540-79309-0_9\">https://doi.org/10.1007/978-3-540-79309-0_9</a>","ieee":"P. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial Exchange Problems,” in <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>, 2008.","short":"P. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.","chicago":"Briest, Patrick, Piotr Krysta, and Moshe Babaioff. “On the Approximability of Combinatorial Exchange Problems.” In <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>. Cham, 2008. <a href=\"https://doi.org/10.1007/978-3-540-79309-0_9\">https://doi.org/10.1007/978-3-540-79309-0_9</a>.","mla":"Briest, Patrick, et al. “On the Approximability of Combinatorial Exchange Problems.” <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-79309-0_9\">https://doi.org/10.1007/978-3-540-79309-0_9</a>.","ama":"Briest P, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange Problems. In: <i>Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)</i>. Cham; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-79309-0_9\">https://doi.org/10.1007/978-3-540-79309-0_9</a>","bibtex":"@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the Approximability of Combinatorial Exchange Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-79309-0_9\">https://doi.org/10.1007/978-3-540-79309-0_9</a>}, booktitle={Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)}, author={Briest, Patrick and Krysta, Piotr and Babaioff, Moshe}, year={2008} }"},"publication":"Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)","department":[{"_id":"63"}],"type":"conference","place":"Cham","date_created":"2020-09-25T09:49:43Z","date_updated":"2022-01-06T06:54:10Z","publication_status":"published","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"first_name":"Piotr","last_name":"Krysta","full_name":"Krysta, Piotr"},{"last_name":"Babaioff","first_name":"Moshe","full_name":"Babaioff, Moshe"}],"status":"public","title":"On the Approximability of Combinatorial Exchange Problems","year":"2008","doi":"https://doi.org/10.1007/978-3-540-79309-0_9","user_id":"15415","_id":"19687","language":[{"iso":"eng"}]},{"type":"report","department":[{"_id":"63"}],"external_id":{"arxiv":["0804.4524 "]},"date_created":"2020-09-25T09:52:57Z","abstract":[{"lang":"eng","text":"We study the problem of computing approximate Nash equilibria (epsilon-Nash\r\nequilibria) in normal form games, where the number of players is a small\r\nconstant. We consider the approach of looking for solutions with constant\r\nsupport size. It is known from recent work that in the 2-player case, a\r\n1/2-Nash equilibrium can be easily found, but in general one cannot achieve a\r\nsmaller value of epsilon than 1/2. In this paper we extend those results to the\r\nk-player case, and find that epsilon = 1-1/k is feasible, but cannot be\r\nimproved upon. We show how stronger results for the 2-player case may be used\r\nin order to slightly improve upon the epsilon = 1-1/k obtained in the k-player\r\ncase."}],"citation":{"ama":"Briest P, Goldberg PW, Roeglin H. <i>Approximate Equilibria in Games with Few Players</i>.; 2008.","short":"P. Briest, P.W. Goldberg, H. Roeglin, Approximate Equilibria in Games with Few Players, 2008.","chicago":"Briest, Patrick, Paul W. Goldberg, and Heiko Roeglin. <i>Approximate Equilibria in Games with Few Players</i>, 2008.","bibtex":"@book{Briest_Goldberg_Roeglin_2008, title={Approximate Equilibria in Games with Few Players}, author={Briest, Patrick and Goldberg, Paul W. and Roeglin, Heiko}, year={2008} }","apa":"Briest, P., Goldberg, P. W., &#38; Roeglin, H. (2008). <i>Approximate Equilibria in Games with Few Players</i>.","mla":"Briest, Patrick, et al. <i>Approximate Equilibria in Games with Few Players</i>. 2008.","ieee":"P. Briest, P. W. Goldberg, and H. Roeglin, <i>Approximate Equilibria in Games with Few Players</i>. 2008."},"user_id":"15415","language":[{"iso":"eng"}],"_id":"19688","date_updated":"2022-01-06T06:54:10Z","title":"Approximate Equilibria in Games with Few Players","status":"public","year":"2008","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"full_name":"Goldberg, Paul W.","last_name":"Goldberg","first_name":"Paul W."},{"full_name":"Roeglin, Heiko","last_name":"Roeglin","first_name":"Heiko"}]},{"date_created":"2020-09-30T13:24:15Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}],"publication":"The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop","issue":"222","citation":{"mla":"Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” <i>The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>, no. 222, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.","ama":"Schindelhauer C, Mahlmann P. Random Graphs for Peer-to-Peer Overlays. In: <i>The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:1-22.","bibtex":"@inproceedings{Schindelhauer_Mahlmann_2008, title={Random Graphs for Peer-to-Peer Overlays}, number={222}, booktitle={The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schindelhauer, Christian and Mahlmann, Peter}, year={2008}, pages={1–22} }","apa":"Schindelhauer, C., &#38; Mahlmann, P. (2008). Random Graphs for Peer-to-Peer Overlays. <i>The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>, <i>222</i>, 1–22.","ieee":"C. Schindelhauer and P. Mahlmann, “Random Graphs for Peer-to-Peer Overlays,” in <i>The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>, 2008, no. 222, pp. 1–22.","short":"C. Schindelhauer, P. Mahlmann, in: The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 1–22.","chicago":"Schindelhauer, Christian, and Peter Mahlmann. “Random Graphs for Peer-to-Peer Overlays.” In <i>The European Integrated Project \"Dynamically Evolving, Large Scale Information Systems (DELIS), Proceedings of the Final Workshop</i>, 1–22. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008."},"abstract":[{"lang":"eng","text":"Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, resource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algorithms such that the overlay network can be a connected random graph or use a random graph as backbone. Random graphs are expander graphs have logarithmic diameter, high node connectivity, excellent communication properties, and are expander graphs with high probability. In summary: they are an excellent choice to improve the stability and robustness of a dynamic network."}],"page":"1-22","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19812","language":[{"iso":"eng"}],"user_id":"5786","status":"public","year":"2008","title":"Random Graphs for Peer-to-Peer Overlays","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"}],"date_updated":"2022-01-06T06:54:13Z"},{"date_created":"2020-09-30T13:27:54Z","type":"conference","department":[{"_id":"63"}],"publication":"MWCN'08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)","citation":{"bibtex":"@inproceedings{Ooi_Schindelhauer_2008, title={Detours Save Energy in Mobile Wireless Networks}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-84839-6_6\">10.1007/978-0-387-84839-6_6</a>}, booktitle={MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)}, publisher={Springer}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }","ama":"Ooi CC, Schindelhauer C. Detours Save Energy in Mobile Wireless Networks. In: <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>. Springer; 2008. doi:<a href=\"https://doi.org/10.1007/978-0-387-84839-6_6\">10.1007/978-0-387-84839-6_6</a>","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile Wireless Networks.” <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>, Springer, 2008, doi:<a href=\"https://doi.org/10.1007/978-0-387-84839-6_6\">10.1007/978-0-387-84839-6_6</a>.","short":"C.C. Ooi, C. Schindelhauer, in: MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008), Springer, 2008.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Detours Save Energy in Mobile Wireless Networks.” In <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>. Springer, 2008. <a href=\"https://doi.org/10.1007/978-0-387-84839-6_6\">https://doi.org/10.1007/978-0-387-84839-6_6</a>.","ieee":"C. C. Ooi and C. Schindelhauer, “Detours Save Energy in Mobile Wireless Networks,” in <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>, 2008.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2008). Detours Save Energy in Mobile Wireless Networks. In <i>MWCN’08: Proc. of IFIP Joint Conference on Mobile Wireless Communications Networks (MWCN 2008) and Personal Wireless Communications (PWC 2008)</i>. Springer. <a href=\"https://doi.org/10.1007/978-0-387-84839-6_6\">https://doi.org/10.1007/978-0-387-84839-6_6</a>"},"abstract":[{"lang":"eng","text":"Autonomous robotic systems have been gaining the attention of research community in mobile ad hoc network since the past few years. While motion cost and communications cost constitute the primary energy consumers, each of them is investigated independently. By taking into account the power consumption of both entities, the overall energy efficiency of a system can be further improved. In this paper, the energy optimization problem of radio communication and motion is examined. We consider a hybrid wireless  network that consists of a single autonomous mobile node and multiple relay nodes. The mobile node interacts with the relays within its vicinity by continuously communicating high-bandwidth data, e.g. triggered by a multimedia application like video surveillance. The goal is to find the best path such that the energy consumption for both mobility and communications is minimized. We introduce the Radio-Energy-Aware (REA) path computation strategy by utilizing node mobility. Given the starting point, the target point and the position of the relays, our simulation results show that the proposed strategy improves the energy efficiency of mobile node compared to the Motion-Energy-Aware (MEA) path constructed based only on the mobility cost. "}],"publisher":"Springer","_id":"19813","language":[{"iso":"eng"}],"doi":"10.1007/978-0-387-84839-6_6","user_id":"15415","status":"public","year":"2008","title":"Detours Save Energy in Mobile Wireless Networks","publication_identifier":{"isbn":["9780387848389","9780387848396"],"issn":["1571-5736"]},"author":[{"last_name":"Ooi","first_name":"Chia Ching","full_name":"Ooi, Chia Ching"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:54:13Z","publication_status":"published"},{"author":[{"first_name":"Chia Ching","last_name":"Ooi","full_name":"Ooi, Chia Ching"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"isbn":["9783642006432","9783642006449"]},"year":"2008","title":"Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots","status":"public","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","_id":"19832","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-00644-9_4","user_id":"15415","citation":{"bibtex":"@inproceedings{Ooi_Schindelhauer_2008, title={Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-00644-9_4\">10.1007/978-3-642-00644-9_4</a>}, booktitle={ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2008} }","short":"C.C. Ooi, C. Schindelhauer, in: ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008), 2008.","ama":"Ooi CC, Schindelhauer C. Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots. In: <i>ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>. ; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-642-00644-9_4\">10.1007/978-3-642-00644-9_4</a>","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots.” In <i>ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008. <a href=\"https://doi.org/10.1007/978-3-642-00644-9_4\">https://doi.org/10.1007/978-3-642-00644-9_4</a>.","ieee":"C. C. Ooi and C. Schindelhauer, “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots,” in <i>ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2008). Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots. In <i>ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>. <a href=\"https://doi.org/10.1007/978-3-642-00644-9_4\">https://doi.org/10.1007/978-3-642-00644-9_4</a>","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Energy-Efficient Distributed Target Tracking Using Wireless Relay Robots.” <i>ARS’08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-642-00644-9_4\">10.1007/978-3-642-00644-9_4</a>."},"publication":"ARS'08: Proc. of the 9th International Symposium on Distributed Autonomous Robotic Systems (DARS 2008)","date_created":"2020-10-01T10:14:06Z","department":[{"_id":"63"}],"type":"conference"},{"ddc":["000"],"user_id":"15415","language":[{"iso":"eng"}],"_id":"19950","date_updated":"2022-01-06T06:54:16Z","has_accepted_license":"1","status":"public","title":"Lokale Strategien zur Optimierung von Kommunikationsketten","year":"2008","author":[{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"type":"mastersthesis","department":[{"_id":"63"}],"file":[{"date_created":"2020-10-07T14:22:49Z","creator":"koala","content_type":"application/pdf","success":1,"file_id":"19951","date_updated":"2020-10-07T14:22:49Z","relation":"main_file","access_level":"closed","file_size":638802,"file_name":"pub-hni-3364.pdf"}],"date_created":"2020-10-07T14:23:26Z","file_date_updated":"2020-10-07T14:22:49Z","citation":{"mla":"Pietrzyk, Peter. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>. 2008.","ama":"Pietrzyk P. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>.; 2008.","bibtex":"@book{Pietrzyk_2008, title={Lokale Strategien zur Optimierung von Kommunikationsketten}, author={Pietrzyk, Peter}, year={2008} }","apa":"Pietrzyk, P. (2008). <i>Lokale Strategien zur Optimierung von Kommunikationsketten</i>.","ieee":"P. Pietrzyk, <i>Lokale Strategien zur Optimierung von Kommunikationsketten</i>. 2008.","short":"P. Pietrzyk, Lokale Strategien Zur Optimierung von Kommunikationsketten, 2008.","chicago":"Pietrzyk, Peter. <i>Lokale Strategien Zur Optimierung von Kommunikationsketten</i>, 2008."}}]