[{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"file_date_updated":"2018-08-15T07:30:50Z","citation":{"ieee":"M. Feldotto, C.-J. Haake, A. Skopalik, and N. Stroh-Maraun, “Disaggregating User Evaluations Using the Shapley Value,” in <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, Irvine, California, USA, 2018, pp. 5:1-5:6.","mla":"Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 2018, pp. 5:1-5:6, doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>.","apa":"Feldotto, M., Haake, C.-J., Skopalik, A., &#38; Stroh-Maraun, N. (2018). Disaggregating User Evaluations Using the Shapley Value. In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i> (pp. 5:1-5:6). Irvine, California, USA. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>","bibtex":"@inproceedings{Feldotto_Haake_Skopalik_Stroh-Maraun_2018, title={Disaggregating User Evaluations Using the Shapley Value}, DOI={<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>}, booktitle={Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}, author={Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}, year={2018}, pages={5:1-5:6} }","chicago":"Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>, 5:1-5:6, 2018. <a href=\"https://doi.org/10.1145/3230654.3230659\">https://doi.org/10.1145/3230654.3230659</a>.","ama":"Feldotto M, Haake C-J, Skopalik A, Stroh-Maraun N. Disaggregating User Evaluations Using the Shapley Value. In: <i>Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)</i>. ; 2018:5:1-5:6. doi:<a href=\"https://doi.org/10.1145/3230654.3230659\">10.1145/3230654.3230659</a>","short":"M. Feldotto, C.-J. Haake, A. Skopalik, N. Stroh-Maraun, in: Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6."},"user_id":"14052","ddc":["040"],"page":"5:1-5:6","_id":"2831","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-06-18","location":"Irvine, California, USA","start_date":"2018-06-18","name":"The 13th Workshop on the Economics of Networks, Systems and Computation (NetEcon 2018)"},"type":"conference","department":[{"_id":"541"},{"_id":"63"},{"_id":"205"},{"_id":"475"}],"file":[{"date_created":"2018-08-15T07:30:50Z","creator":"nmaraun","file_id":"3910","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-08-15T07:30:50Z","file_name":"Disaggregating User Evaluations Using the Shapley Value.pdf","access_level":"closed","file_size":1450171}],"date_created":"2018-05-22T10:28:51Z","abstract":[{"text":"We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.","lang":"eng"}],"publication":"Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)","doi":"10.1145/3230654.3230659","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:58:01Z","title":"Disaggregating User Evaluations Using the Shapley Value","year":"2018","publication_identifier":{"isbn":["978-1-4503-5916-0"]},"author":[{"full_name":"Feldotto, Matthias","first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"},{"id":"13264","full_name":"Stroh-Maraun, Nadja","first_name":"Nadja","last_name":"Stroh-Maraun"}]},{"intvolume":"        80","date_updated":"2022-01-06T06:58:06Z","author":[{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"id":"37612","full_name":"Markarian, Christine","first_name":"Christine","last_name":"Markarian"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"2018","title":"Towards Flexible Demands in Online Leasing Problems. ","doi":"10.1007/s00453-018-0420-y","language":[{"iso":"eng"}],"issue":"5","publication":"Algorithmica","department":[{"_id":"63"}],"type":"journal_article","date_created":"2018-05-24T08:32:38Z","file":[{"access_level":"closed","file_size":600583,"file_name":"TowardsFlexibleDemandsInOnline.pdf","date_updated":"2018-11-02T15:18:16Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5298","creator":"ups","date_created":"2018-11-02T15:18:16Z"}],"has_accepted_license":"1","status":"public","volume":80,"ddc":["000"],"user_id":"477","publisher":"Springer","_id":"2848","page":"1556–1574","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"citation":{"chicago":"Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i> 80, no. 5 (2018): 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.","ieee":"S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574, 2018.","apa":"Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574. <a href=\"https://doi.org/10.1007/s00453-018-0420-y\">https://doi.org/10.1007/s00453-018-0420-y</a>","bibtex":"@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible Demands in Online Leasing Problems. }, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>}, number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574} }","ama":"Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online Leasing Problems. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>","mla":"Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href=\"https://doi.org/10.1007/s00453-018-0420-y\">10.1007/s00453-018-0420-y</a>."},"file_date_updated":"2018-11-02T15:18:16Z"},{"publication":"Theory of Computing Systems","date_created":"2018-05-24T08:39:15Z","file":[{"date_created":"2018-11-02T15:24:32Z","creator":"ups","content_type":"application/pdf","success":1,"file_id":"5301","access_level":"closed","file_size":1371624,"file_name":"ApproximationAndHeuristicAlgor.pdf","date_updated":"2018-11-02T15:24:32Z","relation":"main_file"}],"department":[{"_id":"63"}],"type":"journal_article","author":[{"first_name":"Faisal N. ","last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N. "},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Schubert, Michael","first_name":"Michael","last_name":"Schubert"}],"publication_identifier":{"unknown":["1432-4350"]},"year":"2018","title":"Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks","date_updated":"2022-01-06T06:58:06Z","language":[{"iso":"eng"}],"doi":"10.1007/s00224-017-9836-z","citation":{"ieee":"F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,” <i>Theory of Computing Systems</i>, 2018.","mla":"Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>.","apa":"Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>","bibtex":"@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>}, journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam, Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2018} }","short":"F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory of Computing Systems (2018).","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. <i>Theory of Computing Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00224-017-9836-z\">10.1007/s00224-017-9836-z</a>","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.” <i>Theory of Computing Systems</i>, 2018. <a href=\"https://doi.org/10.1007/s00224-017-9836-z\">https://doi.org/10.1007/s00224-017-9836-z</a>."},"file_date_updated":"2018-11-02T15:24:32Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","has_accepted_license":"1","_id":"2849","publisher":"Springer","ddc":["000"],"user_id":"477"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:58:07Z","author":[{"last_name":"Hamann","first_name":"Heiko","full_name":"Hamann, Heiko"},{"full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine","id":"37612"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Wahby, Mostafa","first_name":"Mostafa","last_name":"Wahby"}],"status":"public","title":"Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets","year":"2018","user_id":"15415","doi":"10.4230/LIPIcs.FUN.2018.22","ddc":["000"],"language":[{"iso":"eng"}],"_id":"2850","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"chicago":"Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.","short":"H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International Conference on Fun with Algorithms (FUN), 2018.","apa":"Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018). Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. <a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>","ieee":"H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018.","ama":"Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets. In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>","bibtex":"@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>}, booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}, year={2018} }","mla":"Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference on Fun with Algorithms (FUN)</i>, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FUN.2018.22\">10.4230/LIPIcs.FUN.2018.22</a>."},"file_date_updated":"2018-11-13T13:15:19Z","publication":"Ninth International Conference on Fun with Algorithms (FUN)","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","date_created":"2018-05-24T08:41:48Z","file":[{"date_created":"2018-11-13T13:15:19Z","creator":"feldi","content_type":"application/pdf","success":1,"file_id":"5536","date_updated":"2018-11-13T13:15:19Z","relation":"main_file","file_size":554298,"access_level":"closed","file_name":"LIPIcs-FUN-2018-22.pdf"}]},{"doi":"10.1007/978-3-319-94667-2_18","user_id":"15415","_id":"24396","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:19Z","publication_status":"published","author":[{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","year":"2018","title":"An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest","department":[{"_id":"63"}],"type":"conference","place":"Cham","date_created":"2021-09-14T12:23:29Z","abstract":[{"text":"We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \\(G=(V, E)\\) with \\(|V| = n\\) and node-weight function \\(w: V \\rightarrow \\mathcal {R}^+\\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \\(\\{s, t\\}\\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \\(\\mathcal {O}(\\log ^4 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \\(\\mathcal {O}(\\log n \\log k)\\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \\(\\varOmega (\\log ^2 n)\\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \\(\\mathcal {O}(\\log ^3 n)\\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \\(\\mathcal {O}(\\log n \\log ^2 k)\\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Markarian_2018, place={Cham}, title={An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>}, booktitle={International Workshop on Combinatorial Algorithms (IWOCA)}, author={Markarian, Christine}, year={2018} }","chicago":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” In <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>.","short":"C. Markarian, in: International Workshop on Combinatorial Algorithms (IWOCA), Cham, 2018.","ama":"Markarian C. An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. In: <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>","ieee":"C. Markarian, “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest,” 2018, doi: <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","mla":"Markarian, Christine. “An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.” <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">10.1007/978-3-319-94667-2_18</a>.","apa":"Markarian, C. (2018). An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest. <i>International Workshop on Combinatorial Algorithms (IWOCA)</i>. <a href=\"https://doi.org/10.1007/978-3-319-94667-2_18\">https://doi.org/10.1007/978-3-319-94667-2_18</a>"},"publication":"International Workshop on Combinatorial Algorithms (IWOCA)"},{"doi":"10.1007/s10878-018-0325-3","language":[{"iso":"eng"}],"intvolume":"        36","date_updated":"2022-01-06T06:59:24Z","author":[{"first_name":"Jürgen","last_name":"König","full_name":"König, Jürgen","id":"22358"},{"id":"13536","last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"}],"year":"2018","title":"Scheduling with interjob communication on parallel processors","department":[{"_id":"63"}],"type":"journal_article","date_created":"2018-07-13T09:57:48Z","file":[{"file_id":"5299","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:20:24Z","file_name":"SchedulingWithInterjobCommunic.pdf","access_level":"closed","file_size":745708,"date_created":"2018-11-02T15:20:24Z","creator":"ups"}],"publication":"Journal of Combinatorial Optimization","issue":"4","volume":36,"ddc":["000"],"user_id":"477","_id":"3551","page":"1356-1379","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79, doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>.","bibtex":"@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling with interjob communication on parallel processors}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>}, number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2018}, pages={1356–1379} }","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1356-1379. doi:<a href=\"https://doi.org/10.1007/s10878-018-0325-3\">10.1007/s10878-018-0325-3</a>","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with interjob communication on parallel processors,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018). Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1356–1379. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2018) 1356–1379.","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href=\"https://doi.org/10.1007/s10878-018-0325-3\">https://doi.org/10.1007/s10878-018-0325-3</a>."},"file_date_updated":"2018-11-02T15:20:24Z"},{"date_created":"2018-08-08T11:56:37Z","department":[{"_id":"541"},{"_id":"63"}],"type":"bachelorsthesis","citation":{"chicago":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","short":"S. Koop, Congestion Games mit gewichteten Strategien, Universität Paderborn, 2018.","apa":"Koop, S. (2018). <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn.","ieee":"S. Koop, <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018.","ama":"Koop S. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn; 2018.","bibtex":"@book{Koop_2018, title={Congestion Games mit gewichteten Strategien}, publisher={Universität Paderborn}, author={Koop, Samuel}, year={2018} }","mla":"Koop, Samuel. <i>Congestion Games mit gewichteten Strategien</i>. Universität Paderborn, 2018."},"supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"3851","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"14052","author":[{"last_name":"Koop","first_name":"Samuel","full_name":"Koop, Samuel"}],"status":"public","title":"Congestion Games mit gewichteten Strategien","year":"2018","date_updated":"2022-01-06T06:59:45Z"},{"status":"public","page":"217-232","_id":"17651","publisher":"Springer International Publishing","user_id":"83983","editor":[{"full_name":"Kim, Donghyun","first_name":"Donghyun","last_name":"Kim"},{"full_name":"Uma, R. N.","first_name":"R. N.","last_name":"Uma"},{"last_name":"Zelikovsky","first_name":"Alexander","full_name":"Zelikovsky, Alexander"}],"citation":{"mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. <i>Combinatorial Optimization and Applications</i>. Cham: Springer International Publishing; 2018:217-232.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in <i>Combinatorial Optimization and Applications</i>, 2018, pp. 217–232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &#38; A. Zelikovsky (Eds.), <i>Combinatorial Optimization and Applications</i> (pp. 217–232). Cham: Springer International Publishing.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232."},"place":"Cham","title":"Removing Undesirable Flows by Edge Deletion","year":"2018","author":[{"id":"83983","first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb"},{"last_name":"Trajanovski","first_name":"Stojan","full_name":"Trajanovski, Stojan"},{"first_name":"Paola","last_name":"Grosso","full_name":"Grosso, Paola"},{"last_name":"de Laat","first_name":"Cees","full_name":"de Laat, Cees"}],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"publication":"Combinatorial Optimization and Applications","abstract":[{"lang":"eng","text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming."}],"extern":"1","date_created":"2020-08-06T15:19:36Z","type":"conference","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"department":[{"_id":"63"},{"_id":"541"}]},{"citation":{"mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018, doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &#38; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>","ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” <i>Future Generation Computer Systems</i>, 2018.","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>","short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }"},"publication":"Future Generation Computer Systems","extern":"1","abstract":[{"text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions.","lang":"eng"}],"date_created":"2020-08-06T15:23:11Z","department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article","keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"publication_identifier":{"issn":["0167-739X"]},"author":[{"last_name":"Koning","first_name":"R.","full_name":"Koning, R."},{"last_name":"de Graaff","first_name":"B.","full_name":"de Graaff, B."},{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"R.","last_name":"Meijer","full_name":"Meijer, R."},{"first_name":"C.","last_name":"de Laat","full_name":"de Laat, C."},{"first_name":"P.","last_name":"Grosso","full_name":"Grosso, P."}],"title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","status":"public","year":"2018","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"_id":"17666","user_id":"83983","doi":"https://doi.org/10.1016/j.future.2018.08.011"},{"issue":"1","publication":"Journal of Scheduling","type":"journal_article","department":[{"_id":"63"}],"file":[{"date_created":"2018-03-21T13:16:59Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1577","file_size":466808,"access_level":"closed","file_name":"63-main_05.pdf","date_updated":"2018-03-21T13:16:59Z","relation":"main_file"}],"date_created":"2017-10-17T12:41:03Z","date_updated":"2022-01-06T07:03:00Z","intvolume":"        21","year":"2018","title":"Scheduling Shared Continuous Resources on Many-Cores","author":[{"last_name":"Althaus","first_name":"Ernst","full_name":"Althaus, Ernst"},{"full_name":"Brinkmann, Andre","last_name":"Brinkmann","first_name":"Andre"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Lars","last_name":"Nagel","full_name":"Nagel, Lars"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"},{"first_name":"Jiri","last_name":"Sgall","full_name":"Sgall, Jiri"},{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"}],"doi":"10.1007/s10951-017-0518-0","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-21T13:16:59Z","citation":{"mla":"Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i>, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","bibtex":"@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018, title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>}, number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018}, pages={77–92} }","ama":"Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>. 2018;21(1):77-92. doi:<a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>","ieee":"E. Althaus <i>et al.</i>, “Scheduling Shared Continuous Resources on Many-Cores,” <i>Journal of Scheduling</i>, vol. 21, no. 1, pp. 77–92, 2018, doi: <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">10.1007/s10951-017-0518-0</a>.","apa":"Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., Sgall, J., &#38; Suess, T. (2018). Scheduling Shared Continuous Resources on Many-Cores. <i>Journal of Scheduling</i>, <i>21</i>(1), 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>","chicago":"Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i> 21, no. 1 (2018): 77–92. <a href=\"https://doi.org/10.1007/s10951-017-0518-0\">https://doi.org/10.1007/s10951-017-0518-0</a>.","short":"E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92."},"has_accepted_license":"1","status":"public","user_id":"15415","ddc":["040"],"volume":21,"page":"77-92","_id":"63","publisher":"Springer"},{"ddc":["000"],"user_id":"39241","editor":[{"first_name":"Taisuke","last_name":"Izumi","full_name":"Izumi, Taisuke"},{"full_name":"Kuznetsov, Petr","first_name":"Petr","last_name":"Kuznetsov"}],"volume":11201,"publisher":"Springer, Cham","_id":"4411","has_accepted_license":"1","status":"public","conference":{"location":"Tokyo","start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","end_date":"2018-11-07"},"external_id":{"arxiv":["1809.04923"]},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-11-02T14:38:37Z","citation":{"mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>."},"doi":"10.1007/978-3-030-03232-6_1","language":[{"iso":"eng"}],"series_title":"Lecture Notes of Computer Science","date_updated":"2022-01-06T07:01:02Z","intvolume":"     11201","year":"2018","title":"A Self-Stabilizing Hashed Patricia Trie","author":[{"id":"39241","first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"type":"conference","department":[{"_id":"63"},{"_id":"79"}],"file":[{"file_id":"5277","success":1,"content_type":"application/pdf","file_name":"ASelf-stabilizingHashedPatrici.pdf","file_size":500005,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T14:38:37Z","date_created":"2018-11-02T14:38:37Z","creator":"ups"}],"date_created":"2018-09-17T13:12:18Z","abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)"},{"department":[{"_id":"63"},{"_id":"79"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"type":"conference","date_created":"2018-10-02T07:06:05Z","file":[{"creator":"ups","date_created":"2019-01-11T10:32:38Z","relation":"main_file","date_updated":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf","file_size":349034,"access_level":"closed","file_id":"6621","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n","lang":"eng"}],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:11Z","author":[{"id":"37827","first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina","id":"43647"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705"}],"year":"2018","title":"Competitive Routing in Hybrid Communication Networks","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }"},"file_date_updated":"2019-01-11T10:32:38Z","user_id":"38705","ddc":["000"],"_id":"4563","publisher":"Springer","has_accepted_license":"1","conference":{"end_date":"2018-08-24","start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","location":"Helsinki"},"status":"public"},{"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","department":[{"_id":"63"},{"_id":"79"}],"file":[{"date_created":"2018-11-02T13:48:10Z","creator":"ups","file_id":"5254","success":1,"content_type":"application/pdf","file_name":"p231-jung-1.pdf","file_size":1025077,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T13:48:10Z"}],"date_created":"2018-10-02T07:34:47Z","date_updated":"2022-01-06T07:01:12Z","publication_status":"published","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","year":"2018","author":[{"first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel","id":"37827"},{"id":"43647","first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"id":"38705","last_name":"Sundermeier","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"publication_identifier":{"isbn":["9781450357999"]},"doi":"10.1145/3210377.3210663","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"file_date_updated":"2018-11-02T13:48:10Z","citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }"},"has_accepted_license":"1","status":"public","conference":{"end_date":"2018-07-18","location":"Wien","name":"SPAA'18","start_date":"2018-07-17"},"ddc":["000"],"user_id":"38705","_id":"4565","publisher":"ACM Press"},{"_id":"7570","publisher":"ACM Press","user_id":"30291","ddc":["000"],"conference":{"end_date":"2018-07-18","start_date":"2018-07-16","name":"30th Symposium on Parallelism in Algorithms and Architectures","location":"Vienna"},"status":"public","has_accepted_license":"1","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.","apa":"Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. Vienna: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>.","short":"F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018."},"file_date_updated":"2019-02-06T14:18:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210662","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"30291","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer","first_name":"Johannes Sebastian"}],"publication_identifier":{"isbn":["9781450357999"]},"year":"2018","title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","publication_status":"published","date_updated":"2022-01-06T07:03:40Z","date_created":"2019-02-06T14:16:19Z","file":[{"content_type":"application/pdf","file_id":"7576","file_size":1504739,"access_level":"closed","file_name":"p359-meyer-auf-der-heide.pdf","date_updated":"2019-02-06T14:18:35Z","relation":"main_file","date_created":"2019-02-06T14:18:35Z","creator":"jschaef"}],"department":[{"_id":"63"}],"type":"conference","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18"},{"doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:00Z","author":[{"full_name":"Benter, Markus","first_name":"Markus","last_name":"Benter"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"11108","last_name":"Setzer","first_name":"Alexander","full_name":"Setzer, Alexander"},{"id":"38705","first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik"}],"year":"2018","title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","department":[{"_id":"63"},{"_id":"79"}],"keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"type":"conference","date_created":"2018-09-11T05:26:59Z","file":[{"creator":"tillk","date_created":"2018-11-27T10:03:33Z","file_size":1122875,"access_level":"closed","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","date_updated":"2018-11-27T10:03:33Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5863"}],"abstract":[{"lang":"eng","text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","user_id":"14955","ddc":["000"],"_id":"4375","has_accepted_license":"1","conference":{"start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","location":"Helsinki","end_date":"2018-08-21"},"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018."},"file_date_updated":"2018-11-27T10:03:33Z"},{"type":"bachelorsthesis","department":[{"_id":"63"}],"date_created":"2018-11-07T09:20:59Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"citation":{"bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","ama":"Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.","mla":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","chicago":"Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","ieee":"M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.","apa":"Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn."},"user_id":"477","publisher":"Universität Paderborn","_id":"5403","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:51Z","status":"public","year":"2018","title":"Mobile Facility Leasing","author":[{"first_name":"Marcel","last_name":"Geromel","full_name":"Geromel, Marcel"}]},{"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"bibtex":"@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus}, year={2018} }","ama":"Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn; 2018.","mla":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","ieee":"P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn, 2018.","apa":"Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>. Universität Paderborn."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2018-11-07T09:23:17Z","type":"bachelorsthesis","department":[{"_id":"63"}],"status":"public","year":"2018","title":"Online Algorithmen für das k-Page Migration Problem","author":[{"last_name":"Kolpaczki","first_name":"Patrick Irenäus","full_name":"Kolpaczki, Patrick Irenäus"}],"date_updated":"2022-01-06T07:01:51Z","_id":"5404","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"status":"public","has_accepted_license":"1","publisher":"Springer Nature","_id":"669","page":"1145-1167","volume":36,"user_id":"14052","ddc":["000"],"citation":{"mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>.","bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>. 2018;36(4):1145-1167. doi:<a href=\"https://doi.org/10.1007/s10878-017-0189-y\">10.1007/s10878-017-0189-y</a>","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1145–1167, 2018.","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2018). Congestion games with mixed objectives. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1145–1167. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2018): 1145–67. <a href=\"https://doi.org/10.1007/s10878-017-0189-y\">https://doi.org/10.1007/s10878-017-0189-y</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167."},"file_date_updated":"2018-10-31T16:57:32Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"external_id":{"arxiv":["1607.05143"]},"author":[{"id":"14052","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"full_name":"Leder, Lennart","last_name":"Leder","first_name":"Lennart"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"publication_identifier":{"issn":["1382-6905","1573-2886"]},"title":"Congestion games with mixed objectives","year":"2018","intvolume":"        36","publication_status":"published","date_updated":"2022-01-06T07:03:15Z","language":[{"iso":"eng"}],"doi":"10.1007/s10878-017-0189-y","publication":"Journal of Combinatorial Optimization","issue":"4","abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria."}],"date_created":"2017-10-26T14:11:04Z","file":[{"date_updated":"2018-10-31T16:57:32Z","relation":"main_file","access_level":"closed","file_size":605207,"file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","content_type":"application/pdf","success":1,"file_id":"5226","creator":"feldi","date_created":"2018-10-31T16:57:32Z"}],"department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article"},{"date_updated":"2022-01-06T06:51:11Z","author":[{"last_name":"Kemper","first_name":"Arne","full_name":"Kemper, Arne"}],"year":"2018","status":"public","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","user_id":"14052","_id":"1186","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}],"citation":{"apa":"Kemper, A. (2018). <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn.","ieee":"A. Kemper, <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","chicago":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","mla":"Kemper, Arne. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn, 2018.","ama":"Kemper A. <i>Pure Nash Equilibria in Robust Congestion Games via Potential Functions</i>. Universität Paderborn; 2018.","bibtex":"@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }"},"department":[{"_id":"63"},{"_id":"541"}],"type":"mastersthesis","date_created":"2018-03-02T13:47:57Z"},{"year":"2018","status":"public","title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","author":[{"last_name":"Nachtigall","first_name":"Marcel","full_name":"Nachtigall, Marcel"}],"date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","_id":"1187","user_id":"14052","supervisor":[{"last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384"}],"citation":{"apa":"Nachtigall, M. (2018). <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn.","ieee":"M. Nachtigall, <i>Scenario-driven Strategy Analysis in a n-player Composition Game Model</i>. Universität Paderborn, 2018.","chicago":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","mla":"Nachtigall, Marcel. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn, 2018.","ama":"Nachtigall M. <i>Scenario-Driven Strategy Analysis in a n-Player Composition Game Model</i>. Universität Paderborn; 2018.","bibtex":"@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall, Marcel}, year={2018} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-03-02T13:49:39Z","type":"bachelorsthesis","department":[{"_id":"63"},{"_id":"541"}]}]