[{"title":"Conditional Value-at-Risk: Structure and Complexity of Equilibria","date_created":"2018-03-23T13:58:02Z","year":"2017","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T14:53:56Z","date_updated":"2018-11-02T14:53:56Z","access_level":"closed","file_id":"5287","file_name":"ConditionalValue-at-RiskStruct.pdf","file_size":352365}],"abstract":[{"lang":"eng","text":"Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain; α∈(0,1) is the confidence level. In this work, we study the strategic equilibria for an economic system modeled as a game, where risk-averse players seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value property: For any best-response of a player, each mixed strategy in the support gives the same cost to the player. This follows directly from the concavity of CVaRα in the involved probabilities, which we establish. (2) The Crawford property: For every α, there is a 2-player game with no CVaRα-equilibrium. The property is established using the Optimal-Value property and a new functional property of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties, we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium is strongly NP-hard even for 2-player games. As our other main result, we show the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player games, for any valuation V with the Optimal-Value and the Crawford properties. This result has a rich potential since we prove that the very significant and broad class of strictly quasiconcave valuations has the Optimal-Value property."}],"publication":"Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)","doi":"10.1007/978-3-319-66700-3_11","conference":{"start_date":"2017-09-12","name":"10th International Symposium on Algorithmic Game Theory (SAGT 2017)","location":"L'Aquila, Italy","end_date":"2017-09-14"},"volume":10504,"author":[{"first_name":"Marios","last_name":"Mavronicolas","full_name":"Mavronicolas, Marios"},{"first_name":"Burkhard","full_name":"Monien, Burkhard","last_name":"Monien"}],"date_updated":"2022-01-06T06:53:16Z","page":"131--143","intvolume":"     10504","citation":{"apa":"Mavronicolas, M., &#38; Monien, B. (2017). Conditional Value-at-Risk: Structure and Complexity of Equilibria. In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i> (Vol. 10504, pp. 131--143). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>","bibtex":"@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>}, booktitle={Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017}, pages={131--143}, collection={LNCS} }","mla":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, vol. 10504, 2017, pp. 131--143, doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>.","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143.","ama":"Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity of Equilibria. In: <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>. Vol 10504. LNCS. ; 2017:131--143. doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>","ieee":"M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and Complexity of Equilibria,” in <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, L’Aquila, Italy, 2017, vol. 10504, pp. 131--143.","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, 10504:131--143. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>."},"has_accepted_license":"1","file_date_updated":"2018-11-02T14:53:56Z","department":[{"_id":"7"}],"user_id":"477","series_title":"LNCS","_id":"1767","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"conference"},{"year":"2017","citation":{"ama":"Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn; 2017.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michél }, year={2017} }","short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","mla":"Burkhardt, Michél. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","date_created":"2020-08-18T08:39:19Z","author":[{"last_name":"Burkhardt","full_name":"Burkhardt, Michél ","first_name":"Michél "}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"Untersuchungen zum Cone-Hashing","type":"bachelorsthesis","status":"public","_id":"18026","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}]},{"year":"2017","citation":{"short":"A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.","mla":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn.","chicago":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","ieee":"A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","ama":"Schenk A. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn; 2017."},"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2020-08-18T08:41:42Z","author":[{"first_name":"Andreas","full_name":"Schenk, Andreas","last_name":"Schenk"}],"title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","type":"bachelorsthesis","status":"public","_id":"18028","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","language":[{"iso":"eng"}]},{"author":[{"full_name":"Beckendorf, Björn","last_name":"Beckendorf","first_name":"Björn"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-18T08:42:36Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","citation":{"apa":"Beckendorf, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","mla":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","ama":"Beckendorf B. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn; 2017.","ieee":"B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","chicago":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017."},"year":"2017","department":[{"_id":"79"}],"user_id":"477","_id":"18029","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"title":"Constitutions and groups","date_created":"2018-04-09T09:25:05Z","publisher":"Elsevier","year":"2017","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5122","file_name":"Constitutions and groups.pdf","file_size":577360,"creator":"stela","date_created":"2018-10-31T08:21:31Z","date_updated":"2018-10-31T08:21:31Z"}],"publication":"Games and Economic Behavior","doi":"10.1016/j.geb.2017.10.022","author":[{"full_name":"Mauleon, Ana","last_name":"Mauleon","first_name":"Ana"},{"full_name":"Roehl, Nils","last_name":"Roehl","first_name":"Nils"},{"first_name":"Vincent","full_name":"Vannetelbosch, Vincent","last_name":"Vannetelbosch"}],"volume":107,"date_updated":"2022-01-06T06:55:38Z","citation":{"ieee":"A. Mauleon, N. Roehl, and V. Vannetelbosch, “Constitutions and groups,” <i>Games and Economic Behavior</i>, vol. 107, pp. 135–152, 2017.","chicago":"Mauleon, Ana, Nils Roehl, and Vincent Vannetelbosch. “Constitutions and Groups.” <i>Games and Economic Behavior</i> 107 (2017): 135–52. <a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">https://doi.org/10.1016/j.geb.2017.10.022</a>.","ama":"Mauleon A, Roehl N, Vannetelbosch V. Constitutions and groups. <i>Games and Economic Behavior</i>. 2017;107:135-152. doi:<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>","mla":"Mauleon, Ana, et al. “Constitutions and Groups.” <i>Games and Economic Behavior</i>, vol. 107, Elsevier, 2017, pp. 135–52, doi:<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>.","short":"A. Mauleon, N. Roehl, V. Vannetelbosch, Games and Economic Behavior 107 (2017) 135–152.","bibtex":"@article{Mauleon_Roehl_Vannetelbosch_2017, title={Constitutions and groups}, volume={107}, DOI={<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>}, journal={Games and Economic Behavior}, publisher={Elsevier}, author={Mauleon, Ana and Roehl, Nils and Vannetelbosch, Vincent}, year={2017}, pages={135–152} }","apa":"Mauleon, A., Roehl, N., &#38; Vannetelbosch, V. (2017). Constitutions and groups. <i>Games and Economic Behavior</i>, <i>107</i>, 135–152. <a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">https://doi.org/10.1016/j.geb.2017.10.022</a>"},"page":"135-152","intvolume":"       107","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0899-8256"]},"file_date_updated":"2018-10-31T08:21:31Z","user_id":"65453","department":[{"_id":"204"},{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"2269","status":"public","type":"journal_article"},{"_id":"2272","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"19"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:55:39Z","date_created":"2018-04-10T09:59:38Z","author":[{"last_name":"Golke","full_name":"Golke, Vanessa","first_name":"Vanessa"}],"title":"Signaling und Screening - Abbau von Informationsasymmetrie","year":"2017","citation":{"chicago":"Golke, Vanessa. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","ieee":"V. Golke, <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","ama":"Golke V. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn; 2017.","bibtex":"@book{Golke_2017, title={Signaling und Screening - Abbau von Informationsasymmetrie}, publisher={Universität Paderborn}, author={Golke, Vanessa}, year={2017} }","mla":"Golke, Vanessa. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","short":"V. Golke, Signaling und Screening - Abbau von Informationsasymmetrie, Universität Paderborn, 2017.","apa":"Golke, V. (2017). <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"19"}],"user_id":"477","_id":"2273","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"ama":"Moselage L. <i>Das Reputationssystem als bedeutendes Instrument digitaler Märkte</i>. Universität Paderborn; 2017.","ieee":"L. Moselage, <i>Das Reputationssystem als bedeutendes Instrument digitaler Märkte</i>. Universität Paderborn, 2017.","chicago":"Moselage, Laura. <i>Das Reputationssystem als bedeutendes Instrument digitaler Märkte</i>. Universität Paderborn, 2017.","bibtex":"@book{Moselage_2017, title={Das Reputationssystem als bedeutendes Instrument digitaler Märkte}, publisher={Universität Paderborn}, author={Moselage, Laura}, year={2017} }","mla":"Moselage, Laura. <i>Das Reputationssystem als bedeutendes Instrument digitaler Märkte</i>. Universität Paderborn, 2017.","short":"L. Moselage, Das Reputationssystem als bedeutendes Instrument digitaler Märkte, Universität Paderborn, 2017.","apa":"Moselage, L. (2017). <i>Das Reputationssystem als bedeutendes Instrument digitaler Märkte</i>. Universität Paderborn."},"year":"2017","title":"Das Reputationssystem als bedeutendes Instrument digitaler Märkte","date_created":"2018-04-10T10:01:16Z","author":[{"first_name":"Laura","full_name":"Moselage, Laura","last_name":"Moselage"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:55:39Z"},{"type":"bachelorsthesis","status":"public","_id":"2274","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"19"}],"user_id":"477","language":[{"iso":"ger"}],"year":"2017","citation":{"ama":"Hennawi MZ. <i>Der Preis als Qualitätssignal</i>. Universität Paderborn; 2017.","chicago":"Hennawi, Mohammad Ziad. <i>Der Preis als Qualitätssignal</i>. Universität Paderborn, 2017.","ieee":"M. Z. Hennawi, <i>Der Preis als Qualitätssignal</i>. Universität Paderborn, 2017.","apa":"Hennawi, M. Z. (2017). <i>Der Preis als Qualitätssignal</i>. Universität Paderborn.","short":"M.Z. Hennawi, Der Preis als Qualitätssignal, Universität Paderborn, 2017.","bibtex":"@book{Hennawi_2017, title={Der Preis als Qualitätssignal}, publisher={Universität Paderborn}, author={Hennawi, Mohammad Ziad}, year={2017} }","mla":"Hennawi, Mohammad Ziad. <i>Der Preis als Qualitätssignal</i>. Universität Paderborn, 2017."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:55:39Z","date_created":"2018-04-10T10:52:19Z","author":[{"first_name":"Mohammad Ziad","full_name":"Hennawi, Mohammad Ziad","last_name":"Hennawi"}],"title":"Der Preis als Qualitätssignal"},{"title":"MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained","date_updated":"2022-01-06T07:03:50Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:07Z","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"year":"2017","citation":{"bibtex":"@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2017} }","short":"L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.","mla":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","apa":"Luo, L. (2017). <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn.","ama":"Luo L. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn; 2017.","chicago":"Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.","ieee":"L. Luo, <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained</i>. Universität Paderborn, 2017."},"language":[{"iso":"eng"}],"_id":"81","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","status":"public","type":"mastersthesis"},{"doi":"10.1007/978-3-319-59605-1_13","title":"Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N."},{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"last_name":"Markarian","full_name":"Markarian, Christine","id":"37612","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"date_created":"2017-10-17T12:41:07Z","date_updated":"2022-01-06T07:03:52Z","page":"139-150","citation":{"ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In: <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>. LNCS. ; 2017:139-150. doi:<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,” in <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 2017, pp. 139–150.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” In <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 139–50. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">https://doi.org/10.1007/978-3-319-59605-1_13</a>.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. In <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i> (pp. 139–150). <a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">https://doi.org/10.1007/978-3-319-59605-1_13</a>","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW), 2017, pp. 139–150.","mla":"Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.” <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>, 2017, pp. 139–50, doi:<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017, series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-59605-1_13\">10.1007/978-3-319-59605-1_13</a>}, booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150}, collection={LNCS} }"},"year":"2017","has_accepted_license":"1","file_date_updated":"2018-11-02T15:07:35Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"63"}],"user_id":"477","series_title":"LNCS","_id":"82","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:07:35Z","creator":"ups","date_created":"2018-11-02T15:07:35Z","file_size":238276,"file_id":"5294","access_level":"closed","file_name":"Modular-WidthAnAuxiliaryParame.pdf"}],"abstract":[{"lang":"eng","text":"Many graph problems such as maximum cut, chromatic number, hamiltonian cycle, and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized by the treewidth of the input graphs, but become W-hard with respect to the clique-width parameter. Recently, Gajarský et al. proposed a new parameter called modular-width using the notion of modular decomposition of graphs. They showed that the chromatic number problem and the partitioning into paths problem, and hence hamiltonian path and hamiltonian cycle, are FPT when parameterized by this parameter. In this paper, we study modular-width in parameterized parallel complexity and show that the weighted maximum clique problem and the maximum matching problem are fixed-parameter parallel-tractable (FPPT) when parameterized by this parameter."}],"publication":"Proceedings of the 11th International Workshop on Frontiers in Algorithmics (FAW)","type":"conference"},{"citation":{"bibtex":"@book{Uden_2017, title={Microsoft vs. the EU Commission - An analysis on product bundeling}, publisher={Universität Paderborn}, author={Uden, Dennis}, year={2017} }","short":"D. Uden, Microsoft vs. the EU Commission - An Analysis on Product Bundeling, Universität Paderborn, 2017.","mla":"Uden, Dennis. <i>Microsoft vs. the EU Commission - An Analysis on Product Bundeling</i>. Universität Paderborn, 2017.","apa":"Uden, D. (2017). <i>Microsoft vs. the EU Commission - An analysis on product bundeling</i>. Universität Paderborn.","ama":"Uden D. <i>Microsoft vs. the EU Commission - An Analysis on Product Bundeling</i>. Universität Paderborn; 2017.","chicago":"Uden, Dennis. <i>Microsoft vs. the EU Commission - An Analysis on Product Bundeling</i>. Universität Paderborn, 2017.","ieee":"D. Uden, <i>Microsoft vs. the EU Commission - An analysis on product bundeling</i>. Universität Paderborn, 2017."},"year":"2017","author":[{"full_name":"Uden, Dennis","last_name":"Uden","first_name":"Dennis"}],"date_created":"2017-10-17T12:41:07Z","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:53Z","title":"Microsoft vs. the EU Commission - An analysis on product bundeling","type":"bachelorsthesis","status":"public","user_id":"42447","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"83"},{"title":"Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource","doi":"10.1145/3087556.3087578","date_updated":"2022-01-06T07:02:46Z","author":[{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker","first_name":"Alexander"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_created":"2017-10-17T12:41:02Z","year":"2017","page":"123--132","citation":{"bibtex":"@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }","mla":"Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>.","short":"P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132.","apa":"Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 123--132). <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>","chicago":"Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 123--132, 2017. <a href=\"https://doi.org/10.1145/3087556.3087578\">https://doi.org/10.1145/3087556.3087578</a>.","ieee":"P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.","ama":"Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a href=\"https://doi.org/10.1145/3087556.3087578\">10.1145/3087556.3087578</a>"},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-21T13:17:33Z","language":[{"iso":"eng"}],"_id":"59","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","abstract":[{"lang":"eng","text":"We consider a scheduling problem on $m$ identical processors sharing an arbitrarily divisible resource. In addition to assigning jobs to processors, the scheduler must distribute the resource among the processors (e.g., for three processors in shares of 20\\%, 15\\%, and 65\\%) and adjust this distribution over time. Each job $j$ comes with a size $p_j \\in \\mathbb{R}$ and a resource requirement $r_j > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource. But providing them with a fraction of the resource requirement causes a linear decrease in the processing efficiency. We seek a (non-preemptive) job and resource assignment minimizing the makespan.Our main result is an efficient approximation algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms also imply new results for a well-known bin packing problem with splittable items and a restricted number of allowed item parts per bin.Based upon the above solution, we also derive an approximation algorithm with similar guarantees for a setting in which we introduce so-called tasks each containing several jobs and where we are interested in the average completion time of tasks (a task is completed when all its jobs are completed)."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T13:17:33Z","date_updated":"2018-03-21T13:17:33Z","file_id":"1578","file_name":"59-progress.pdf","access_level":"closed","file_size":784867}],"publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference"},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5946","user_id":"65453","department":[{"_id":"205"}],"language":[{"iso":"eng"}],"year":"2017","citation":{"ama":"Kühn S. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>. Universität Paderborn; 2017.","chicago":"Kühn, Sarah. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>. Universität Paderborn, 2017.","ieee":"S. Kühn, <i>Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse</i>. Universität Paderborn, 2017.","bibtex":"@book{Kühn_2017, title={Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse}, publisher={Universität Paderborn}, author={Kühn, Sarah}, year={2017} }","short":"S. Kühn, Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse, Universität Paderborn, 2017.","mla":"Kühn, Sarah. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>. Universität Paderborn, 2017.","apa":"Kühn, S. (2017). <i>Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse</i>. Universität Paderborn."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:48Z","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2018-11-28T10:55:45Z","author":[{"last_name":"Kühn","full_name":"Kühn, Sarah","first_name":"Sarah"}],"title":"Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse"},{"year":"2017","citation":{"apa":"Gunning, J. (2017). <i>Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische Analyse</i>. Universität Paderborn.","bibtex":"@book{Gunning_2017, title={Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische Analyse}, publisher={Universität Paderborn}, author={Gunning, Justine}, year={2017} }","short":"J. Gunning, Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten - Eine Mikroökonomische Analyse, Universität Paderborn, 2017.","mla":"Gunning, Justine. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten - Eine Mikroökonomische Analyse</i>. Universität Paderborn, 2017.","ieee":"J. Gunning, <i>Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische Analyse</i>. Universität Paderborn, 2017.","chicago":"Gunning, Justine. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten - Eine Mikroökonomische Analyse</i>. Universität Paderborn, 2017.","ama":"Gunning J. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten - Eine Mikroökonomische Analyse</i>. Universität Paderborn; 2017."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:48Z","date_created":"2018-11-28T11:29:03Z","supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"author":[{"first_name":"Justine","full_name":"Gunning, Justine","last_name":"Gunning"}],"title":"Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische Analyse","type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5950","user_id":"65453","department":[{"_id":"205"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"7"},{"_id":"79"}],"user_id":"477","_id":"5980","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","editor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Taghi Hajiaghayi, Mohammad","last_name":"Taghi Hajiaghayi","first_name":"Mohammad"}],"type":"conference_editor","doi":"10.1145/3087556","title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","date_created":"2018-11-29T10:23:12Z","date_updated":"2022-01-06T07:02:48Z","publisher":"ACM","citation":{"chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>.","ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>","apa":"Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM. <a href=\"https://doi.org/10.1145/3087556\">https://doi.org/10.1145/3087556</a>","bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>}, publisher={ACM}, year={2017} }","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3087556\">10.1145/3087556</a>.","short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, ACM, 2017."},"year":"2017","publication_identifier":{"isbn":["978-1-4503-4593-4"]}},{"type":"dissertation","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"61","language":[{"iso":"eng"}],"citation":{"mla":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>.","bibtex":"@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }","short":"T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017.","apa":"Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>","ieee":"T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017.","chicago":"Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-150\">https://doi.org/10.17619/UNIPB/1-150</a>.","ama":"Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-150\">10.17619/UNIPB/1-150</a>"},"year":"2017","date_created":"2017-10-17T12:41:03Z","author":[{"last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:52Z","doi":"10.17619/UNIPB/1-150","title":"Self-* Algorithms for Distributed Systems"},{"abstract":[{"lang":"eng","text":"The importance of online ratings on sales is widely acknowledged. Firms need to find ways of increasing the number of ratings and rating scores, but how they can achieve this effectively is less well established. In this paper we analyze the impact of an unconditional gift on customers’ rating behavior in an online field experiment. Contrary to prevalent advice, our results suggest that providing a gift is not necessarily beneficial. Younger customers are significantly less likely to rate when exposed to an unconditional gift. Regression analysis reveals that age serves as a moderator and older customers even respond slightly positive to a gift. Having detected a negative effect of gifts on rating behavior provides first indicative evidence of a possible crowding out of intrinsic motivation in the context of online ratings. This has direct implications for practitioners considering the usage of gifts to elicit online ratings."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1582","file_name":"45-You_cant_buy_my_rating__On_the_pivotal_effect_of_an_unconditiona.pdf","access_level":"closed","file_size":1446372,"creator":"florida","date_created":"2018-03-21T13:20:05Z","date_updated":"2018-03-21T13:20:05Z"}],"publication":"Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland","type":"conference","ddc":["040"],"file_date_updated":"2018-03-21T13:20:05Z","_id":"45","project":[{"_id":"1","name":"SFB 901"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"276"}],"user_id":"477","year":"2017","citation":{"bibtex":"@inproceedings{Gutt_Schlangenotto_Kundisch_2017, title={You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior}, booktitle={Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland}, author={Gutt, Dominik and Schlangenotto, Darius and Kundisch, Dennis}, year={2017} }","short":"D. Gutt, D. Schlangenotto, D. Kundisch, in: Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland, 2017.","mla":"Gutt, Dominik, et al. “You Can’t Buy My Rating! On the Pivotal Effect of an Unconditional Gift on Rating Behavior.” <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>, 2017.","apa":"Gutt, D., Schlangenotto, D., &#38; Kundisch, D. (2017). You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior. In <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>.","chicago":"Gutt, Dominik, Darius Schlangenotto, and Dennis Kundisch. “You Can’t Buy My Rating! On the Pivotal Effect of an Unconditional Gift on Rating Behavior.” In <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>, 2017.","ieee":"D. Gutt, D. Schlangenotto, and D. Kundisch, “You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior,” in <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>, 2017.","ama":"Gutt D, Schlangenotto D, Kundisch D. You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior. In: <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>. ; 2017."},"has_accepted_license":"1","title":"You can’t buy my rating! On the pivotal effect of an unconditional gift on rating behavior","date_updated":"2022-01-06T07:01:07Z","date_created":"2017-10-17T12:40:59Z","author":[{"last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368","first_name":"Dominik"},{"first_name":"Darius","last_name":"Schlangenotto","full_name":"Schlangenotto, Darius"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"}]},{"supervisor":[{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"}],"author":[{"first_name":"Anica","full_name":"Rose, Anica","last_name":"Rose"}],"date_created":"2018-10-12T06:31:07Z","date_updated":"2022-01-06T07:01:18Z","publisher":"Universität Paderborn","title":"The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field","has_accepted_license":"1","citation":{"chicago":"Rose, Anica. <i>The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field</i>. Universität Paderborn, 2017.","ieee":"A. Rose, <i>The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field</i>. Universität Paderborn, 2017.","ama":"Rose A. <i>The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field</i>. Universität Paderborn; 2017.","apa":"Rose, A. (2017). <i>The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field</i>. Universität Paderborn.","mla":"Rose, Anica. <i>The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field</i>. Universität Paderborn, 2017.","bibtex":"@book{Rose_2017, title={The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field}, publisher={Universität Paderborn}, author={Rose, Anica}, year={2017} }","short":"A. Rose, The Performance of Individuals, Teams, and Organizations: Empirical Evidence from the Field, Universität Paderborn, 2017."},"year":"2017","user_id":"477","department":[{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"4674","language":[{"iso":"eng"}],"file_date_updated":"2018-10-12T06:28:46Z","ddc":["040"],"type":"dissertation","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1907117,"file_id":"4675","access_level":"closed","file_name":"Dissertation_Anica Rose.pdf","date_updated":"2018-10-12T06:28:46Z","date_created":"2018-10-12T06:28:46Z","creator":"florida"}],"status":"public"},{"editor":[{"first_name":"Sandra","last_name":"Hannappel","full_name":"Hannappel, Sandra"},{"first_name":"Rebekka","last_name":"Rehm","full_name":"Rehm, Rebekka"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:19:30Z","date_created":"2018-03-21T13:19:30Z","creator":"florida","file_size":18583012,"file_name":"48-Digitale_Oekonomie_2017.pdf","file_id":"1581","access_level":"closed"}],"publication":"Digitale Ökonomie - Wie verändern sich die Märkte?","type":"book_chapter","ddc":["040"],"file_date_updated":"2018-03-21T13:19:30Z","language":[{"iso":"ger"}],"_id":"48","project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"276"}],"user_id":"477","year":"2017","citation":{"chicago":"Kundisch, Dennis, and Dominik Gutt. “Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen.” In <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>, edited by Sandra Hannappel and Rebekka Rehm, 2017.","ieee":"D. Kundisch and D. Gutt, “Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen,” in <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>, S. Hannappel and R. Rehm, Eds. 2017.","ama":"Kundisch D, Gutt D. Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen. In: Hannappel S, Rehm R, eds. <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>. ; 2017.","apa":"Kundisch, D., &#38; Gutt, D. (2017). Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen. In S. Hannappel &#38; R. Rehm (Eds.), <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>","bibtex":"@inbook{Kundisch_Gutt_2017, title={Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen}, booktitle={Digitale Ökonomie - Wie verändern sich die Märkte?}, author={Kundisch, Dennis and Gutt, Dominik}, editor={Hannappel, Sandra and Rehm, RebekkaEditors}, year={2017} }","short":"D. Kundisch, D. Gutt, in: S. Hannappel, R. Rehm (Eds.), Digitale Ökonomie - Wie verändern sich die Märkte?, 2017.","mla":"Kundisch, Dennis, and Dominik Gutt. “Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen.” <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>, edited by Sandra Hannappel and Rebekka Rehm, 2017."},"has_accepted_license":"1","title":"Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische Grundlagen","date_updated":"2022-01-06T07:01:24Z","author":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"},{"full_name":"Gutt, Dominik","id":"14368","last_name":"Gutt","first_name":"Dominik"}],"date_created":"2017-10-17T12:41:00Z"},{"date_created":"2017-11-14T08:03:45Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705","first_name":"Jannik"}],"date_updated":"2022-01-06T07:03:25Z","publisher":"Universität Paderborn","title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions","citation":{"mla":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }","short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","apa":"Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.","chicago":"Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ieee":"J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.","ama":"Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017."},"year":"2017","department":[{"_id":"79"}],"user_id":"38705","_id":"699","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"}]