[{"date_created":"2017-10-17T12:42:06Z","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:59:36Z","doi":"10.1007/978-3-319-12691-3_3","title":"Randomized Online Algorithms for Set Cover Leasing Problems","has_accepted_license":"1","page":"25-34","citation":{"apa":"Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 25–34). <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>","mla":"Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>.","bibtex":"@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS}, title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>}, booktitle={Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS} }","short":"S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp. 25–34.","ama":"Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2014:25-34. doi:<a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">10.1007/978-3-319-12691-3_3</a>","ieee":"S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp. 25–34.","chicago":"Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide. “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 25–34. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-12691-3_3\">https://doi.org/10.1007/978-3-319-12691-3_3</a>."},"year":"2014","department":[{"_id":"63"}],"user_id":"15504","series_title":"LNCS","_id":"379","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-20T07:12:57Z","ddc":["040"],"publication":"Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","type":"conference","status":"public","file":[{"file_size":214299,"access_level":"closed","file_name":"379-COCOA14.pdf","file_id":"1395","date_updated":"2018-03-20T07:12:57Z","date_created":"2018-03-20T07:12:57Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"In the leasing variant of Set Cover presented by Anthony et al.[1], elements U arrive over time and must be covered by sets from a familyF of subsets of U. Each set can be leased for K different periods of time.Let |U| = n and |F| = m. Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements for the next lk time steps. The objectiveis to minimize the total cost of the sets leased, such that elements arrivingat any time t are covered by sets which contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log n)-approximation forthe problem in the offline setting, unless P = NP [22]. In this paper, wegive randomized algorithms for variants of Set Cover Leasing in the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented by Alon et al. [2], where elements appear multiple times andmust be covered by a different set at each arrival. Our results improve theO(log2(mn)) competitive factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)), where d is the maximum numberof sets an element belongs to."}]},{"date_updated":"2022-01-06T06:59:36Z","date_created":"2017-10-17T12:42:06Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Quality of Service in Network Creation Games","doi":"10.1007/978-3-319-13129-0_34","has_accepted_license":"1","year":"2014","page":"423-428","citation":{"apa":"Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality of Service in Network Creation Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>","bibtex":"@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality of Service in Network Creation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2014}, pages={423–428} }","mla":"Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>.","short":"A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 423–428.","ieee":"A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service in Network Creation Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.","chicago":"Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">https://doi.org/10.1007/978-3-319-13129-0_34</a>.","ama":"Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network Creation Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_34\">10.1007/978-3-319-13129-0_34</a>"},"_id":"380","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:05:59Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances from v to all other nodes plus the prices of the bought edges. The above papers show the existence of Nash equilibria as well as upper and lower bounds for the prices of anarchy and stability. In several subsequent papers, these bounds were improved for a wide range of prices α. In this paper, we extend these models by incorporating quality-of-service aspects: Each edge cannot only be bought at a fixed quality (edge length one) for a fixed price α. Instead, we assume that quality levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series = {LNCS}","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:05:59Z","creator":"florida","date_updated":"2018-03-20T07:05:59Z","access_level":"closed","file_name":"380-WINE2014.pdf","file_id":"1394","file_size":166640}]},{"publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)","type":"conference","abstract":[{"text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition.","lang":"eng"}],"status":"public","file":[{"file_id":"5250","access_level":"closed","file_name":"06930535.pdf","file_size":228172,"creator":"ups","date_created":"2018-11-02T13:34:46Z","date_updated":"2018-11-02T13:34:46Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"_id":"382","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"},{"_id":"205"}],"user_id":"477","ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:34:46Z","has_accepted_license":"1","year":"2014","page":"203-210","citation":{"ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>.","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>","apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210."},"date_updated":"2022-01-06T06:59:37Z","author":[{"last_name":"Künsemöller","full_name":"Künsemöller, Jörn","first_name":"Jörn"},{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"date_created":"2017-10-17T12:42:06Z","title":"Provider Competition in Infrastructure-as-a-Service","doi":"10.1109/SCC.2014.35"},{"title":"On Variants of the Page Migration Problem","date_created":"2017-10-17T12:42:08Z","author":[{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"}],"user_id":"477","_id":"391","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T06:59:54Z","publisher":"Universität Paderborn","status":"public","citation":{"ama":"Feldkord B. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn; 2014.","ieee":"B. Feldkord, <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","chicago":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","short":"B. Feldkord, On Variants of the Page Migration Problem, Universität Paderborn, 2014.","bibtex":"@book{Feldkord_2014, title={On Variants of the Page Migration Problem}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2014} }","mla":"Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn, 2014.","apa":"Feldkord, B. (2014). <i>On Variants of the Page Migration Problem</i>. Universität Paderborn."},"year":"2014","type":"mastersthesis"},{"file":[{"file_size":409720,"file_name":"443-WP74.pdf","file_id":"1350","access_level":"closed","date_updated":"2018-03-16T11:28:04Z","date_created":"2018-03-16T11:28:04Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"The objective of this paper is to analyze the formation of group structures where individuals are allowed to engage in several groups at the same time. These structures are interpreted here as social networks. Each of the groups is supposed to have specific rules or constitutions governing which members may join or leave it. A social network is then considered to be stable if none of the groups is altered any more. Given this framework, we not only analyze which influence the constitutions have on network formation but we also provide requirements under which stable networks are induced for sure. Furthermore, by embedding many-to-many matchings into our setting, we apply our model to job markets with labor unions. To some extent the unions may provide job guarantees and, therefore, have influence on the stability of the job market."}],"type":"report","language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:28:04Z","ddc":["040"],"user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"443","citation":{"bibtex":"@book{Mauleon_Röhl_Vannetelbosch_2014, title={Constitutions and Social Networks}, publisher={Universität Paderborn}, author={Mauleon, Ana and Röhl, Nils and Vannetelbosch, Vincent}, year={2014} }","mla":"Mauleon, Ana, et al. <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","short":"A. Mauleon, N. Röhl, V. Vannetelbosch, Constitutions and Social Networks, Universität Paderborn, 2014.","apa":"Mauleon, A., Röhl, N., &#38; Vannetelbosch, V. (2014). <i>Constitutions and Social Networks</i>. Universität Paderborn.","ieee":"A. Mauleon, N. Röhl, and V. Vannetelbosch, <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","chicago":"Mauleon, Ana, Nils Röhl, and Vincent Vannetelbosch. <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","ama":"Mauleon A, Röhl N, Vannetelbosch V. <i>Constitutions and Social Networks</i>. Universität Paderborn; 2014."},"year":"2014","has_accepted_license":"1","title":"Constitutions and Social Networks","author":[{"first_name":"Ana","full_name":"Mauleon, Ana","last_name":"Mauleon"},{"last_name":"Röhl","full_name":"Röhl, Nils","first_name":"Nils"},{"last_name":"Vannetelbosch","full_name":"Vannetelbosch, Vincent","first_name":"Vincent"}],"date_created":"2017-10-17T12:42:18Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:03Z"},{"abstract":[{"text":"BackgroundMedical nonpersistence is a worldwide problem of striking magnitude. Although many fields of studies including epidemiology, sociology, and psychology try to identify determinants for medical nonpersistence, comprehensive research to explain medical nonpersistence from an economics perspective is rather scarce.ObjectivesThe aim of the study was to develop a conceptual framework that augments standard economic choice theory with psychological concepts of behavioral economics to understand how patients’ preferences for discontinuing with therapy arise over the course of the medical treatment. The availability of such a framework allows the targeted design of mechanisms for intervention strategies.MethodsOur conceptual framework models the patient as an active economic agent who evaluates the benefits and costs for continuing with therapy. We argue that a combination of loss aversion and mental accounting operations explains why patients discontinue with therapy at a specific point in time. We designed a randomized laboratory economic experiment with a student subject pool to investigate the behavioral predictions.ResultsSubjects continue with therapy as long as experienced utility losses have to be compensated. As soon as previous losses are evened out, subjects perceive the marginal benefit of persistence lower than in the beginning of the treatment. Consequently, subjects start to discontinue with therapy.ConclusionsOur results highlight that concepts of behavioral economics capture the dynamic structure of medical nonpersistence better than does standard economic choice theory. We recommend that behavioral economics should be a mandatory part of the development of possible intervention strategies aimed at improving patients’ compliance and persistence behavior.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:44:35Z","creator":"ups","date_updated":"2018-11-02T15:44:35Z","access_level":"closed","file_name":"DjawadiFahr.pdf","file_id":"5311","file_size":716934}],"status":"public","type":"journal_article","publication":"Value in Health","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:44:35Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"444","user_id":"477","department":[{"_id":"179"}],"year":"2014","citation":{"short":"B. Mir Djawadi, R. Fahr, F. Turk, Value in Health (2014) 814–822.","bibtex":"@article{Mir Djawadi_Fahr_Turk_2014, title={Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change}, DOI={<a href=\"https://doi.org/10.1016/j.jval.2014.08.2669\">10.1016/j.jval.2014.08.2669</a>}, number={8}, journal={Value in Health}, publisher={Elsevier}, author={Mir Djawadi, Behnud and Fahr, Rene and Turk, Florian}, year={2014}, pages={814–822} }","mla":"Mir Djawadi, Behnud, et al. “Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.” <i>Value in Health</i>, no. 8, Elsevier, 2014, pp. 814–22, doi:<a href=\"https://doi.org/10.1016/j.jval.2014.08.2669\">10.1016/j.jval.2014.08.2669</a>.","apa":"Mir Djawadi, B., Fahr, R., &#38; Turk, F. (2014). Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change. <i>Value in Health</i>, (8), 814–822. <a href=\"https://doi.org/10.1016/j.jval.2014.08.2669\">https://doi.org/10.1016/j.jval.2014.08.2669</a>","ieee":"B. Mir Djawadi, R. Fahr, and F. Turk, “Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change,” <i>Value in Health</i>, no. 8, pp. 814–822, 2014.","chicago":"Mir Djawadi, Behnud, Rene Fahr, and Florian Turk. “Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change.” <i>Value in Health</i>, no. 8 (2014): 814–22. <a href=\"https://doi.org/10.1016/j.jval.2014.08.2669\">https://doi.org/10.1016/j.jval.2014.08.2669</a>.","ama":"Mir Djawadi B, Fahr R, Turk F. Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change. <i>Value in Health</i>. 2014;(8):814-822. doi:<a href=\"https://doi.org/10.1016/j.jval.2014.08.2669\">10.1016/j.jval.2014.08.2669</a>"},"page":"814-822","has_accepted_license":"1","issue":"8","title":"Conceptual Model and Economic Experiments to Explain Nonpersistence and Enable Mechanism Designs Fosterin Behavioral Change","doi":"10.1016/j.jval.2014.08.2669","date_updated":"2022-01-06T07:01:04Z","publisher":"Elsevier","author":[{"first_name":"Behnud","last_name":"Mir Djawadi","orcid":"0000-0002-6271-5912","full_name":"Mir Djawadi, Behnud","id":"26032"},{"last_name":"Fahr","id":"111","full_name":"Fahr, Rene","first_name":"Rene"},{"first_name":"Florian","last_name":"Turk","full_name":"Turk, Florian"}],"date_created":"2017-10-17T12:42:18Z"},{"file":[{"date_updated":"2018-03-16T11:27:32Z","date_created":"2018-03-16T11:27:32Z","creator":"florida","file_size":391317,"file_id":"1349","file_name":"445-Brangewitz_and_Gamp__2014__-_Competitive_outcomes_and_the_inner_core_of_NTU_market_games.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to payoffs of competitive equilibria of markets that are induced by NTU games. An NTU game is an NTU market game if there exists a market such that the set of utility allocations a coalition can achieve in the market coincides with the set of utility allocations the coalition can achieve in the game. In this paper, we introduce a new construction of a market based on a closed subset of the inner core which satisfies a strict positive separability. We show that the constructed market represents the NTU game and, further, has the given closed set as the set of payoff vectors of competitive equilibria. It turns out that this market is not uniquely determined, and thus, we obtain a class of markets. Our results generalize those relating to competitive outcomes of NTU market games in the literature."}],"type":"journal_article","publication":"Economic Theory","file_date_updated":"2018-03-16T11:27:32Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"445","citation":{"mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, no. 3, Springer, 2014, pp. 529–54, doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>.","bibtex":"@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner core of NTU market games}, DOI={<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>}, number={3}, journal={Economic Theory}, publisher={Springer}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }","short":"S. Brangewitz, J.-P. Gamp, Economic Theory (2014) 529–554.","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2014). Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>, (3), 529–554. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, no. 3 (2014): 529–54. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>.","ieee":"S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of NTU market games,” <i>Economic Theory</i>, no. 3, pp. 529–554, 2014.","ama":"Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>. 2014;(3):529-554. doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>"},"page":"529-554","year":"2014","issue":"3","has_accepted_license":"1","doi":"10.1007/s00199-014-0846-7","title":"Competitive outcomes and the inner core of NTU market games","date_created":"2017-10-17T12:42:18Z","author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"full_name":"Gamp, Jan-Philip","last_name":"Gamp","first_name":"Jan-Philip"}],"publisher":"Springer","date_updated":"2022-01-06T07:01:04Z"},{"year":"2014","citation":{"apa":"Drees, M., Riechers, S., &#38; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 110–121). <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>","short":"M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.","bibtex":"@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes in Computer Science} }","mla":"Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>.","ama":"Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>","ieee":"M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, pp. 110–121.","chicago":"Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>."},"page":"110-121","has_accepted_license":"1","title":"Budget-restricted utility games with ordered strategic decisions","doi":"10.1007/978-3-662-44803-8_10","date_updated":"2022-01-06T07:01:07Z","date_created":"2017-10-17T12:42:20Z","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"abstract":[{"text":"We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to be shared between the tasks. We study strategic budget games, where the budget is shared proportionally. We also consider a variant in which the order of the strategic decisions influences the distribution of the budgets. The complexity of the optimal solution as well as existence, complexity and quality of equilibria are analysed. Finally, we show that the time an ordered budget game needs to convergence towards an equilibrium may be exponential.","lang":"eng"}],"editor":[{"full_name":"Lavi, Ron","last_name":"Lavi","first_name":"Ron"}],"file":[{"creator":"florida","date_created":"2018-03-16T11:25:10Z","date_updated":"2018-03-16T11:25:10Z","file_name":"451-DRS14.pdf","access_level":"closed","file_id":"1344","file_size":283266,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"conference","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:25:10Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"451","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"63"},{"_id":"541"}]},{"editor":[{"last_name":"Lavi","full_name":"Lavi, Ron","first_name":"Ron"}],"status":"public","type":"conference","file_date_updated":"2018-03-16T11:24:40Z","_id":"452","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"15415","series_title":"LNCS","page":"294","citation":{"chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 294. LNCS, 2014.","ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, p. 294.","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294.","mla":"Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, p. 294.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (p. 294)."},"has_accepted_license":"1","date_updated":"2022-01-06T07:01:08Z","author":[{"first_name":"Sebastian","last_name":"Abshoff","full_name":"Abshoff, Sebastian"},{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"abstract":[{"lang":"eng","text":"Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \\alpha > 0, if it decides to be a gateway. For both games and different ranges of \\alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":84783,"file_name":"452-title_multilevel-sagt.pdf","access_level":"closed","file_id":"1343","date_updated":"2018-03-16T11:24:40Z","creator":"florida","date_created":"2018-03-16T11:24:40Z"}],"publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2014","title":"Brief Announcement: A Model for Multilevel Network Games","date_created":"2017-10-17T12:42:20Z"},{"date_updated":"2022-01-06T07:01:09Z","date_created":"2017-10-17T12:42:20Z","author":[{"first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052","full_name":"Feldotto, Matthias"},{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"first_name":"Alexander","id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik"}],"title":"Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria","doi":"10.1007/978-3-319-13129-0_3","has_accepted_license":"1","year":"2014","page":"30-43","citation":{"bibtex":"@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander}, year={2014}, pages={30–43}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>.","short":"M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.","apa":"Feldotto, M., Gairing, M., &#38; Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 30–43). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>","ieee":"M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43.","chicago":"Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 30–43. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>.","ama":"Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:30-43. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>"},"_id":"453","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"department":[{"_id":"63"},{"_id":"541"}],"series_title":"LNCS","user_id":"14052","ddc":["040"],"file_date_updated":"2018-03-16T11:24:11Z","publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","abstract":[{"lang":"eng","text":"In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\\Phi(\\sf s)$ of any outcome $\\sf s$ of a congestion game approximates the optimum potential value $\\Phi(\\sf s^*)$ by a factor $\\Psi_{\\mathcal{F}}$ which only depends on the set of cost/utility functions $\\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\\sf s$. The significance of this result is twofold. On the one hand it provides \\emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\\varepsilon)\\cdot\\Psi_{\\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions."}],"status":"public","file":[{"file_size":324307,"file_name":"453-WINE14FGS.pdf","file_id":"1342","access_level":"closed","date_updated":"2018-03-16T11:24:11Z","creator":"florida","date_created":"2018-03-16T11:24:11Z","success":1,"relation":"main_file","content_type":"application/pdf"}]},{"date_created":"2017-10-17T12:42:20Z","author":[{"first_name":"Christoph","full_name":"Hansknecht, Christoph","last_name":"Hansknecht"},{"last_name":"Klimm","full_name":"Klimm, Max","first_name":"Max"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_updated":"2022-01-06T07:01:09Z","doi":"10.4230/LIPIcs.APPROX-RANDOM.2014.242","title":"Approximate pure Nash equilibria in weighted congestion games","has_accepted_license":"1","page":"242 - 257","citation":{"ieee":"C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–257.","chicago":"Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 242–57. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","ama":"Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. LIPIcs. ; 2014:242-257. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>","mla":"Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","short":"C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.","bibtex":"@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>}, booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs} }","apa":"Hansknecht, C., Klimm, M., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i> (pp. 242–257). <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>"},"year":"2014","department":[{"_id":"541"},{"_id":"63"}],"series_title":"LIPIcs","user_id":"477","_id":"455","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-16T11:23:40Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","type":"conference","status":"public","file":[{"file_id":"1341","file_name":"455-HKS14.pdf","access_level":"closed","file_size":512712,"date_created":"2018-03-16T11:23:40Z","creator":"florida","date_updated":"2018-03-16T11:23:40Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions."}]},{"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","abstract":[{"text":"We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19].","lang":"eng"}],"file":[{"date_created":"2018-03-16T11:22:57Z","creator":"florida","date_updated":"2018-03-16T11:22:57Z","file_id":"1340","file_name":"456-WINE14final.pdf","access_level":"closed","file_size":377378,"content_type":"application/pdf","relation":"main_file","success":1}],"date_created":"2017-10-17T12:42:21Z","title":"Approximate pure Nash equilibria in Social Context Congestion Games","year":"2014","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"456","series_title":"LNCS","user_id":"477","department":[{"_id":"541"},{"_id":"63"}],"file_date_updated":"2018-03-16T11:22:57Z","type":"conference","status":"public","date_updated":"2022-01-06T07:01:10Z","author":[{"last_name":"Gairing","full_name":"Gairing, Martin","first_name":"Martin"},{"last_name":"Kotsialou","full_name":"Kotsialou, Grammateia","first_name":"Grammateia"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"doi":"10.1007/978-3-319-13129-0_43","has_accepted_license":"1","citation":{"ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:480-485. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 480–85. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>.","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–485.","apa":"Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 480–485). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>","short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>.","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2014}, pages={480–485}, collection={LNCS} }"},"page":"480 - 485"},{"type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"458","user_id":"15504","department":[{"_id":"75"}],"year":"2014","citation":{"chicago":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ieee":"P. Dreimann, <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ama":"Dreimann P. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn; 2014.","mla":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","short":"P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014.","bibtex":"@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn}, author={Dreimann, Philipp}, year={2014} }","apa":"Dreimann, P. (2014). <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:13Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:21Z","author":[{"first_name":"Philipp","last_name":"Dreimann","full_name":"Dreimann, Philipp"}],"title":"Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"459","series_title":"LNCS","user_id":"477","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-16T11:21:54Z","type":"conference","publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","abstract":[{"lang":"eng","text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1338","file_name":"459-SIROCCO2014.pdf","file_size":274496,"date_created":"2018-03-16T11:21:54Z","creator":"florida","date_updated":"2018-03-16T11:21:54Z"}],"status":"public","date_updated":"2022-01-06T07:01:14Z","date_created":"2017-10-17T12:42:21Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Christine","id":"37612","full_name":"Markarian, Christine","last_name":"Markarian"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"Algorithmic Aspects of Resource Management in the Cloud","doi":"10.1007/978-3-319-09620-9_1","has_accepted_license":"1","year":"2014","citation":{"ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. LNCS. ; 2014:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13.","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>.","bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>.","short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 1–13). <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>"},"page":"1-13"},{"user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"461","status":"public","type":"bachelorsthesis","title":"Adaptive Placement of Programmable Virtual Network Function Chains","date_created":"2017-10-17T12:42:21Z","author":[{"first_name":"Sevil","id":"31764","full_name":"Dräxler, Sevil","last_name":"Dräxler"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:14Z","citation":{"ieee":"S. Dräxler, <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","chicago":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","ama":"Dräxler S. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn; 2014.","apa":"Dräxler, S. (2014). <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn.","bibtex":"@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }","mla":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","short":"S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014."},"year":"2014"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":993721,"access_level":"closed","file_name":"462-FS2014SIMULTECH.pdf","file_id":"1337","date_updated":"2018-03-16T11:21:24Z","creator":"florida","date_created":"2018-03-16T11:21:24Z"}],"status":"public","abstract":[{"text":"We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)","file_date_updated":"2018-03-16T11:21:24Z","ddc":["040"],"user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"_id":"462","citation":{"ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>. ; 2014:625-630. doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>","ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–630.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 625–30, 2014. <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>.","apa":"Feldotto, M., &#38; Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i> (pp. 625–630). <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>}, booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto, Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }","short":"M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","mla":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–30, doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>."},"page":"625-630","year":"2014","has_accepted_license":"1","doi":"10.5220/0005110406250630","title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games","author":[{"first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"}],"date_created":"2017-10-17T12:42:22Z","date_updated":"2022-01-06T07:01:15Z"},{"ddc":["040"],"publication":"Theory of Computing Systems","file":[{"file_size":947484,"file_name":"464-GJRSST2014.pdf","access_level":"closed","file_id":"1334","date_updated":"2018-03-16T11:19:45Z","creator":"florida","date_created":"2018-03-16T11:19:45Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms where nodes forward, insert, and delete links to neighboring nodes, and that converge quickly to such a desirable topology, independently of the initial network configuration. This article proposes a new model to study the parallel convergence time. Our model sheds light on the achievable parallelism by avoiding bottlenecks of existing models that can yield a distorted picture. As a case study, we consider local graph linearization—i.e., how to build a sorted list of the nodes of a connected graph in a distributed and self-stabilizing manner. In order to study the main structure and properties of our model, we propose two variants of a most simple local linearization algorithm. For each of these variants, we present analyses of the worst-case and bestcase parallel time complexities, as well as the performance under a greedy selection of the actions to be executed. It turns out that the analysis is non-trivial despite the simple setting, and to complement our formal insights we report on our experiments which indicate that the runtimes may be better in the average case."}],"date_created":"2017-10-17T12:42:22Z","publisher":"Springer","title":"A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization","issue":"1","year":"2014","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"464","file_date_updated":"2018-03-16T11:19:45Z","type":"journal_article","status":"public","author":[{"last_name":"Gall","full_name":"Gall, Dominik","first_name":"Dominik"},{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo ","first_name":"Hanjo "}],"date_updated":"2022-01-06T07:01:16Z","doi":"10.1007/s00224-013-9504-x","has_accepted_license":"1","citation":{"ama":"Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>. 2014;(1):110-135. doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” <i>Theory of Computing Systems</i>, no. 1, pp. 110–135, 2014.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo  Täubig. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1 (2014): 110–35. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>.","mla":"Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1, Springer, 2014, pp. 110–35, doi:<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>.","bibtex":"@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9504-x\">10.1007/s00224-013-9504-x</a>}, number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }","short":"D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135.","apa":"Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &#38; Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing Systems</i>, (1), 110–135. <a href=\"https://doi.org/10.1007/s00224-013-9504-x\">https://doi.org/10.1007/s00224-013-9504-x</a>"},"page":"110-135"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"467","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2018-11-02T15:46:17Z","type":"journal_article","status":"public","date_updated":"2022-01-06T07:01:17Z","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"doi":"10.1016/j.future.2014.03.005","has_accepted_license":"1","citation":{"apa":"Künsemöller, J., &#38; Karl, H. (2014). A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>","mla":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, Elsevier, 2014, pp. 44--52, doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>.","short":"J. Künsemöller, H. Karl, Future Generation Computer Systems (2014) 44--52.","bibtex":"@article{Künsemöller_Karl_2014, title={A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>}, journal={Future Generation Computer Systems}, publisher={Elsevier}, author={Künsemöller, Jörn and Karl, Holger}, year={2014}, pages={44--52} }","ieee":"J. Künsemöller and H. Karl, “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service,” <i>Future Generation Computer Systems</i>, pp. 44--52, 2014.","chicago":"Künsemöller, Jörn, and Holger Karl. “A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service.” <i>Future Generation Computer Systems</i>, 2014, 44--52. <a href=\"https://doi.org/10.1016/j.future.2014.03.005\">https://doi.org/10.1016/j.future.2014.03.005</a>.","ama":"Künsemöller J, Karl H. A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service. <i>Future Generation Computer Systems</i>. 2014:44--52. doi:<a href=\"https://doi.org/10.1016/j.future.2014.03.005\">10.1016/j.future.2014.03.005</a>"},"page":"44--52","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Future Generation Computer Systems","abstract":[{"lang":"eng","text":"Financial benefits are an important factor when cloud infrastructure is considered to meet processing demand. The dynamics of on-demand pricing and service usage are investigated in a two-stage game model for a monopoly Infrastructure-as-a-Service (IaaS) market. The possibility of hybrid clouds (public clouds plus own infrastructure) turns out to be essential in order that not only the provider but also the clients have significant benefits from on-demand services. Even if the client meets all demand in the public cloud, the threat of building a hybrid cloud keeps the instance price low. This is not the case when reserved instances are offered as well. Parameters like load profiles and economies of scale have a huge effect on likely future pricing and on a cost-optimal split-up of client demand between either a client’s own data center and a public cloud service or between reserved and on-demand cloud instances."}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5312","file_name":"KünsemöllerKarl.pdf","access_level":"closed","file_size":698992,"date_created":"2018-11-02T15:46:17Z","creator":"ups","date_updated":"2018-11-02T15:46:17Z"}],"publisher":"Elsevier","date_created":"2017-10-17T12:42:23Z","title":"A Game-Theoretic Approach to the Financial Benefits of Infrastructure-as-a-Service","year":"2014"},{"year":"2014","citation":{"ama":"Schwabe A, Karl H. Using MAC addresses as efficient routing labels in data centers. In: <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>. ; 2014:115--120. doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>","ieee":"A. Schwabe and H. Karl, “Using MAC addresses as efficient routing labels in data centers,” in <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120.","chicago":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” In <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 115--120, 2014. <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>.","bibtex":"@inproceedings{Schwabe_Karl_2014, title={Using MAC addresses as efficient routing labels in data centers}, DOI={<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>}, booktitle={Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014}, author={Schwabe, Arne and Karl, Holger}, year={2014}, pages={115--120} }","short":"A. Schwabe, H. Karl, in: Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014, 2014, pp. 115--120.","mla":"Schwabe, Arne, and Holger Karl. “Using MAC Addresses as Efficient Routing Labels in Data Centers.” <i>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i>, 2014, pp. 115--120, doi:<a href=\"https://doi.org/10.1145/2620728.2620730\">10.1145/2620728.2620730</a>.","apa":"Schwabe, A., &#38; Karl, H. (2014). Using MAC addresses as efficient routing labels in data centers. In <i>Proceedings of the third workshop on Hot topics in software defined networking, HotSDN ’14, Chicago, Illinois, USA, August 22, 2014</i> (pp. 115--120). <a href=\"https://doi.org/10.1145/2620728.2620730\">https://doi.org/10.1145/2620728.2620730</a>"},"page":"115--120","has_accepted_license":"1","title":"Using MAC addresses as efficient routing labels in data centers","doi":"10.1145/2620728.2620730","date_updated":"2022-01-06T07:03:41Z","author":[{"last_name":"Schwabe","full_name":"Schwabe, Arne","first_name":"Arne"},{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl"}],"date_created":"2017-11-27T10:22:25Z","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1349578,"access_level":"closed","file_id":"5249","file_name":"p115-schwabe.pdf","date_updated":"2018-11-02T13:32:48Z","creator":"ups","date_created":"2018-11-02T13:32:48Z"}],"status":"public","type":"conference","publication":"Proceedings of the third workshop on Hot topics in software defined networking, HotSDN '14, Chicago, Illinois, USA, August 22, 2014","ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:32:48Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A2","_id":"6"}],"_id":"762","user_id":"477","department":[{"_id":"75"}]},{"citation":{"ama":"Brummel N. <i>On the Relation between Innovation and Competion: The Case of Energy Industry</i>. Universität Paderborn; 2014.","chicago":"Brummel, NinaMadeleine. <i>On the Relation between Innovation and Competion: The Case of Energy Industry</i>. Universität Paderborn, 2014.","ieee":"N. Brummel, <i>On the Relation between Innovation and Competion: The Case of Energy Industry</i>. Universität Paderborn, 2014.","short":"N. Brummel, On the Relation between Innovation and Competion: The Case of Energy Industry, Universität Paderborn, 2014.","bibtex":"@book{Brummel_2014, title={On the Relation between Innovation and Competion: The Case of Energy Industry}, publisher={Universität Paderborn}, author={Brummel, NinaMadeleine}, year={2014} }","mla":"Brummel, NinaMadeleine. <i>On the Relation between Innovation and Competion: The Case of Energy Industry</i>. Universität Paderborn, 2014.","apa":"Brummel, N. (2014). <i>On the Relation between Innovation and Competion: The Case of Energy Industry</i>. Universität Paderborn."},"year":"2014","title":"On the Relation between Innovation and Competion: The Case of Energy Industry","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"first_name":"NinaMadeleine","last_name":"Brummel","full_name":"Brummel, NinaMadeleine"}],"date_created":"2017-10-17T12:42:08Z","date_updated":"2022-01-06T06:59:54Z","publisher":"Universität Paderborn","status":"public","type":"mastersthesis","department":[{"_id":"280"}],"user_id":"42447","_id":"392","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]}]