[{"title":"Price Fluctuations in Online Leasing","doi":"10.1007/978-3-319-71147-8_2","date_updated":"2022-01-06T07:03:26Z","author":[{"last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704","first_name":"Björn"},{"id":"37612","full_name":"Markarian, Christine","last_name":"Markarian","first_name":"Christine"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2017-10-17T12:41:05Z","year":"2017","citation":{"apa":"Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations in Online Leasing. In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>","mla":"Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>.","bibtex":"@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price Fluctuations in Online Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>}, booktitle={Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }","short":"B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017, pp. 17–31.","ama":"Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">10.1007/978-3-319-71147-8_2</a>","chicago":"Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide. “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71147-8_2\">https://doi.org/10.1007/978-3-319-71147-8_2</a>.","ieee":"B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31."},"page":"17 - 31","has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:06:13Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"70","user_id":"477","department":[{"_id":"63"}],"file":[{"date_updated":"2018-11-02T15:06:13Z","creator":"ups","date_created":"2018-11-02T15:06:13Z","file_size":287315,"file_id":"5293","access_level":"closed","file_name":"PriceFluctuationInOnlineLeasin.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 11th Annual International Conference on Combinatorial Optimization and Applications (COCOA)"},{"title":"A Self-Stabilizing Protocol for Graphs of Diameter Two","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","date_created":"2017-11-14T08:04:35Z","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"last_name":"Knollmann","full_name":"Knollmann, Till","first_name":"Till"}],"year":"2017","citation":{"ama":"Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn; 2017.","chicago":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","ieee":"T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","mla":"Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn, 2017.","apa":"Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>. Universität Paderborn."},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"700","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"mastersthesis"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"701","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","year":"2017","citation":{"chicago":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","ieee":"T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","ama":"Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn; 2017.","apa":"Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn.","mla":"Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }","short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017."},"title":"Self-Stabilizing Spanners for Tree Metrics","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:26Z","author":[{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"}],"date_created":"2017-11-14T09:32:39Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}]},{"title":"Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland","date_updated":"2022-01-06T07:03:57Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:08Z","author":[{"last_name":"Niggemeyer","full_name":"Niggemeyer, Laura","first_name":"Laura"}],"supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"year":"2017","citation":{"chicago":"Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","ieee":"L. Niggemeyer, <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","ama":"Niggemeyer L. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn; 2017.","apa":"Niggemeyer, L. (2017). <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn.","mla":"Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","bibtex":"@book{Niggemeyer_2017, title={Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland}, publisher={Universität Paderborn}, author={Niggemeyer, Laura}, year={2017} }","short":"L. Niggemeyer, Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland, Universität Paderborn, 2017."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"86","user_id":"42447","department":[{"_id":"280"}],"status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","_id":"50","project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","language":[{"iso":"ger"}],"year":"2017","citation":{"ama":"Hamdeev E. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn; 2017.","ieee":"E. Hamdeev, <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","chicago":"Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","bibtex":"@book{Hamdeev_2017, title={Verzerrte Online-Produktbewertungen - Literaturüberblick}, publisher={Universität Paderborn}, author={Hamdeev, Erna}, year={2017} }","mla":"Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","short":"E. Hamdeev, Verzerrte Online-Produktbewertungen - Literaturüberblick, Universität Paderborn, 2017.","apa":"Hamdeev, E. (2017). <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:34Z","publisher":"Universität Paderborn","author":[{"full_name":"Hamdeev, Erna","last_name":"Hamdeev","first_name":"Erna"}],"date_created":"2017-10-17T12:41:00Z","title":"Verzerrte Online-Produktbewertungen - Literaturüberblick"},{"title":"How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis","supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"date_created":"2018-10-30T14:51:20Z","author":[{"first_name":"Thomas","full_name":"Streck, Thomas","id":"33041","last_name":"Streck"}],"date_updated":"2022-01-06T07:01:37Z","publisher":"Universität Paderborn","citation":{"ama":"Streck T. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn; 2017.","ieee":"T. Streck, <i>How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis</i>. Universität Paderborn, 2017.","chicago":"Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn, 2017.","apa":"Streck, T. (2017). <i>How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis</i>. Universität Paderborn.","short":"T. Streck, How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis, Universität Paderborn, 2017.","mla":"Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn, 2017.","bibtex":"@book{Streck_2017, title={How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis}, publisher={Universität Paderborn}, author={Streck, Thomas}, year={2017} }"},"year":"2017","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901","_id":"1"}],"_id":"5084","status":"public","type":"mastersthesis"},{"title":"Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse","date_created":"2017-10-17T12:41:01Z","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"author":[{"full_name":"Winkelhake, Nikolai","last_name":"Winkelhake","first_name":"Nikolai"}],"date_updated":"2022-01-06T07:01:37Z","publisher":"Universität Paderborn","citation":{"mla":"Winkelhake, Nikolai. <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","short":"N. Winkelhake, Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse, Universität Paderborn, 2017.","bibtex":"@book{Winkelhake_2017, title={Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Winkelhake, Nikolai}, year={2017} }","apa":"Winkelhake, N. (2017). <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","ama":"Winkelhake N. <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. Universität Paderborn; 2017.","ieee":"N. Winkelhake, <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017.","chicago":"Winkelhake, Nikolai. <i>Tying und Bundling in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2017."},"year":"2017","language":[{"iso":"ger"}],"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":"51","status":"public","type":"mastersthesis"},{"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior}, booktitle={Proceedings of the 38th International Conference on Information Systems (ICIS)}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2017} }","short":"J. Neumann, D. Gutt, D. Kundisch, in: Proceedings of the 38th International Conference on Information Systems (ICIS), 2017.","mla":"Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior.” <i>Proceedings of the 38th International Conference on Information Systems (ICIS)</i>, 2017.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2017). The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior. In <i>Proceedings of the 38th International Conference on Information Systems (ICIS)</i>. Seoul, South Korea.","ama":"Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior. In: <i>Proceedings of the 38th International Conference on Information Systems (ICIS)</i>. ; 2017.","ieee":"J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior,” in <i>Proceedings of the 38th International Conference on Information Systems (ICIS)</i>, Seoul, South Korea, 2017.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior.” In <i>Proceedings of the 38th International Conference on Information Systems (ICIS)</i>, 2017."},"year":"2017","date_created":"2017-10-17T12:41:01Z","author":[{"first_name":"Jürgen","last_name":"Neumann","full_name":"Neumann, Jürgen","id":"32456"},{"first_name":"Dominik","last_name":"Gutt","full_name":"Gutt, Dominik","id":"14368"},{"last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"date_updated":"2022-01-06T07:01:49Z","conference":{"name":"38th International Conference on Information Systems (ICIS)","start_date":"2017-12-10","end_date":"2017-12-13","location":"Seoul, South Korea"},"title":"The Traveling Reviewer Problem – Exploring the Relationship Between Offline Locations and Online Rating Behavior","publication":"Proceedings of the 38th International Conference on Information Systems (ICIS)","type":"conference","status":"public","file":[{"file_size":532659,"access_level":"closed","file_name":"viewcontent.pdf","file_id":"5486","date_updated":"2018-11-12T10:30:59Z","creator":"d0mi","date_created":"2018-11-12T10:30:59Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Amongst the growing body of literature on the drivers of online ratings, the influence of\r\ncustomers’ local offline environment on their ratings has largely been neglected. This\r\nstudy examines the relationship between ratings made outside of a customer’s home area\r\nand the magnitude of online ratings. We employ a data-driven identification of a\r\ncustomer’s geographic home area and use variation in this variable to identify the\r\nconsequences for the magnitude of ratings. In line with our theory, we find that customers\r\nwho rate while traveling give, on average, higher ratings than locals. However, this\r\nrelationship is moderated by the posting time of a review relative to consumption, as\r\ntravelers post more negative ratings during or shortly after consumption. These\r\nrelationships are most pronounced for customers who travel and rate less frequently. Our\r\nresults come with substantial implications for a business’s average rating and for\r\ncustomer decision making. ","lang":"eng"}],"department":[{"_id":"276"}],"user_id":"16205","_id":"53","project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-11-12T10:30:59Z","language":[{"iso":"eng"}],"ddc":["330"]},{"date_updated":"2022-01-06T07:01:51Z","author":[{"last_name":"Neumann","full_name":"Neumann, Jürgen","id":"32456","first_name":"Jürgen"},{"last_name":"Gutt","id":"14368","full_name":"Gutt, Dominik","first_name":"Dominik"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"date_created":"2017-10-17T12:41:01Z","title":"The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior","conference":{"location":"Houston, USA","name":"INFORMS Annual Meeting"},"has_accepted_license":"1","year":"2017","citation":{"ama":"Neumann J, Gutt D, Kundisch D. The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior. In: <i>INFORMS Annual Meeting</i>. ; 2017.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior.” In <i>INFORMS Annual Meeting</i>, 2017.","ieee":"J. Neumann, D. Gutt, and D. Kundisch, “The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior,” in <i>INFORMS Annual Meeting</i>, Houston, USA, 2017.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2017). The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior. In <i>INFORMS Annual Meeting</i>. Houston, USA.","bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2017, title={The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior}, booktitle={INFORMS Annual Meeting}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2017} }","short":"J. Neumann, D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2017.","mla":"Neumann, Jürgen, et al. “The Traveling Reviewer Problem – Exploring the Relationship between Offline Locations and Online Rating Behavior.” <i>INFORMS Annual Meeting</i>, 2017."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"54","user_id":"477","department":[{"_id":"276"}],"ddc":["330"],"file_date_updated":"2018-11-12T10:38:39Z","language":[{"iso":"eng"}],"type":"conference_abstract","publication":"INFORMS Annual Meeting","file":[{"file_size":694342,"access_level":"closed","file_id":"5493","file_name":"WP_TRP.pdf","date_updated":"2018-11-12T10:38:39Z","date_created":"2018-11-12T10:38:39Z","creator":"d0mi","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public"},{"type":"conference","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"text":"We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:55:10Z","date_created":"2018-11-02T14:55:10Z","creator":"ups","file_size":691691,"file_name":"p313-feldkord.pdf","access_level":"closed","file_id":"5288"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"55","user_id":"477","department":[{"_id":"63"}],"ddc":["000"],"file_date_updated":"2018-11-02T14:55:10Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2017","citation":{"apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2017). The Mobile Server Problem. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 313–319). <a href=\"https://doi.org/10.1145/3087556.3087575\">https://doi.org/10.1145/3087556.3087575</a>","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 313–19, doi:<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server Problem}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2017}, pages={313–319} }","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:313-319. doi:<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 313–319.","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 313–19, 2017. <a href=\"https://doi.org/10.1145/3087556.3087575\">https://doi.org/10.1145/3087556.3087575</a>."},"page":"313-319","date_updated":"2022-01-06T07:01:56Z","date_created":"2017-10-17T12:41:02Z","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"title":"The Mobile Server Problem","doi":"10.1145/3087556.3087575"},{"date_created":"2017-10-17T12:41:04Z","title":"Pure Nash Equilibria in Restricted Budget Games","year":"2017","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)","abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"file":[{"file_id":"5228","file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf","access_level":"closed","file_size":346390,"creator":"feldi","date_created":"2018-10-31T16:58:42Z","date_updated":"2018-10-31T16:58:42Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"date_updated":"2022-01-06T07:03:13Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"doi":"10.1007/978-3-319-62389-4_15","has_accepted_license":"1","citation":{"chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 175--187. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>.","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>. LNCS. ; 2017:175--187. doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i> (pp. 175--187). <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187, doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }"},"page":"175--187","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"66","series_title":"LNCS","user_id":"14052","department":[{"_id":"541"},{"_id":"63"}],"file_date_updated":"2018-10-31T16:58:42Z","type":"conference","status":"public"},{"citation":{"apa":"Wachowiak, L. (2017). <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn.","short":"L. Wachowiak, Das Mobile Server Problem in Netzwerken, Universität Paderborn, 2017.","bibtex":"@book{Wachowiak_2017, title={Das Mobile Server Problem in Netzwerken}, publisher={Universität Paderborn}, author={Wachowiak, Lennart}, year={2017} }","mla":"Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn, 2017.","ama":"Wachowiak L. <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn; 2017.","ieee":"L. Wachowiak, <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn, 2017.","chicago":"Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn, 2017."},"year":"2017","author":[{"first_name":"Lennart","full_name":"Wachowiak, Lennart","last_name":"Wachowiak"}],"date_created":"2017-11-14T06:58:39Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:24Z","title":"Das Mobile Server Problem in Netzwerken","type":"bachelorsthesis","status":"public","user_id":"477","_id":"696","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"ger"}]},{"language":[{"iso":"ger"}],"user_id":"477","_id":"697","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis","title":"Untersuchungen zum Cone-Hashing","author":[{"full_name":"Burkhardt, Michel","last_name":"Burkhardt","first_name":"Michel"}],"date_created":"2017-11-14T08:01:41Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:24Z","citation":{"ama":"Burkhardt M. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn; 2017.","chicago":"Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michel}, year={2017} }","mla":"Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","short":"M. Burkhardt, Untersuchungen zum Cone-Hashing, Universität Paderborn, 2017."},"year":"2017"},{"_id":"1048","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:41Z","date_created":"2017-12-13T10:14:30Z","author":[{"full_name":"Schenk, Andreas","last_name":"Schenk","first_name":"Andreas"}],"title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","year":"2017","citation":{"ieee":"A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","chicago":"Schenk, Andreas. <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.","short":"A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen, Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }","mla":"Schenk, Andreas. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn."}},{"author":[{"first_name":"Björn","full_name":"Beckendorfer, Björn","last_name":"Beckendorfer"}],"date_created":"2017-12-13T10:17:43Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:42Z","title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","citation":{"chicago":"Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","ieee":"B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","ama":"Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn; 2017.","apa":"Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","bibtex":"@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn}, year={2017} }","mla":"Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","short":"B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme, Universität Paderborn, 2017."},"year":"2017","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"1049","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"105","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"20792","department":[{"_id":"79"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-13T09:23:11Z","type":"conference","publication":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)","abstract":[{"lang":"eng","text":"We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-13T09:23:11Z","creator":"florida","date_created":"2018-03-13T09:23:11Z","file_size":504161,"access_level":"closed","file_id":"1207","file_name":"105-ICALP17-GHSS.pdf"}],"status":"public","date_updated":"2022-01-06T06:50:42Z","date_created":"2017-10-17T12:41:12Z","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Kristian","last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"title":"Distributed Monitoring of Network Properties: The Power of Hybrid Networks","doi":"10.4230/LIPIcs.ICALP.2017.137","has_accepted_license":"1","year":"2017","citation":{"ama":"Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In: <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>. Leibniz International Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>","chicago":"Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” In <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>.","ieee":"R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15.","apa":"Gmyr, R., Hinnenthal, K., Scheideler, C., &#38; Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i> (pp. 137:1--137:15). <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>","bibtex":"@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring of Network Properties: The Power of Hybrid Networks}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>}, booktitle={Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” <i>Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2017.137\">10.4230/LIPIcs.ICALP.2017.137</a>.","short":"R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15."},"page":"137:1--137:15"},{"status":"public","type":"journal_article","article_type":"original","file_date_updated":"2018-11-02T15:39:01Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1054","user_id":"477","department":[{"_id":"280"},{"_id":"475"}],"citation":{"ama":"Brosig-Koch J, Hehenkamp B, Kokot J. The effects of competition on medical service provision. <i>Health Economics</i>. 2017;26(53):6-20. doi:<a href=\"https://doi.org/10.1002/hec.3583\">10.1002/hec.3583</a>","ieee":"J. Brosig-Koch, B. Hehenkamp, and J. Kokot, “The effects of competition on medical service provision,” <i>Health Economics</i>, vol. 26, no. 53, pp. 6–20, 2017.","chicago":"Brosig-Koch, Janet, Burkhard Hehenkamp, and Johanna Kokot. “The Effects of Competition on Medical Service Provision.” <i>Health Economics</i> 26, no. 53 (2017): 6–20. <a href=\"https://doi.org/10.1002/hec.3583\">https://doi.org/10.1002/hec.3583</a>.","mla":"Brosig-Koch, Janet, et al. “The Effects of Competition on Medical Service Provision.” <i>Health Economics</i>, vol. 26, no. 53, Wiley Online Library, 2017, pp. 6–20, doi:<a href=\"https://doi.org/10.1002/hec.3583\">10.1002/hec.3583</a>.","short":"J. Brosig-Koch, B. Hehenkamp, J. Kokot, Health Economics 26 (2017) 6–20.","bibtex":"@article{Brosig-Koch_Hehenkamp_Kokot_2017, title={The effects of competition on medical service provision}, volume={26}, DOI={<a href=\"https://doi.org/10.1002/hec.3583\">10.1002/hec.3583</a>}, number={53}, journal={Health Economics}, publisher={Wiley Online Library}, author={Brosig-Koch, Janet and Hehenkamp, Burkhard and Kokot, Johanna}, year={2017}, pages={6–20} }","apa":"Brosig-Koch, J., Hehenkamp, B., &#38; Kokot, J. (2017). The effects of competition on medical service provision. <i>Health Economics</i>, <i>26</i>(53), 6–20. <a href=\"https://doi.org/10.1002/hec.3583\">https://doi.org/10.1002/hec.3583</a>"},"page":"6-20","intvolume":"        26","publication_status":"published","has_accepted_license":"1","doi":"10.1002/hec.3583","date_updated":"2022-01-06T06:50:43Z","author":[{"first_name":"Janet","last_name":"Brosig-Koch","full_name":"Brosig-Koch, Janet"},{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"},{"first_name":"Johanna","full_name":"Kokot, Johanna","last_name":"Kokot"}],"volume":26,"abstract":[{"lang":"eng","text":"We explore how competition between physicians affects medical service provision. Previous research has shown that, without competition, physicians deviate from patient‐optimal treatment under payment systems like capitation and fee‐for‐service. Although competition might reduce these distortions, physicians usually interact with each other repeatedly over time and only a fraction of patients switches providers at all. Both patterns might prevent competition to work in the desired direction. To analyze the behavioral effects of competition, we develop a theoretical benchmark that is then tested in a controlled laboratory experiment. Experimental conditions vary physician payment and patient characteristics. Real patients benefit from provision decisions made in the experiment. Our results reveal that, in line with the theoretical prediction, introducing competition can reduce overprovision and underprovision, respectively. The observed effects depend on patient characteristics and the payment system, though. Tacit collusion is observed and particularly pronounced with fee‐for‐service payment, but it appears to be less frequent than in related experimental research on price competition. "}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:39:01Z","date_created":"2018-11-02T15:39:01Z","creator":"ups","file_size":1116140,"access_level":"closed","file_name":"Brosig-Koch_et_al-2018-Health_Economics.pdf","file_id":"5309"}],"publication":"Health Economics","ddc":["000"],"language":[{"iso":"eng"}],"year":"2017","quality_controlled":"1","issue":"53","title":"The effects of competition on medical service provision","publisher":"Wiley Online Library","date_created":"2017-12-15T11:16:41Z"},{"title":"Location Choice and Quality Competition in Mixed Hospital Markets","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:44Z","date_created":"2017-12-15T11:19:12Z","author":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"},{"full_name":"Kaarboe, Oddvar","last_name":"Kaarboe","first_name":"Oddvar"}],"year":"2017","citation":{"chicago":"Hehenkamp, Burkhard, and Oddvar Kaarboe. <i>Location Choice and Quality Competition in Mixed Hospital Markets</i>. Universität Paderborn, 2017.","ieee":"B. Hehenkamp and O. Kaarboe, <i>Location Choice and Quality Competition in Mixed Hospital Markets</i>. Universität Paderborn, 2017.","ama":"Hehenkamp B, Kaarboe O. <i>Location Choice and Quality Competition in Mixed Hospital Markets</i>. Universität Paderborn; 2017.","bibtex":"@book{Hehenkamp_Kaarboe_2017, title={Location Choice and Quality Competition in Mixed Hospital Markets}, publisher={Universität Paderborn}, author={Hehenkamp, Burkhard and Kaarboe, Oddvar}, year={2017} }","mla":"Hehenkamp, Burkhard, and Oddvar Kaarboe. <i>Location Choice and Quality Competition in Mixed Hospital Markets</i>. Universität Paderborn, 2017.","short":"B. Hehenkamp, O. Kaarboe, Location Choice and Quality Competition in Mixed Hospital Markets, Universität Paderborn, 2017.","apa":"Hehenkamp, B., &#38; Kaarboe, O. (2017). <i>Location Choice and Quality Competition in Mixed Hospital Markets</i>. Universität Paderborn."},"has_accepted_license":"1","ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-06T14:01:20Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1055","user_id":"42447","department":[{"_id":"280"},{"_id":"475"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-11-06T14:01:20Z","creator":"bhoyer","date_updated":"2018-11-06T14:01:20Z","file_id":"5379","file_name":"HehenkampKaarboe_20180905.pdf","access_level":"closed","file_size":318340}],"status":"public","type":"report"},{"year":"2017","citation":{"ieee":"Y. Gu, B. Hehenkamp, and W. Leininger, <i>Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn, 2017.","chicago":"Gu, Yiguan, Burkhard Hehenkamp, and Wolfgang Leininger. <i>Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn, 2017.","ama":"Gu Y, Hehenkamp B, Leininger W. <i>Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn; 2017.","apa":"Gu, Y., Hehenkamp, B., &#38; Leininger, W. (2017). <i>Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn.","mla":"Gu, Yiguan, et al. <i>Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation</i>. Universität Paderborn, 2017.","bibtex":"@book{Gu_Hehenkamp_Leininger_2017, title={Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation}, publisher={Universität Paderborn}, author={Gu, Yiguan and Hehenkamp, Burkhard and Leininger, Wolfgang}, year={2017} }","short":"Y. Gu, B. Hehenkamp, W. Leininger, Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation, Universität Paderborn, 2017."},"has_accepted_license":"1","title":"Evolutionary Equilibrium in Stochastic Contests - Entry, Effort, and Overdissipation","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:44Z","author":[{"first_name":"Yiguan","last_name":"Gu","full_name":"Gu, Yiguan"},{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"},{"full_name":"Leininger, Wolfgang","last_name":"Leininger","first_name":"Wolfgang"}],"date_created":"2017-12-15T11:21:34Z","status":"public","file":[{"date_updated":"2018-11-06T14:05:20Z","creator":"bhoyer","date_created":"2018-11-06T14:05:20Z","file_size":520711,"file_id":"5380","access_level":"closed","file_name":"ESS_Contest_20181026.pdf","content_type":"application/pdf","relation":"main_file"}],"type":"report","ddc":["330"],"file_date_updated":"2018-11-06T14:05:20Z","language":[{"iso":"eng"}],"_id":"1056","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"42447"},{"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"SSRN-id2959997.pdf","file_id":"5386","access_level":"closed","file_size":260633,"date_created":"2018-11-06T15:27:20Z","creator":"bhoyer","date_updated":"2018-11-06T15:27:20Z"}],"type":"report","file_date_updated":"2018-11-06T15:27:20Z","language":[{"iso":"eng"}],"ddc":["330"],"department":[{"_id":"205"},{"_id":"179"}],"user_id":"477","_id":"1057","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"citation":{"apa":"Sürücü, O., Mir Djawadi, B., &#38; Brangewitz, S. (2017). <i>Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn.","mla":"Sürücü, Oktay, et al. <i>Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn, 2017.","short":"O. Sürücü, B. Mir Djawadi, S. Brangewitz, Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries, Universität Paderborn, 2017.","bibtex":"@book{Sürücü_Mir Djawadi_Brangewitz_2017, title={Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries}, publisher={Universität Paderborn}, author={Sürücü, Oktay and Mir Djawadi, Behnud and Brangewitz, Sonja}, year={2017} }","ieee":"O. Sürücü, B. Mir Djawadi, and S. Brangewitz, <i>Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn, 2017.","chicago":"Sürücü, Oktay, Behnud Mir Djawadi, and Sonja Brangewitz. <i>Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn, 2017.","ama":"Sürücü O, Mir Djawadi B, Brangewitz S. <i>Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries</i>. Universität Paderborn; 2017."},"year":"2017","has_accepted_license":"1","title":"Asymmetric Dominance Effect with Multiple Decoys for Low- and High-Variance Lotteries","author":[{"first_name":"Oktay","full_name":"Sürücü, Oktay","last_name":"Sürücü"},{"first_name":"Behnud","full_name":"Mir Djawadi, Behnud","id":"26032","orcid":"0000-0002-6271-5912","last_name":"Mir Djawadi"},{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"}],"date_created":"2017-12-15T11:24:00Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:44Z"}]