[{"status":"public","abstract":[{"lang":"eng","text":"Qualitative comparative analysis (QCA) enables researchers in international management to better understand how the impact of a single explanatory factor depends on the context of other factors. But the analytical toolbox of QCA does not include a parameter for the explanatory power of a single explanatory factor or “condition”. In this paper, we therefore reinterpret the Banzhaf power index, originally developed in cooperative game theory, to establish a goodness-of-fit parameter in QCA. The relative Banzhaf index we suggest measures the explanatory power of one condition averaged across all sufficient combinations of conditions. The paper argues that the index is especially informative in three situations that are all salient in international management and call for a context-sensitive analysis of single conditions, namely substantial limited diversity in the data, the emergence of strong INUS conditions in the analysis, and theorizing with contingency factors. The paper derives the properties of the relative Banzhaf index in QCA, demonstrates how the index can be computed easily from a rudimentary truth table, and explores its insights by revisiting selected papers in international management that apply fuzzy-set QCA. It finally suggests a three-step procedure for utilizing the relative Banzhaf index when the causal structure involves both contingency effects and configurational causation.\r\n"}],"publication":"Journal of International Management","type":"journal_article","funded_apc":"1","language":[{"iso":"eng"}],"keyword":["Qualitative comparative analysis","Banzhaf power index","causality","explanatory power"],"article_type":"original","department":[{"_id":"205"},{"_id":"475"},{"_id":"178"},{"_id":"185"}],"user_id":"20801","_id":"34114","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7","grant_number":"160364472"}],"intvolume":"        30","citation":{"short":"C.-J. Haake, M. Schneider, Journal of International Management 30 (2024).","mla":"Haake, Claus-Jochen, and Martin Schneider. “Playing Games with QCA: Measuring the Explanatory Power of Single Conditions with the Banzhaf Index.” <i>Journal of International Management</i>, vol. 30, no. 2, Elsevier, 2024.","bibtex":"@article{Haake_Schneider_2024, title={Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index}, volume={30}, number={2}, journal={Journal of International Management}, publisher={Elsevier}, author={Haake, Claus-Jochen and Schneider, Martin}, year={2024} }","apa":"Haake, C.-J., &#38; Schneider, M. (2024). Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index. <i>Journal of International Management</i>, <i>30</i>(2).","ieee":"C.-J. Haake and M. Schneider, “Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index,” <i>Journal of International Management</i>, vol. 30, no. 2, 2024.","chicago":"Haake, Claus-Jochen, and Martin Schneider. “Playing Games with QCA: Measuring the Explanatory Power of Single Conditions with the Banzhaf Index.” <i>Journal of International Management</i> 30, no. 2 (2024).","ama":"Haake C-J, Schneider M. Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index. <i>Journal of International Management</i>. 2024;30(2)."},"year":"2024","issue":"2","quality_controlled":"1","publication_status":"published","title":"Playing games with QCA: Measuring the explanatory power of single conditions with the Banzhaf index","volume":30,"author":[{"full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake","first_name":"Claus-Jochen"},{"last_name":"Schneider","orcid":"https://orcid.org/0000-0002-6961-3716","id":"471","full_name":"Schneider, Martin","first_name":"Martin"}],"date_created":"2022-11-19T15:33:27Z","publisher":"Elsevier","date_updated":"2024-04-24T12:58:51Z"},{"title":"Weighted school choice problems and the weighted top trading cycles mechanism","date_created":"2024-10-08T11:52:59Z","publisher":"Elsevier BV","year":"2024","language":[{"iso":"eng"}],"ddc":["330"],"keyword":["Matching","School choice","College admission problems","Top trading cycles","Pareto efficiency","Strategy-proofness"],"file":[{"file_id":"56421","file_name":"1-s2.0-S0165489624000817-main.pdf","access_level":"closed","file_size":611017,"date_created":"2024-10-08T11:53:39Z","creator":"nmaraun","date_updated":"2024-10-08T11:53:39Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"There are a number of school choice problems in which students are heterogeneous according to the number of seats they occupy at the school they are assigned to. We propose a weighted school choice problem by assigning each student a so-called weight and formulate the weighted top trading cycles algorithm (WTTC) to find a matching. The WTTC is strategy-proof and results in a Pareto efficient matching. While the WTTC is a robust extension of the TTC when weights are introduced, it is no longer guaranteed that each student gets a seat at a school even if the overall capacity exceeds the sum of weights. Additionally, the WTTC introduces a trade-off between weights and priorities as a student with a higher weight has a disadvantage to be matched to a particular school compared to a student with the same schools’ priorities but a smaller weight."}],"publication":"Mathematical Social Sciences","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0165489624000817?via%3Dihub","open_access":"1"}],"doi":"10.1016/j.mathsocsci.2024.09.001","author":[{"first_name":"Nadja","full_name":"Stroh-Maraun, Nadja","id":"13264","last_name":"Stroh-Maraun"}],"volume":132,"date_updated":"2025-02-28T11:33:48Z","oa":"1","jel":["C78","D47"],"citation":{"apa":"Stroh-Maraun, N. (2024). Weighted school choice problems and the weighted top trading cycles mechanism. <i>Mathematical Social Sciences</i>, <i>132</i>, 49–56. <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">https://doi.org/10.1016/j.mathsocsci.2024.09.001</a>","short":"N. Stroh-Maraun, Mathematical Social Sciences 132 (2024) 49–56.","bibtex":"@article{Stroh-Maraun_2024, title={Weighted school choice problems and the weighted top trading cycles mechanism}, volume={132}, DOI={<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>}, journal={Mathematical Social Sciences}, publisher={Elsevier BV}, author={Stroh-Maraun, Nadja}, year={2024}, pages={49–56} }","mla":"Stroh-Maraun, Nadja. “Weighted School Choice Problems and the Weighted Top Trading Cycles Mechanism.” <i>Mathematical Social Sciences</i>, vol. 132, Elsevier BV, 2024, pp. 49–56, doi:<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>.","ama":"Stroh-Maraun N. Weighted school choice problems and the weighted top trading cycles mechanism. <i>Mathematical Social Sciences</i>. 2024;132:49-56. doi:<a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>","chicago":"Stroh-Maraun, Nadja. “Weighted School Choice Problems and the Weighted Top Trading Cycles Mechanism.” <i>Mathematical Social Sciences</i> 132 (2024): 49–56. <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">https://doi.org/10.1016/j.mathsocsci.2024.09.001</a>.","ieee":"N. Stroh-Maraun, “Weighted school choice problems and the weighted top trading cycles mechanism,” <i>Mathematical Social Sciences</i>, vol. 132, pp. 49–56, 2024, doi: <a href=\"https://doi.org/10.1016/j.mathsocsci.2024.09.001\">10.1016/j.mathsocsci.2024.09.001</a>."},"intvolume":"       132","page":"49-56","publication_status":"published","publication_identifier":{"issn":["0165-4896"]},"has_accepted_license":"1","funded_apc":"1","file_date_updated":"2024-10-08T11:53:39Z","article_type":"original","user_id":"477","department":[{"_id":"200"}],"project":[{"grant_number":"160364472","_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Teilprojekt A3)"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Projektbereich A: Algorithmische und ökonomische Grundlagen für die Organisation großer, dynamischer Märkte","_id":"2"}],"_id":"56420","status":"public","type":"journal_article"},{"type":"journal_article","publication":"MIS Quarterly","status":"public","user_id":"16205","department":[{"_id":"276"}],"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Subproject A4","_id":"8"}],"_id":"35852","language":[{"iso":"eng"}],"issue":"4","publication_status":"published","citation":{"mla":"Neumann, Jürgen, et al. “Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating.” <i>MIS Quarterly</i>, vol. 47, no. 4, 2023, pp. 1709–26.","bibtex":"@article{Neumann_Gutt_Kundisch_2023, title={Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating}, volume={47}, number={4}, journal={MIS Quarterly}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2023}, pages={1709–1726} }","short":"J. Neumann, D. Gutt, D. Kundisch, MIS Quarterly 47 (2023) 1709–1726.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2023). Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating. <i>MIS Quarterly</i>, <i>47</i>(4), 1709–1726.","ama":"Neumann J, Gutt D, Kundisch D. Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating. <i>MIS Quarterly</i>. 2023;47(4):1709-1726.","ieee":"J. Neumann, D. Gutt, and D. Kundisch, “Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating,” <i>MIS Quarterly</i>, vol. 47, no. 4, pp. 1709–1726, 2023.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating.” <i>MIS Quarterly</i> 47, no. 4 (2023): 1709–26."},"page":"1709-1726","intvolume":"        47","year":"2023","author":[{"first_name":"Jürgen","full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann"},{"first_name":"Dominik","last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"date_created":"2023-01-10T13:22:26Z","volume":47,"date_updated":"2023-12-04T10:12:43Z","title":"Reviewing from a Distance: Uncovering Asymmetric Moderations of Spatial and Temporal Distances Between Sentiment Negativity and Rating"},{"_id":"42958","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Subproject A4","_id":"8"}],"user_id":"16205","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2024-02-02T11:08:39Z","author":[{"first_name":"Thomas","last_name":"Krocker","full_name":"Krocker, Thomas"}],"supervisor":[{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"date_created":"2023-03-13T13:19:23Z","title":"Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick","year":"2023","place":"Universität Paderborn","citation":{"apa":"Krocker, T. (2023). <i>Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick</i>.","short":"T. Krocker, Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick, Universität Paderborn, 2023.","bibtex":"@book{Krocker_2023, place={Universität Paderborn}, title={Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick}, author={Krocker, Thomas}, year={2023} }","mla":"Krocker, Thomas. <i>Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick</i>. 2023.","chicago":"Krocker, Thomas. <i>Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2023.","ieee":"T. Krocker, <i>Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2023.","ama":"Krocker T. <i>Der Einfluss von Verkäuferbewertungen auf die Kaufentscheidung - Ein systematischer Literaturüberblick</i>.; 2023."}},{"date_updated":"2024-02-02T11:08:17Z","author":[{"full_name":"Müller, Tobias Sören","last_name":"Müller","first_name":"Tobias Sören"}],"supervisor":[{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"}],"date_created":"2023-02-07T15:15:37Z","title":"Eine empirische Untersuchung von Business-to-Business Online Bewertungen","year":"2023","place":"Universität Paderborn","citation":{"mla":"Müller, Tobias Sören. <i>Eine empirische Untersuchung von Business-to-Business Online Bewertungen</i>. 2023.","short":"T.S. Müller, Eine empirische Untersuchung von Business-to-Business Online Bewertungen, Universität Paderborn, 2023.","bibtex":"@book{Müller_2023, place={Universität Paderborn}, title={Eine empirische Untersuchung von Business-to-Business Online Bewertungen}, author={Müller, Tobias Sören}, year={2023} }","apa":"Müller, T. S. (2023). <i>Eine empirische Untersuchung von Business-to-Business Online Bewertungen</i>.","chicago":"Müller, Tobias Sören. <i>Eine empirische Untersuchung von Business-to-Business Online Bewertungen</i>. Universität Paderborn, 2023.","ieee":"T. S. Müller, <i>Eine empirische Untersuchung von Business-to-Business Online Bewertungen</i>. Universität Paderborn, 2023.","ama":"Müller TS. <i>Eine empirische Untersuchung von Business-to-Business Online Bewertungen</i>.; 2023."},"project":[{"name":"SFB 901: SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4","grant_number":"160364472"}],"_id":"41878","user_id":"16205","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"user_id":"16205","_id":"45367","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4","grant_number":"160364472"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2023-05-30T12:28:36Z","author":[{"full_name":"Okumus, Hasan","last_name":"Okumus","first_name":"Hasan"}],"supervisor":[{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"date_updated":"2024-02-02T11:09:11Z","title":"Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings","citation":{"apa":"Okumus, H. (2023). <i>Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings</i>.","mla":"Okumus, Hasan. <i>Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-Pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings</i>. 2023.","bibtex":"@book{Okumus_2023, title={Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings}, author={Okumus, Hasan}, year={2023} }","short":"H. Okumus, Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-Pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings, 2023.","ama":"Okumus H. <i>Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-Pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings</i>.; 2023.","chicago":"Okumus, Hasan. <i>Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-Pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings</i>, 2023.","ieee":"H. Okumus, <i>Greta’s Gonna Wake Them Up? – An Empirical Analysis of the Im-pact of Greta Thunberg’s Global Climate Strike on Donations for Environmental Charitable Crowdfunding Campaings</i>. 2023."},"year":"2023"},{"language":[{"iso":"eng"}],"_id":"46492","project":[{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - T4: SFB 901 -Subproject T4","_id":"158"},{"grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","_id":"8"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"}],"department":[{"_id":"276"}],"user_id":"16205","status":"public","publication":"Electronic Markets","type":"journal_article","title":"“Sorry, Too Much Information”. Designing Online Review Systems that Support Information Search and Processing","date_updated":"2024-02-29T10:45:36Z","volume":33,"date_created":"2023-08-15T08:59:44Z","author":[{"first_name":"Janina","id":"64464","full_name":"Seutter, Janina","last_name":"Seutter"},{"first_name":"K.","full_name":"Kutzner, K.","last_name":"Kutzner"},{"first_name":"M.","full_name":"Stadtländer, M.","last_name":"Stadtländer"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"},{"full_name":"Knackstedt,  R.","last_name":"Knackstedt","first_name":" R."}],"year":"2023","intvolume":"        33","page":"47","citation":{"bibtex":"@article{Seutter_Kutzner_Stadtländer_Kundisch_Knackstedt_2023, title={“Sorry, Too Much Information”. Designing Online Review Systems that Support Information Search and Processing}, volume={33}, number={1}, journal={Electronic Markets}, author={Seutter, Janina and Kutzner, K. and Stadtländer, M. and Kundisch, Dennis and Knackstedt,  R.}, year={2023}, pages={47} }","short":"J. Seutter, K. Kutzner, M. Stadtländer, D. Kundisch,  R. Knackstedt, Electronic Markets 33 (2023) 47.","mla":"Seutter, Janina, et al. “‘Sorry, Too Much Information’. Designing Online Review Systems That Support Information Search and Processing.” <i>Electronic Markets</i>, vol. 33, no. 1, 2023, p. 47.","apa":"Seutter, J., Kutzner, K., Stadtländer, M., Kundisch, D., &#38; Knackstedt,  R. (2023). “Sorry, Too Much Information”. Designing Online Review Systems that Support Information Search and Processing. <i>Electronic Markets</i>, <i>33</i>(1), 47.","chicago":"Seutter, Janina, K. Kutzner, M. Stadtländer, Dennis Kundisch, and  R. Knackstedt. “‘Sorry, Too Much Information’. Designing Online Review Systems That Support Information Search and Processing.” <i>Electronic Markets</i> 33, no. 1 (2023): 47.","ieee":"J. Seutter, K. Kutzner, M. Stadtländer, D. Kundisch, and  R. Knackstedt, “‘Sorry, Too Much Information’. Designing Online Review Systems that Support Information Search and Processing,” <i>Electronic Markets</i>, vol. 33, no. 1, p. 47, 2023.","ama":"Seutter J, Kutzner K, Stadtländer M, Kundisch D, Knackstedt  R. “Sorry, Too Much Information”. Designing Online Review Systems that Support Information Search and Processing. <i>Electronic Markets</i>. 2023;33(1):47."},"publication_status":"published","issue":"1"},{"volume":412,"author":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"oa":"1","date_updated":"2024-07-12T12:07:59Z","doi":"10.17619/UNIPB/1-1797","has_accepted_license":"1","publication_identifier":{"unknown":["978-3-947647-31-6"]},"page":"247","intvolume":"       412","citation":{"chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>.","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>."},"place":"Paderborn","department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","_id":"45863","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","_id":"7"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","grant_number":"160364472"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"_id":"10","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","grant_number":"160364472"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"grant_number":"160364472","name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","_id":"14","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2","grant_number":"160364472"}],"file_date_updated":"2023-07-05T07:19:14Z","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"type":"book","status":"public","date_created":"2023-07-05T07:16:51Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","year":"2023","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"relation":"main_file","content_type":"application/pdf","file_id":"45864","file_name":"SFB-Buch-Final.pdf","access_level":"open_access","file_size":15480050,"date_created":"2023-07-05T07:15:55Z","creator":"ups","date_updated":"2023-07-05T07:19:14Z"}],"abstract":[{"text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here.","lang":"eng"}]},{"title":"Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells","date_updated":"2023-03-22T08:03:50Z","date_created":"2023-03-22T08:03:35Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"author":[{"first_name":"Michelle","full_name":"Tiessen, Michelle","last_name":"Tiessen"}],"year":"2023","citation":{"apa":"Tiessen, M. (2023). <i>Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells</i>.","bibtex":"@book{Tiessen_2023, title={Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells}, author={Tiessen, Michelle}, year={2023} }","mla":"Tiessen, Michelle. <i>Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells</i>. 2023.","short":"M. Tiessen, Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells, 2023.","ieee":"M. Tiessen, <i>Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells</i>. 2023.","chicago":"Tiessen, Michelle. <i>Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells</i>, 2023.","ama":"Tiessen M. <i>Zur Effektivität des europäischen Kronzeugenprogramms - Der Fall des LKW-Kartells</i>.; 2023."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"43058","user_id":"37953","department":[{"_id":"280"}],"status":"public","type":"bachelorsthesis"},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"43109","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"journal_article","publication":"Theor. Comput. Sci.","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","doi":"10.1016/j.tcs.2023.113756","date_updated":"2023-03-27T09:55:04Z","author":[{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian","first_name":"Julian"}],"date_created":"2023-03-27T07:45:44Z","volume":950,"year":"2023","citation":{"bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>, 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i> 950 (2023): 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>"},"page":"113756","intvolume":"       950"},{"status":"public","abstract":[{"lang":"eng","text":"We study how competition between physicians affects the provision of medical care. In\r\nour theoretical model, physicians are faced with a heterogeneous patient population, in which patients\r\nsystematically vary with regard to both their responsiveness to the provided quality of care and their\r\nstate of health. We test the behavioral predictions derived from this model in a controlled laboratory\r\nexperiment. In line with the model, we observe that competition significantly improves patient benefits\r\nas long as patients are able to respond to the quality provided. For those patients, who are not able\r\nto choose a physician, competition even decreases the patient benefit compared to a situation without\r\ncompetition. This decrease is in contrast to our theoretical prediction implying no change in benefits for\r\npassive patients. Deviations from patient-optimal treatment are highest for passive patients in need of\r\na low quantity of medical services. With repetition, both, the positive effects of competition for active\r\npatients as well as the negative effects of competition for passive patients become more pronounced. Our\r\nresults imply that competition can not only improve but also worsen patient outcome and that patients’\r\nresponsiveness to quality is decisive."}],"type":"journal_article","publication":"Health Economics","language":[{"iso":"eng"}],"article_type":"original","keyword":["physician competition","patient characteristics","heterogeneity in quality responses","fee-for-service","laboratory experiment"],"user_id":"37339","department":[{"_id":"280"},{"_id":"475"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"44092","citation":{"apa":"Brosig-Koch, J., Hehenkamp, B., &#38; Kokot, J. (2023). Who benefits from quality competition in health care? A theory and a laboratory experiment on the relevance of patient characteristics. <i>Health Economics</i>. <a href=\"https://doi.org/10.1002/hec.4689\">https://doi.org/10.1002/hec.4689</a>","mla":"Brosig-Koch, Jeannette, et al. “Who Benefits from Quality Competition in Health Care? A Theory and a Laboratory Experiment on the Relevance of Patient Characteristics.” <i>Health Economics</i>, 2023, doi:<a href=\"https://doi.org/10.1002/hec.4689\">10.1002/hec.4689</a>.","short":"J. Brosig-Koch, B. Hehenkamp, J. Kokot, Health Economics (2023).","bibtex":"@article{Brosig-Koch_Hehenkamp_Kokot_2023, title={Who benefits from quality competition in health care? A theory and a laboratory experiment on the relevance of patient characteristics}, DOI={<a href=\"https://doi.org/10.1002/hec.4689\">10.1002/hec.4689</a>}, journal={Health Economics}, author={Brosig-Koch, Jeannette and Hehenkamp, Burkhard and Kokot, Johanna}, year={2023} }","chicago":"Brosig-Koch, Jeannette, Burkhard Hehenkamp, and Johanna Kokot. “Who Benefits from Quality Competition in Health Care? A Theory and a Laboratory Experiment on the Relevance of Patient Characteristics.” <i>Health Economics</i>, 2023. <a href=\"https://doi.org/10.1002/hec.4689\">https://doi.org/10.1002/hec.4689</a>.","ieee":"J. Brosig-Koch, B. Hehenkamp, and J. Kokot, “Who benefits from quality competition in health care? A theory and a laboratory experiment on the relevance of patient characteristics,” <i>Health Economics</i>, 2023, doi: <a href=\"https://doi.org/10.1002/hec.4689\">10.1002/hec.4689</a>.","ama":"Brosig-Koch J, Hehenkamp B, Kokot J. Who benefits from quality competition in health care? A theory and a laboratory experiment on the relevance of patient characteristics. <i>Health Economics</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1002/hec.4689\">10.1002/hec.4689</a>"},"jel":["I11","D43","C91"],"year":"2023","quality_controlled":"1","doi":"10.1002/hec.4689","title":"Who benefits from quality competition in health care? A theory and a laboratory experiment on the relevance of patient characteristics","author":[{"full_name":"Brosig-Koch, Jeannette","last_name":"Brosig-Koch","first_name":"Jeannette"},{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"},{"first_name":"Johanna","full_name":"Kokot, Johanna","last_name":"Kokot"}],"date_created":"2023-04-20T17:02:41Z","date_updated":"2023-04-20T17:16:14Z"},{"publication_status":"submitted","year":"2023","citation":{"bibtex":"@book{Hehenkamp_Kaarbøe, title={Price Regulation, Quality Competition and Location Choice with Costly Relocation}, author={Hehenkamp, Burkhard and Kaarbøe, Oddvar M.} }","short":"B. Hehenkamp, O.M. Kaarbøe, Price Regulation, Quality Competition and Location Choice with Costly Relocation, n.d.","mla":"Hehenkamp, Burkhard, and Oddvar M. Kaarbøe. <i>Price Regulation, Quality Competition and Location Choice with Costly Relocation</i>.","apa":"Hehenkamp, B., &#38; Kaarbøe, O. M. (n.d.). <i>Price Regulation, Quality Competition and Location Choice with Costly Relocation</i>.","ieee":"B. Hehenkamp and O. M. Kaarbøe, <i>Price Regulation, Quality Competition and Location Choice with Costly Relocation</i>. .","chicago":"Hehenkamp, Burkhard, and Oddvar M. Kaarbøe. <i>Price Regulation, Quality Competition and Location Choice with Costly Relocation</i>, n.d.","ama":"Hehenkamp B, Kaarbøe OM. <i>Price Regulation, Quality Competition and Location Choice with Costly Relocation</i>."},"jel":["D43","L13","L51"],"date_updated":"2023-04-20T17:16:24Z","author":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"},{"first_name":"Oddvar M.","full_name":"Kaarbøe, Oddvar M.","last_name":"Kaarbøe"}],"date_created":"2023-04-20T17:12:18Z","title":"Price Regulation, Quality Competition and Location Choice with Costly Relocation","type":"report","abstract":[{"text":"We consider a model where for-profit providers compete in quality in a price-regulated market that has been opened to competition, and where the incumbent is located at the center of the market, facing high costs of relocation. The model is relevant in markets such as public health care, education and schooling, or postal services. We find that, when the regulated price is low or intermediate, the entrant strategically locates towards the corner of the market to keep the incumbent at the low monopoly quality level. For a high price, the entrant locates at the corner of the market and both providers implement higher quality compared to a monopoly. In any case, the entrant implements higher quality than the incumbent provider. Social welfare is always higher in a duopoly if the cost of quality is low. For higher cost levels welfare is non-monotonic in the price and it can be optimal to the regulator not to use its entire budget. Therefore, the welfare effect of entry depends on the price and the size of the entry cost, and the regulator should condition the decision to allow entry on an assessment of the entry cost.","lang":"eng"}],"status":"public","_id":"44093","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"37339","keyword":["Quality competition","Price regulation","Location choice","Product differentiation"],"language":[{"iso":"eng"}]},{"year":"2023","citation":{"chicago":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>, 2023.","ieee":"J. Schweichhart, <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.","ama":"Schweichhart J. <i>Minimum Edge Cuts in Overlay Networks</i>.; 2023.","short":"J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.","mla":"Schweichhart, Jonas. <i>Minimum Edge Cuts in Overlay Networks</i>. 2023.","bibtex":"@book{Schweichhart_2023, title={Minimum Edge Cuts in Overlay Networks}, author={Schweichhart, Jonas}, year={2023} }","apa":"Schweichhart, J. (2023). <i>Minimum Edge Cuts in Overlay Networks</i>."},"title":"Minimum Edge Cuts in Overlay Networks","date_updated":"2023-05-11T05:51:15Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Jonas","last_name":"Schweichhart","full_name":"Schweichhart, Jonas"}],"date_created":"2023-05-11T05:50:41Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"44735","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"15504"},{"type":"journal_article","publication":"Journal of Wine Economics","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A4: SFB 901 - Subproject A4","_id":"8"}],"_id":"44897","user_id":"18949","language":[{"iso":"eng"}],"publication_status":"inpress","year":"2023","citation":{"short":"D. Kaimann, C.L.M. Spiess Bru, B. Frick, Journal of Wine Economics (n.d.).","bibtex":"@article{Kaimann_Spiess Bru_Frick, title={Ratings Meet Prices: The Dynamic Relationship of Quality Signals}, journal={Journal of Wine Economics}, author={Kaimann, Daniel and Spiess Bru, Clarissa Laura Maria and Frick, Bernd} }","mla":"Kaimann, Daniel, et al. “Ratings Meet Prices: The Dynamic Relationship of Quality Signals.” <i>Journal of Wine Economics</i>.","apa":"Kaimann, D., Spiess Bru, C. L. M., &#38; Frick, B. (n.d.). Ratings Meet Prices: The Dynamic Relationship of Quality Signals. <i>Journal of Wine Economics</i>.","ama":"Kaimann D, Spiess Bru CLM, Frick B. Ratings Meet Prices: The Dynamic Relationship of Quality Signals. <i>Journal of Wine Economics</i>.","ieee":"D. Kaimann, C. L. M. Spiess Bru, and B. Frick, “Ratings Meet Prices: The Dynamic Relationship of Quality Signals,” <i>Journal of Wine Economics</i>.","chicago":"Kaimann, Daniel, Clarissa Laura Maria Spiess Bru, and Bernd Frick. “Ratings Meet Prices: The Dynamic Relationship of Quality Signals.” <i>Journal of Wine Economics</i>, n.d."},"date_updated":"2023-05-16T15:58:09Z","date_created":"2023-05-16T15:52:55Z","author":[{"first_name":"Daniel","id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann"},{"full_name":"Spiess Bru, Clarissa Laura Maria","last_name":"Spiess Bru","first_name":"Clarissa Laura Maria"},{"first_name":"Bernd","id":"16019","full_name":"Frick, Bernd","last_name":"Frick"}],"title":"Ratings Meet Prices: The Dynamic Relationship of Quality Signals"},{"citation":{"ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>","chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>.","ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","mla":"Werthmann, Julian, et al. <i>Routing Schemes for Hybrid Communication Networks</i>. 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &#38; Schneider, P. (2023). <i>Routing Schemes for Hybrid Communication Networks</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>"},"year":"2023","doi":"10.48550/ARXIV.2210.05333","title":"Routing Schemes for Hybrid Communication Networks","date_created":"2023-05-22T09:17:50Z","author":[{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Coy","full_name":"Coy, Sam","first_name":"Sam"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"}],"date_updated":"2023-05-22T09:37:25Z","status":"public","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"50024","_id":"45188","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}]},{"status":"public","publication":"Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"276"}],"user_id":"477","_id":"43027","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A4: SFB 901 - Subproject A4","_id":"8"}],"citation":{"ama":"Seutter J, Bartelheimer C, Kundisch D. Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments. In: <i>Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology</i>.","chicago":"Seutter, Janina, Christian Bartelheimer, and Dennis Kundisch. “Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments.” In <i>Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology</i>, n.d.","ieee":"J. Seutter, C. Bartelheimer, and D. Kundisch, “Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments,” presented at the 18th International Conference on Design Science Research in Information Systems and Technology (DESRIST), Pretoria, South Africa.","bibtex":"@inproceedings{Seutter_Bartelheimer_Kundisch, title={Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments}, booktitle={Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology}, author={Seutter, Janina and Bartelheimer, Christian and Kundisch, Dennis} }","mla":"Seutter, Janina, et al. “Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments.” <i>Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology</i>.","short":"J. Seutter, C. Bartelheimer, D. Kundisch, in: Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology, n.d.","apa":"Seutter, J., Bartelheimer, C., &#38; Kundisch, D. (n.d.). Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments. <i>Proceedings of the 18th International Conference on Design Science Research in Information Systems and Technology</i>. 18th International Conference on Design Science Research in Information Systems and Technology (DESRIST), Pretoria, South Africa."},"year":"2023","publication_status":"accepted","conference":{"name":"18th International Conference on Design Science Research in Information Systems and Technology (DESRIST)","location":"Pretoria, South Africa"},"title":"Supporting Innovation through B2B Reviews – A Taxonomy of B2B Online Review Environments","date_created":"2023-03-15T13:33:55Z","author":[{"last_name":"Seutter","full_name":"Seutter, Janina","id":"64464","first_name":"Janina"},{"first_name":"Christian","last_name":"Bartelheimer","id":"49160","full_name":"Bartelheimer, Christian"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"date_updated":"2023-05-23T12:42:12Z"},{"user_id":"477","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"45192","language":[{"iso":"eng"}],"type":"journal_article","publication":"Distributed Computing","status":"public","date_created":"2023-05-22T14:34:34Z","author":[{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"date_updated":"2023-05-23T12:38:57Z","doi":"https://doi.org/10.1007/s00446-023-00442-4","title":"Time-Optimal Construction of Overlays","citation":{"apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (2023). Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).","bibtex":"@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023, doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” <i>Distributed Computing</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>."},"year":"2023"},{"_id":"40063","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4"}],"department":[{"_id":"276"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"Proceedings of the 45th ISMS Marketing Science Conference","type":"conference","status":"public","date_updated":"2023-05-23T12:49:02Z","author":[{"first_name":"Wael","full_name":"Jabr, Wael","last_name":"Jabr"},{"last_name":"Gutt","full_name":"Gutt, Dominik","first_name":"Dominik"},{"full_name":"Neumann, Jürgen","last_name":"Neumann","first_name":"Jürgen"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2023-01-25T15:33:08Z","title":"Updating at the Expense of Demand? The Case of Platform Apps","conference":{"location":"Miami, USA","name":"45th ISMS Marketing Science Conference"},"publication_status":"accepted","year":"2023","citation":{"ama":"Jabr W, Gutt D, Neumann J, Kundisch D. Updating at the Expense of Demand? The Case of Platform Apps. In: <i>Proceedings of the 45th ISMS Marketing Science Conference</i>.","ieee":"W. Jabr, D. Gutt, J. Neumann, and D. Kundisch, “Updating at the Expense of Demand? The Case of Platform Apps,” presented at the 45th ISMS Marketing Science Conference, Miami, USA.","chicago":"Jabr, Wael, Dominik Gutt, Jürgen Neumann, and Dennis Kundisch. “Updating at the Expense of Demand? The Case of Platform Apps.” In <i>Proceedings of the 45th ISMS Marketing Science Conference</i>, n.d.","apa":"Jabr, W., Gutt, D., Neumann, J., &#38; Kundisch, D. (n.d.). Updating at the Expense of Demand? The Case of Platform Apps. <i>Proceedings of the 45th ISMS Marketing Science Conference</i>. 45th ISMS Marketing Science Conference, Miami, USA.","bibtex":"@inproceedings{Jabr_Gutt_Neumann_Kundisch, title={Updating at the Expense of Demand? The Case of Platform Apps}, booktitle={Proceedings of the 45th ISMS Marketing Science Conference}, author={Jabr, Wael and Gutt, Dominik and Neumann, Jürgen and Kundisch, Dennis} }","short":"W. Jabr, D. Gutt, J. Neumann, D. Kundisch, in: Proceedings of the 45th ISMS Marketing Science Conference, n.d.","mla":"Jabr, Wael, et al. “Updating at the Expense of Demand? The Case of Platform Apps.” <i>Proceedings of the 45th ISMS Marketing Science Conference</i>."}},{"project":[{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"_id":"45580","user_id":"38705","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2023-06-13T07:43:11Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"}],"date_created":"2023-06-12T13:06:58Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Local Protocols for Contracting and Expanding Robot Formation Problems","doi":"10.17619/UNIPB/1-1750","year":"2023","citation":{"short":"J. Castenow, Local Protocols for Contracting and Expanding Robot Formation Problems, 2023.","bibtex":"@book{Castenow_2023, title={Local Protocols for Contracting and Expanding Robot Formation Problems}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>}, author={Castenow, Jannik}, year={2023} }","mla":"Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>.","apa":"Castenow, J. (2023). <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1750\">https://doi.org/10.17619/UNIPB/1-1750</a>","ama":"Castenow J. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1750\">10.17619/UNIPB/1-1750</a>","chicago":"Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1750\">https://doi.org/10.17619/UNIPB/1-1750</a>.","ieee":"J. Castenow, <i>Local Protocols for Contracting and Expanding Robot Formation Problems</i>. 2023."}},{"type":"dissertation","status":"public","_id":"45579","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"department":[{"_id":"63"}],"user_id":"39241","language":[{"iso":"eng"}],"year":"2023","citation":{"mla":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>.","short":"T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.","bibtex":"@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous Resources}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>}, author={Knollmann, Till}, year={2023} }","apa":"Knollmann, T. (2023). <i>Online Algorithms for Allocating Heterogeneous Resources</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>","chicago":"Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1751\">https://doi.org/10.17619/UNIPB/1-1751</a>.","ieee":"T. Knollmann, <i>Online Algorithms for Allocating Heterogeneous Resources</i>. 2023.","ama":"Knollmann T. <i>Online Algorithms for Allocating Heterogeneous Resources</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1751\">10.17619/UNIPB/1-1751</a>"},"date_updated":"2023-06-12T21:03:14Z","author":[{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"}],"supervisor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2023-06-12T13:05:04Z","title":"Online Algorithms for Allocating Heterogeneous Resources","doi":"10.17619/UNIPB/1-1751"}]