[{"doi":"10.1007/978-3-030-03232-6_1","date_updated":"2022-01-06T07:01:02Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes of Computer Science","title":"A Self-Stabilizing Hashed Patricia Trie","external_id":{"arxiv":["1809.04923"]},"editor":[{"last_name":"Izumi","full_name":"Izumi, Taisuke","first_name":"Taisuke"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"},{"_id":"79"}],"intvolume":" 11201","_id":"4411","conference":{"location":"Tokyo","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2018-11-04","end_date":"2018-11-07"},"type":"conference","citation":{"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.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1.","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1","apa":"Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, 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} }"},"year":"2018","ddc":["000"],"user_id":"39241","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."}],"volume":11201,"has_accepted_license":"1","status":"public","date_created":"2018-09-17T13:12:18Z","publisher":"Springer, Cham","author":[{"id":"39241","last_name":"Knollmann","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","first_name":"Till"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"file_date_updated":"2018-11-02T14:38:37Z","file":[{"success":1,"relation":"main_file","date_updated":"2018-11-02T14:38:37Z","content_type":"application/pdf","file_id":"5277","creator":"ups","file_size":500005,"access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","date_created":"2018-11-02T14:38:37Z"}]},{"type":"conference","year":"2018","citation":{"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.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , 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} }"},"_id":"4563","conference":{"location":"Helsinki","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","start_date":"2018-08-23","end_date":"2018-08-24"},"status":"public","has_accepted_license":"1","date_created":"2018-10-02T07:06:05Z","author":[{"last_name":"Jung","id":"37827","first_name":"Daniel","full_name":"Jung, Daniel"},{"full_name":"Kolb, Christina","first_name":"Christina","id":"43647","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"publisher":"Springer","file_date_updated":"2019-01-11T10:32:38Z","keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","file":[{"file_id":"6621","creator":"ups","file_size":349034,"success":1,"relation":"main_file","date_updated":"2019-01-11T10:32:38Z","content_type":"application/pdf","date_created":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf","access_level":"closed"}],"ddc":["000"],"user_id":"38705","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"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:11Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"},{"_id":"79"}],"title":"Competitive Routing in Hybrid Communication Networks"},{"citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, 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} }","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.","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.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018."},"year":"2018","type":"conference","conference":{"end_date":"2018-07-18","location":"Wien","name":"SPAA'18","start_date":"2018-07-17"},"_id":"4565","file":[{"content_type":"application/pdf","date_updated":"2018-11-02T13:48:10Z","relation":"main_file","success":1,"file_size":1025077,"creator":"ups","file_id":"5254","access_level":"closed","file_name":"p231-jung-1.pdf","date_created":"2018-11-02T13:48:10Z"}],"file_date_updated":"2018-11-02T13:48:10Z","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","publisher":"ACM Press","author":[{"first_name":"Daniel","full_name":"Jung, Daniel","last_name":"Jung","id":"37827"},{"full_name":"Kolb, Christina","first_name":"Christina","id":"43647","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Sundermeier, Jannik","first_name":"Jannik","id":"38705","last_name":"Sundermeier"}],"date_created":"2018-10-02T07:34:47Z","has_accepted_license":"1","status":"public","user_id":"38705","ddc":["000"],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:12Z","doi":"10.1145/3210377.3210663","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks"},{"title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","date_updated":"2022-01-06T07:03:40Z","doi":"10.1145/3210377.3210662","language":[{"iso":"eng"}],"user_id":"30291","ddc":["000"],"file":[{"file_name":"p359-meyer-auf-der-heide.pdf","date_created":"2019-02-06T14:18:35Z","access_level":"closed","file_id":"7576","creator":"jschaef","file_size":1504739,"relation":"main_file","date_updated":"2019-02-06T14:18:35Z","content_type":"application/pdf"}],"file_date_updated":"2019-02-06T14:18:35Z","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","publisher":"ACM Press","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Schaefer","id":"30291","first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian"}],"date_created":"2019-02-06T14:16:19Z","has_accepted_license":"1","status":"public","conference":{"end_date":"2018-07-18","start_date":"2018-07-16","name":"30th Symposium on Parallelism in Algorithms and Architectures","location":"Vienna"},"_id":"7570","year":"2018","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662}, 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} }","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.","ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662","apa":"Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, 2018.","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."},"type":"conference"},{"_id":"4375","conference":{"end_date":"2018-08-21","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20","location":"Helsinki"},"citation":{"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={10.1007/978-3-030-19759-9_4}, 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} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4","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: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4","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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4.","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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.","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."},"type":"conference","year":"2018","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."}],"user_id":"14955","ddc":["000"],"file":[{"file_id":"5863","creator":"tillk","file_size":1122875,"relation":"main_file","success":1,"date_updated":"2018-11-27T10:03:33Z","content_type":"application/pdf","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","date_created":"2018-11-27T10:03:33Z","access_level":"closed"}],"author":[{"full_name":"Benter, Markus","first_name":"Markus","last_name":"Benter"},{"first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"id":"11108","last_name":"Setzer","full_name":"Setzer, Alexander","first_name":"Alexander"},{"full_name":"Sundermeier, Jannik","first_name":"Jannik","id":"38705","last_name":"Sundermeier"}],"file_date_updated":"2018-11-27T10:03:33Z","keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","status":"public","has_accepted_license":"1","date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"user_id":"477","title":"Mobile Facility Leasing","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:20:59Z","status":"public","department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"last_name":"Geromel","first_name":"Marcel","full_name":"Geromel, Marcel"}],"date_updated":"2022-01-06T07:01:51Z","_id":"5403","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"ieee":"M. Geromel, Mobile Facility Leasing. Universität Paderborn, 2018.","short":"M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.","mla":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","bibtex":"@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität Paderborn}, author={Geromel, Marcel}, year={2018} }","chicago":"Geromel, Marcel. Mobile Facility Leasing. Universität Paderborn, 2018.","ama":"Geromel M. Mobile Facility Leasing. Universität Paderborn; 2018.","apa":"Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn."},"type":"bachelorsthesis","year":"2018"},{"date_updated":"2022-01-06T07:01:51Z","_id":"5404","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"bachelorsthesis","year":"2018","citation":{"ieee":"P. I. Kolpaczki, Online Algorithmen für das k-Page Migration Problem. Universität Paderborn, 2018.","short":"P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität Paderborn, 2018.","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} }","mla":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","chicago":"Kolpaczki, Patrick Irenäus. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn, 2018.","apa":"Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.","ama":"Kolpaczki PI. Online Algorithmen Für Das K-Page Migration Problem. Universität Paderborn; 2018."},"user_id":"477","title":"Online Algorithmen für das k-Page Migration Problem","status":"public","date_created":"2018-11-07T09:23:17Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"author":[{"full_name":"Kolpaczki, Patrick Irenäus","first_name":"Patrick Irenäus","last_name":"Kolpaczki"}],"publisher":"Universität Paderborn","department":[{"_id":"63"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:15Z","doi":"10.1007/s10878-017-0189-y","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_status":"published","publication_identifier":{"issn":["1382-6905","1573-2886"]},"external_id":{"arxiv":["1607.05143"]},"title":"Congestion games with mixed objectives","page":"1145-1167","type":"journal_article","year":"2018","citation":{"bibtex":"@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.","ama":"Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018.","short":"M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167."},"_id":"669","intvolume":" 36","issue":"4","file":[{"access_level":"closed","date_created":"2018-10-31T16:57:32Z","file_name":"Feldotto2018_Article_CongestionGamesWithMixedObject.pdf","content_type":"application/pdf","date_updated":"2018-10-31T16:57:32Z","success":1,"relation":"main_file","file_size":605207,"file_id":"5226","creator":"feldi"}],"publication":"Journal of Combinatorial Optimization","file_date_updated":"2018-10-31T16:57:32Z","author":[{"first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","last_name":"Feldotto","id":"14052"},{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publisher":"Springer Nature","date_created":"2017-10-26T14:11:04Z","status":"public","has_accepted_license":"1","volume":36,"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."}],"user_id":"14052","ddc":["000"]},{"type":"mastersthesis","citation":{"short":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018.","ieee":"A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","chicago":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018.","apa":"Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn.","ama":"Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. 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} }","mla":"Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018."},"year":"2018","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"_id":"1186","date_updated":"2022-01-06T06:51:11Z","publisher":"Universität Paderborn","author":[{"first_name":"Arne","full_name":"Kemper, Arne","last_name":"Kemper"}],"department":[{"_id":"63"},{"_id":"541"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-03-02T13:47:57Z","title":"Pure Nash Equilibria in Robust Congestion Games via Potential Functions","user_id":"14052"},{"title":"Scenario-driven Strategy Analysis in a n-player Composition Game Model","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"last_name":"Nachtigall","full_name":"Nachtigall, Marcel","first_name":"Marcel"}],"date_created":"2018-03-02T13:49:39Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","date_updated":"2022-01-06T06:51:11Z","_id":"1187","type":"bachelorsthesis","year":"2018","citation":{"apa":"Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn.","ama":"Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn; 2018.","chicago":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. 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} }","mla":"Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018.","short":"M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018.","ieee":"M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018."},"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}]}]