[{"user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"602","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:16:08Z","ddc":["040"],"type":"report","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T08:16:08Z","date_created":"2018-03-15T08:16:08Z","creator":"florida","file_size":1284802,"access_level":"closed","file_name":"602-12062_01.pdf","file_id":"1251"}],"status":"public","abstract":[{"lang":"eng","text":"We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state."}],"author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"}],"date_created":"2017-10-17T12:42:49Z","date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","title":"Learning by Trading in Infinite Horizon Strategic Market Games with Default","has_accepted_license":"1","citation":{"mla":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","short":"S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012.","bibtex":"@book{Brangewitz_2012, title={Learning by Trading in Infinite Horizon Strategic Market Games with Default}, publisher={Universität Paderborn}, author={Brangewitz, Sonja}, year={2012} }","apa":"Brangewitz, S. (2012). <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn.","ama":"Brangewitz S. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn; 2012.","ieee":"S. Brangewitz, <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","chicago":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012."},"year":"2012"},{"abstract":[{"text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths.","lang":"eng"}],"status":"public","file":[{"creator":"hkarl","date_created":"2018-03-09T09:57:26Z","date_updated":"2018-03-09T09:57:26Z","file_name":"underlayMod2.pdf","access_level":"closed","file_id":"1205","file_size":717326,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"report","ddc":["000"],"file_date_updated":"2018-03-09T09:57:26Z","_id":"603","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"75"}],"user_id":"126","year":"2012","citation":{"bibtex":"@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","mla":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","apa":"Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","chicago":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","ieee":"P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn, 2012."},"has_accepted_license":"1","title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2017-10-17T12:42:49Z"},{"citation":{"ama":"Kluczniok S. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn; 2012.","ieee":"S. Kluczniok, <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","chicago":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","apa":"Kluczniok, S. (2012). <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn.","bibtex":"@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok, Sven}, year={2012} }","short":"S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012.","mla":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012."},"year":"2012","author":[{"first_name":"Sven","full_name":"Kluczniok, Sven","last_name":"Kluczniok"}],"date_created":"2017-10-17T12:42:52Z","date_updated":"2022-01-06T07:02:54Z","publisher":"Universität Paderborn","title":"Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"616","language":[{"iso":"ger"}]},{"type":"mastersthesis","status":"public","citation":{"ama":"Kurras S. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn; 2012.","chicago":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","ieee":"S. Kurras, <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","short":"S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012.","bibtex":"@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }","mla":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","apa":"Kurras, S. (2012). <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn."},"year":"2012","date_created":"2017-10-17T12:42:52Z","author":[{"first_name":"Sven","last_name":"Kurras","full_name":"Kurras, Sven"}],"user_id":"15504","_id":"618","date_updated":"2022-01-06T07:02:55Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","title":"Distributed Sampling of Regular Graphs"},{"publication":"Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)","type":"conference","abstract":[{"text":"Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T06:47:15Z","creator":"florida","date_created":"2018-03-15T06:47:15Z","file_size":346044,"access_level":"closed","file_id":"1244","file_name":"619-Brandes_MadHTADDS12_01.pdf"}],"_id":"619","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"15504","series_title":"ICPS","ddc":["040"],"file_date_updated":"2018-03-15T06:47:15Z","has_accepted_license":"1","year":"2012","page":"9-14","citation":{"ama":"Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>","ieee":"P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.","chicago":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>.","apa":"Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>","mla":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>.","short":"P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.","bibtex":"@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }"},"date_updated":"2022-01-06T07:02:56Z","author":[{"full_name":"Brandes, Philipp","last_name":"Brandes","first_name":"Philipp"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2017-10-17T12:42:52Z","title":"Distributed Computing in Fault-Prone Dynamic Networks","doi":"10.1145/2414815.2414818"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"625","user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:44:09Z","type":"conference","publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","abstract":[{"text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.","lang":"eng"}],"file":[{"creator":"florida","date_created":"2018-03-15T06:44:09Z","date_updated":"2018-03-15T06:44:09Z","access_level":"closed","file_name":"625-disc12adjBAshort.pdf","file_id":"1240","file_size":717284,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","date_updated":"2022-01-06T07:02:58Z","date_created":"2017-10-17T12:42:53Z","author":[{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Bernhard","full_name":"Häupler, Bernhard","last_name":"Häupler"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"}],"title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","doi":"10.1007/978-3-642-33651-5_47","has_accepted_license":"1","year":"2012","citation":{"apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440."},"page":"439-440"},{"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","abstract":[{"text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT).","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":184095,"file_id":"1239","access_level":"closed","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","date_updated":"2018-03-15T06:42:40Z","creator":"florida","date_created":"2018-03-15T06:42:40Z"}],"_id":"626","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","ddc":["040"],"file_date_updated":"2018-03-15T06:42:40Z","has_accepted_license":"1","year":"2012","page":"435-436","citation":{"ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>.","apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>"},"date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","doi":"10.1007/978-3-642-33651-5_45"},{"_id":"628","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"series_title":"LNCS","user_id":"477","ddc":["040"],"file_date_updated":"2018-03-15T06:42:01Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","abstract":[{"lang":"eng","text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers."}],"status":"public","file":[{"file_name":"628-FULL_paper_bncs_with_interests.pdf","access_level":"closed","file_id":"1238","file_size":300591,"date_created":"2018-03-15T06:42:01Z","creator":"florida","date_updated":"2018-03-15T06:42:01Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T07:02:59Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Martina","last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:54Z","title":"Basic Network Creation Games with Communication Interests","doi":"10.1007/978-3-642-33996-7_7","has_accepted_license":"1","year":"2012","page":"72--83","citation":{"apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>.","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>."}},{"year":"2012","citation":{"ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>."},"page":"800-810","has_accepted_license":"1","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","doi":"10.1137/1.9781611973099.64","date_updated":"2022-01-06T07:03:01Z","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:55Z","abstract":[{"lang":"eng","text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1234","file_name":"632-SODA2012-Scheideler_01.pdf","access_level":"closed","file_size":220213,"creator":"florida","date_created":"2018-03-15T06:35:58Z","date_updated":"2018-03-15T06:35:58Z"}],"status":"public","type":"conference","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","ddc":["040"],"file_date_updated":"2018-03-15T06:35:58Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"632","user_id":"15504","department":[{"_id":"79"}]},{"title":"An Algorithm for Facility Leasing","doi":"10.1007/978-3-642-31104-8_6","date_updated":"2022-01-06T07:03:02Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"}],"date_created":"2017-10-17T12:42:56Z","year":"2012","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>}, booktitle={Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }","short":"F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO), 2012, pp. 61–72.","apa":"Meyer auf der Heide, F., Pietrzyk, P., &#38; Kling, P. (2012). An Algorithm for Facility Leasing. In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>","ieee":"F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72.","chicago":"Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 61–72. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>.","ama":"Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>. LNCS. ; 2012:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>"},"page":"61-72","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-14T14:14:21Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"636","series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax."}],"file":[{"creator":"florida","date_created":"2018-03-14T14:14:21Z","date_updated":"2018-03-14T14:14:21Z","access_level":"closed","file_name":"636-Online_Facility_Location.pdf","file_id":"1232","file_size":173049,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"conference","publication":"Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)"},{"language":[{"iso":"ger"}],"_id":"637","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:02Z","author":[{"full_name":"Dawirs, Friederike","last_name":"Dawirs","first_name":"Friederike"}],"date_created":"2017-10-17T12:42:56Z","year":"2012","citation":{"mla":"Dawirs, Friederike. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012.","short":"F. Dawirs, Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index, Universität Paderborn, 2012.","bibtex":"@book{Dawirs_2012, title={Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index}, publisher={Universität Paderborn}, author={Dawirs, Friederike}, year={2012} }","apa":"Dawirs, F. (2012). <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn.","ama":"Dawirs F. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn; 2012.","ieee":"F. Dawirs, <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012.","chicago":"Dawirs, Friederike. <i>Alternative Berechnung der Machtindizes: Banzhaf und Shapley-Shubik Index</i>. Universität Paderborn, 2012."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"638","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"477","year":"2012","citation":{"apa":"Eidens, F. (2012). <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn.","short":"F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012.","bibtex":"@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }","mla":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","chicago":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","ieee":"F. Eidens, <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","ama":"Eidens F. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn; 2012."},"title":"Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:03Z","author":[{"id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian"}],"date_created":"2017-10-17T12:42:56Z"},{"ddc":["040"],"file_date_updated":"2018-03-14T14:13:13Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"640","user_id":"15504","department":[{"_id":"79"}],"abstract":[{"lang":"eng","text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network."}],"file":[{"file_size":210176,"access_level":"closed","file_id":"1230","file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","date_updated":"2018-03-14T14:13:13Z","creator":"florida","date_created":"2018-03-14T14:13:13Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","title":"A Self-Stabilization Process for Small-World Networks","doi":"10.1109/IPDPS.2012.115","date_updated":"2022-01-06T07:03:04Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:56Z","year":"2012","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1261--1271, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1261--1271. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1261--1271). <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>."},"page":"1261--1271","has_accepted_license":"1"},{"_id":"641","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T07:03:04Z","publisher":"Universität Paderborn","author":[{"last_name":"Schluessler","full_name":"Schluessler, Jonathan","first_name":"Jonathan"}],"date_created":"2017-10-17T12:42:57Z","user_id":"15504","title":"A Forensic Framework for Automatic Information Retrieval in Distributed Systems","type":"mastersthesis","year":"2012","status":"public","citation":{"ama":"Schluessler J. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn; 2012.","chicago":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","ieee":"J. Schluessler, <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","apa":"Schluessler, J. (2012). <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn.","mla":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","short":"J. Schluessler, A Forensic Framework for Automatic Information Retrieval in Distributed Systems, Universität Paderborn, 2012.","bibtex":"@book{Schluessler_2012, title={A Forensic Framework for Automatic Information Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler, Jonathan}, year={2012} }"}},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"34169","user_id":"477","department":[{"_id":"205"}],"ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2022-11-30T14:44:47Z","type":"dissertation","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1277591,"file_name":"Dissertation-Brangewitz.pdf","access_level":"closed","file_id":"34170","date_updated":"2022-11-30T14:44:47Z","creator":"florida","date_created":"2022-11-30T14:44:47Z"}],"status":"public","date_updated":"2022-11-30T14:47:46Z","author":[{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"}],"date_created":"2022-11-30T14:43:16Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"title":"Coalitional and Strategic Market Games","has_accepted_license":"1","place":"Universität Bielefeld","year":"2012","citation":{"chicago":"Brangewitz, Sonja. <i>Coalitional and Strategic Market Games</i>. Universität Bielefeld, 2012.","ieee":"S. Brangewitz, <i>Coalitional and Strategic Market Games</i>. Universität Bielefeld, 2012.","ama":"Brangewitz S. <i>Coalitional and Strategic Market Games</i>.; 2012.","apa":"Brangewitz, S. (2012). <i>Coalitional and Strategic Market Games</i>.","mla":"Brangewitz, Sonja. <i>Coalitional and Strategic Market Games</i>. 2012.","short":"S. Brangewitz, Coalitional and Strategic Market Games, Universität Bielefeld, 2012.","bibtex":"@book{Brangewitz_2012, place={Universität Bielefeld}, title={Coalitional and Strategic Market Games}, author={Brangewitz, Sonja}, year={2012} }"}},{"publication":"International Journal of Economic Theory","file":[{"date_updated":"2018-11-07T10:41:24Z","creator":"stela","date_created":"2018-11-07T10:41:24Z","file_size":152349,"file_name":"Proportionality and the power of unequal parties.pdf","access_level":"closed","file_id":"5408","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"In this paper we introduce the concept of an overall power function that is meant\r\nto combine two sources of a party’s power in a parliament. The first source is based\r\non the possibilities for the party to be part of a majority coalition and it is typically\r\nmodeled using a cooperative simple game. The second source takes into account\r\nparties’ asymmetries outside the cooperative game and it is displayed by a vector\r\nof exogenously given weights. We adopt a normative point of view and provide an\r\naxiomatic characterization of a specific overall power function, in which the weights\r\nenter in a proportional fashion."}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"2","year":"2011","date_created":"2018-04-26T10:43:43Z","publisher":"Wiley-Blackwell","title":"Proportionality and the power of unequal parties","type":"journal_article","status":"public","department":[{"_id":"205"},{"_id":"475"}],"user_id":"65453","_id":"2512","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"file_date_updated":"2018-11-07T10:41:24Z","publication_identifier":{"issn":["1742-7355"]},"has_accepted_license":"1","publication_status":"published","intvolume":"         7","page":"189-200","jel":["C71","D72"],"citation":{"apa":"Dimitrov, D., &#38; Haake, C.-J. (2011). Proportionality and the power of unequal parties. <i>International Journal of Economic Theory</i>, <i>7</i>(2), 189–200. <a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">https://doi.org/10.1111/j.1742-7363.2011.00158.x</a>","bibtex":"@article{Dimitrov_Haake_2011, title={Proportionality and the power of unequal parties}, volume={7}, DOI={<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>}, number={2}, journal={International Journal of Economic Theory}, publisher={Wiley-Blackwell}, author={Dimitrov, Dinko and Haake, Claus-Jochen}, year={2011}, pages={189–200} }","short":"D. Dimitrov, C.-J. Haake, International Journal of Economic Theory 7 (2011) 189–200.","mla":"Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of Unequal Parties.” <i>International Journal of Economic Theory</i>, vol. 7, no. 2, Wiley-Blackwell, 2011, pp. 189–200, doi:<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>.","ieee":"D. Dimitrov and C.-J. Haake, “Proportionality and the power of unequal parties,” <i>International Journal of Economic Theory</i>, vol. 7, no. 2, pp. 189–200, 2011.","chicago":"Dimitrov, Dinko, and Claus-Jochen Haake. “Proportionality and the Power of Unequal Parties.” <i>International Journal of Economic Theory</i> 7, no. 2 (2011): 189–200. <a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">https://doi.org/10.1111/j.1742-7363.2011.00158.x</a>.","ama":"Dimitrov D, Haake C-J. Proportionality and the power of unequal parties. <i>International Journal of Economic Theory</i>. 2011;7(2):189-200. doi:<a href=\"https://doi.org/10.1111/j.1742-7363.2011.00158.x\">10.1111/j.1742-7363.2011.00158.x</a>"},"volume":7,"author":[{"full_name":"Dimitrov, Dinko","last_name":"Dimitrov","first_name":"Dinko"},{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2022-01-06T06:56:51Z","doi":"10.1111/j.1742-7363.2011.00158.x"},{"title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","author":[{"last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander","first_name":"Alexander"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-08-17T08:08:13Z","date_updated":"2022-01-06T06:53:24Z","publisher":"Universität Paderborn","citation":{"ama":"Setzer A. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn; 2011.","chicago":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","ieee":"A. Setzer, <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","mla":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","bibtex":"@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2011} }","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.","apa":"Setzer, A. (2011). <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn."},"year":"2011","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"17997","status":"public","type":"bachelorsthesis"},{"citation":{"bibtex":"@book{Diehl_2011, title={Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität}, publisher={Universität Paderborn}, author={Diehl, Matthias}, year={2011} }","mla":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","short":"M. Diehl, Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität, Universität Paderborn, 2011.","apa":"Diehl, M. (2011). <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn.","ama":"Diehl M. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn; 2011.","chicago":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","ieee":"M. Diehl, <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011."},"year":"2011","date_created":"2017-10-17T12:42:57Z","author":[{"full_name":"Diehl, Matthias","last_name":"Diehl","first_name":"Matthias"}],"date_updated":"2022-01-06T07:03:04Z","publisher":"Universität Paderborn","title":"Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität","type":"bachelorsthesis","status":"public","user_id":"477","_id":"642","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"ger"}]},{"author":[{"first_name":"Philipp","full_name":"Brandes, Philipp","last_name":"Brandes"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:58Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:06Z","title":"Robust Distributed Computation in Dynamic Networks","citation":{"apa":"Brandes, P. (2011). <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn.","bibtex":"@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks}, publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }","mla":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","short":"P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.","ama":"Brandes P. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn; 2011.","ieee":"P. Brandes, <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","chicago":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011."},"year":"2011","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"648","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"user_id":"13264","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"651","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","author":[{"last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja","first_name":"Nadja"}],"date_created":"2017-10-17T12:42:58Z","supervisor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"}],"date_updated":"2022-01-06T07:03:08Z","publisher":"Universität Paderborn","title":"Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme","citation":{"ama":"Stroh-Maraun N. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn; 2011.","ieee":"N. Stroh-Maraun, <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","chicago":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","bibtex":"@book{Stroh-Maraun_2011, title={Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2011} }","short":"N. Stroh-Maraun, Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme, Universität Paderborn, 2011.","mla":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","apa":"Stroh-Maraun, N. (2011). <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn."},"year":"2011"}]