@techreport{45666,
  author       = {{Frick, Bernd and Spiess Bru, Clarissa and Kaimann, Daniel}},
  publisher    = {{Paderborn University, Faculty of Business Administration and Economics}},
  title        = {{{Are Women (Really) More Lenient? Gender Differences in Expert Evaluations}}},
  volume       = {{106}},
  year         = {{2023}},
}

@techreport{45665,
  author       = {{Kaimann, Daniel and Spiess Bru, Clarissa}},
  publisher    = {{Paderborn University, Faculty of Business Administration and Economics}},
  title        = {{{Sounds too Feminine? Brand Gender and The Impact on Professional Critics}}},
  volume       = {{107}},
  year         = {{2023}},
}

@phdthesis{45669,
  author       = {{Beck-Werz, Lisa}},
  title        = {{{Essays on Choices and Behavior in Competitive Situations}}},
  year         = {{2023}},
}

@inbook{45875,
  author       = {{Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{1----20}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Capabilities and Limitations of Local Strategies in Dynamic Networks}}},
  doi          = {{10.5281/zenodo.8060372}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45878,
  author       = {{Haake, Claus-Jochen and Hehenkamp, Burkhard and Polevoy, Gleb}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{21--44}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{The Market for Services: Incentives, Algorithms, Implementation}}},
  doi          = {{10.5281/zenodo.8068414}},
  volume       = {{412}},
  year         = {{2023}},
}

@inbook{45880,
  author       = {{Elrich, Alina and Kaimann, Daniel and Fahr, René and Kundisch, Dennis and Mir Djawadi, Behnud and Müller, Michelle and Poniatowski, Martin and Schäfers, Sabrina and Frick, Bernd}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{45--64}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Empirical Analysis in Markets for OTF Services}}},
  doi          = {{10.5281/zenodo.8068430}},
  volume       = {{412}},
  year         = {{2023}},
}

@misc{46110,
  author       = {{Ashri, Nivedita}},
  title        = {{{Virtual On-Demand Volunteer System Based on Delaunay Triangulation}}},
  year         = {{2023}},
}

@phdthesis{46296,
  author       = {{Spiess-Bru, Clarissa}},
  title        = {{{Information Asymmetry and Gendered Behavior in Organizations and Digital Markets}}},
  year         = {{2023}},
}

@misc{47134,
  author       = {{Deppe, Volker}},
  title        = {{{Routing in Hypergraphs}}},
  year         = {{2023}},
}

@inproceedings{33722,
  author       = {{Müller, Michelle and Neumann, Jürgen}},
  booktitle    = {{Proceedings of the 56th Hawaii International Conference on System Sciences (HICSS)}},
  location     = {{Maui, Hawaii, USA}},
  title        = {{{Bring me my Meal on your Wheel - An Empirical Analysis of the Impact of Food Delivery Platforms on Local Restaurant Employment}}},
  year         = {{2023}},
}

@inproceedings{45193,
  author       = {{Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)}},
  location     = {{Orlando, USA}},
  title        = {{{Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs}}},
  year         = {{2023}},
}

@inproceedings{24579,
  author       = {{Müller, Michelle and Neumann, Jürgen and Kundisch, Dennis}},
  booktitle    = {{Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS)}},
  location     = {{Maui, Hawaii, USA}},
  title        = {{{Dear Guests, please pay for my license – Analyzing the heterogenous cost-pass-through of commercial and non-commercial rental suppliers in response to regulatory policies}}},
  year         = {{2022}},
}

@inproceedings{24581,
  author       = {{Seutter, Janina and Müller, Michelle and Müller, Stefanie Jutta Marianne and Kundisch, Dennis}},
  booktitle    = {{Proceedings of the 55th Hawaii International Conference on System Sciences (HICSS)}},
  location     = {{Maui, Hawaii, USA}},
  title        = {{{Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns}}},
  year         = {{2022}},
}

@misc{30152,
  author       = {{Roopa, Rajanna}},
  title        = {{{Evaluation of Algorithms for the Node Capacitated Clique}}},
  year         = {{2022}},
}

@misc{30199,
  author       = {{Nachtigall, Marcel}},
  title        = {{{Hybrid Routing in Three Dimensions}}},
  year         = {{2022}},
}

@phdthesis{30201,
  author       = {{Fanasch, Patrizia}},
  title        = {{{Governance and Reputation in the Market for Experience Goods}}},
  doi          = {{10.17619/UNIPB/1-1292 }},
  year         = {{2022}},
}

@article{30341,
  author       = {{Hoyer, Britta and van Straaten, Dirk}},
  issn         = {{2214-8043}},
  journal      = {{Journal of Behavioral and Experimental Economics}},
  keywords     = {{General Social Sciences, Economics and Econometrics, Applied Psychology}},
  pages        = {{101869}},
  publisher    = {{Elsevier BV}},
  title        = {{{Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis}}},
  doi          = {{10.1016/j.socec.2022.101869}},
  volume       = {{98}},
  year         = {{2022}},
}

@misc{31947,
  author       = {{Hillebrandt, Henning}},
  title        = {{{Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}}},
  year         = {{2022}},
}

@article{17869,
  author       = {{Poniatowski, Martin and Lüttenberg, Hedda and Beverungen, Daniel and Kundisch, Dennis}},
  journal      = {{Information Systems and e-Business Management, Special Issue on Platform Business Models and Platform Strategies}},
  pages        = {{257 -- 283}},
  title        = {{{Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms}}},
  volume       = {{2}},
  year         = {{2022}},
}

@inproceedings{31847,
  abstract     = {{The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).

In our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.

We study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.
    
The two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.}},
  author       = {{Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}},
  isbn         = {{9781450391467}},
  keywords     = {{K-Server Problem, Heterogeneity, Online Caching}},
  pages        = {{345--356}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{The k-Server with Preferences Problem}}},
  doi          = {{10.1145/3490148.3538595}},
  year         = {{2022}},
}