[{"type":"journal_article","publication":"Information Systems Research","file":[{"file_id":"5473","file_name":"Crowd-Driven_Competitive_Intelligence_accept.pdf","access_level":"closed","file_size":640218,"date_created":"2018-11-12T09:55:20Z","creator":"d0mi","date_updated":"2018-11-12T09:55:20Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","user_id":"16205","department":[{"_id":"276"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"3936","language":[{"iso":"eng"}],"file_date_updated":"2018-11-12T09:55:20Z","ddc":["330"],"issue":"3","publication_status":"epub_ahead","has_accepted_license":"1","citation":{"ama":"Gutt D, Herrmann P, Rahman M. Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. <i>Information Systems Research</i>. 2019;30(3):980-994.","chicago":"Gutt, Dominik, Philipp Herrmann, and Mohammad Rahman. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” <i>Information Systems Research</i> 30, no. 3 (2019): 980–94.","ieee":"D. Gutt, P. Herrmann, and M. Rahman, “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions,” <i>Information Systems Research</i>, vol. 30, no. 3, pp. 980–994, 2019.","bibtex":"@article{Gutt_Herrmann_Rahman_2019, title={Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions}, volume={30}, number={3}, journal={Information Systems Research}, author={Gutt, Dominik and Herrmann, Philipp and Rahman, Mohammad}, year={2019}, pages={980–994} }","short":"D. Gutt, P. Herrmann, M. Rahman, Information Systems Research 30 (2019) 980–994.","mla":"Gutt, Dominik, et al. “Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions.” <i>Information Systems Research</i>, vol. 30, no. 3, 2019, pp. 980–94.","apa":"Gutt, D., Herrmann, P., &#38; Rahman, M. (2019). Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions. <i>Information Systems Research</i>, <i>30</i>(3), 980–994."},"intvolume":"        30","page":"980-994","year":"2019","date_created":"2018-08-20T09:45:31Z","author":[{"full_name":"Gutt, Dominik","id":"14368","last_name":"Gutt","first_name":"Dominik"},{"last_name":"Herrmann","full_name":"Herrmann, Philipp","first_name":"Philipp"},{"first_name":"Mohammad","last_name":"Rahman","full_name":"Rahman, Mohammad"}],"volume":30,"date_updated":"2022-01-06T06:59:57Z","title":"Crowd-Driven Competitive Intelligence: Understanding the Relationship between Local Market Competition and Online Rating Distributions"},{"publication":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","file":[{"date_updated":"2018-12-06T13:57:51Z","date_created":"2018-12-06T13:57:51Z","creator":"feldi","file_size":315877,"file_id":"6018","access_level":"closed","file_name":"1811.05130.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"We characterise the set of dominant strategy incentive compatible (DSIC), strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms for the multi-unit bilateral trade setting. In such a setting there is a single buyer and a single seller who holds a finite number k of identical items. The mechanism has to decide how many units of the item are transferred from the seller to the buyer and how much money is transferred from the buyer to the seller. We consider two classes of valuation functions for the buyer and seller: Valuations that are increasing in the number of units in possession, and the more specific class of valuations that are increasing and submodular. \r\nFurthermore, we present some approximation results about the performance of certain such mechanisms, in terms of social welfare: For increasing submodular valuation functions, we show the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e) approximation mechanism, matching the best known bounds for the single-item setting.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2019","date_created":"2018-11-12T09:38:16Z","title":" Multi-unit Bilateral Trade","type":"conference","status":"public","user_id":"15415","department":[{"_id":"541"},{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5471","file_date_updated":"2018-12-06T13:57:51Z","publication_status":"published","has_accepted_license":"1","citation":{"chicago":"Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019. <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">https://doi.org/10.1609/aaai.v33i01.33011973</a>.","ieee":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “ Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>.","ama":"Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B.  Multi-unit Bilateral Trade. In: <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>","bibtex":"@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={ Multi-unit Bilateral Trade}, DOI={<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>}, booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }","mla":"Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019, doi:<a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">10.1609/aaai.v33i01.33011973</a>.","short":"P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019.","apa":"Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &#38; de Keijzer, B. (2019).  Multi-unit Bilateral Trade. <i>Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>. Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. <a href=\"https://doi.org/10.1609/aaai.v33i01.33011973\">https://doi.org/10.1609/aaai.v33i01.33011973</a>"},"author":[{"first_name":"Philip","full_name":"Lazos, Philip","last_name":"Lazos"},{"first_name":"Paul","full_name":"Goldberg, Paul","last_name":"Goldberg"},{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"},{"first_name":"Matthias","last_name":"Gerstgrasser","full_name":"Gerstgrasser, Matthias"},{"first_name":"Bart","last_name":"de Keijzer","full_name":"de Keijzer, Bart"}],"date_updated":"2022-01-06T07:01:55Z","conference":{"end_date":"2019-02-01","location":"Honolulu, Hawaii, USA","name":"Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","start_date":"2019-01-27"},"doi":"10.1609/aaai.v33i01.33011973"},{"conference":{"name":"Wirtschaftsinformatik","location":"Siegen, Germany"},"title":"Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods","author":[{"full_name":"Müller, Michelle","last_name":"Müller","first_name":"Michelle"},{"first_name":"Dominik","full_name":"Gutt, Dominik","id":"14368","last_name":"Gutt"}],"date_created":"2019-01-17T14:39:49Z","date_updated":"2022-01-06T07:03:22Z","citation":{"ama":"Müller M, Gutt D. Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In: <i>Wirtschaftsinformatik Proceedings 2019</i>. ; 2019.","chicago":"Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” In <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","ieee":"M. Müller and D. Gutt, “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods,” in <i>Wirtschaftsinformatik Proceedings 2019</i>, Siegen, Germany, 2019.","short":"M. Müller, D. Gutt, in: Wirtschaftsinformatik Proceedings 2019, 2019.","bibtex":"@inproceedings{Müller_Gutt_2019, title={Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods}, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Müller, Michelle and Gutt, Dominik}, year={2019} }","mla":"Müller, Michelle, and Dominik Gutt. “Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods.” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","apa":"Müller, M., &#38; Gutt, D. (2019). Heart over Heels? An Empirical Analysis of the Relationship between Emotions and Review Helpfulness for Experience and Credence Goods. In <i>Wirtschaftsinformatik Proceedings 2019</i>. Siegen, Germany."},"year":"2019","language":[{"iso":"eng"}],"department":[{"_id":"276"}],"user_id":"16205","_id":"6856","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"status":"public","publication":"Wirtschaftsinformatik Proceedings 2019","type":"conference"},{"year":"2019","citation":{"short":"M. Poniatowski, J. Neumann, T. Görzen, D. Kundisch, in: Wirtschaftsinformatik Proceedings 2019, 2019.","mla":"Poniatowski, Martin, et al. “A Semi-Automated Approach for Generating Online Review Templates, .” <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","bibtex":"@inproceedings{Poniatowski_Neumann_Görzen_Kundisch_2019, title={A Semi-Automated Approach for Generating Online Review Templates, }, booktitle={Wirtschaftsinformatik Proceedings 2019}, author={Poniatowski, Martin and Neumann, Jürgen and Görzen, Thomas and Kundisch, Dennis}, year={2019} }","apa":"Poniatowski, M., Neumann, J., Görzen, T., &#38; Kundisch, D. (2019). A Semi-Automated Approach for Generating Online Review Templates, . In <i>Wirtschaftsinformatik Proceedings 2019</i>. Siegen, Germany.","chicago":"Poniatowski, Martin, Jürgen Neumann, Thomas Görzen, and Dennis Kundisch. “A Semi-Automated Approach for Generating Online Review Templates, .” In <i>Wirtschaftsinformatik Proceedings 2019</i>, 2019.","ieee":"M. Poniatowski, J. Neumann, T. Görzen, and D. Kundisch, “A Semi-Automated Approach for Generating Online Review Templates, ,” in <i>Wirtschaftsinformatik Proceedings 2019</i>, Siegen, Germany, 2019.","ama":"Poniatowski M, Neumann J, Görzen T, Kundisch D. A Semi-Automated Approach for Generating Online Review Templates, . In: <i>Wirtschaftsinformatik Proceedings 2019</i>. ; 2019."},"title":"A Semi-Automated Approach for Generating Online Review Templates, ","conference":{"name":"Wirtschaftsinformatik","location":"Siegen, Germany"},"date_updated":"2022-01-06T07:03:22Z","author":[{"first_name":"Martin","last_name":"Poniatowski","full_name":"Poniatowski, Martin","id":"32441"},{"full_name":"Neumann, Jürgen","id":"32456","last_name":"Neumann","first_name":"Jürgen"},{"last_name":"Görzen","full_name":"Görzen, Thomas","id":"47700","first_name":"Thomas"},{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2019-01-17T14:46:50Z","status":"public","type":"conference","publication":"Wirtschaftsinformatik Proceedings 2019","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"6857","user_id":"477","department":[{"_id":"276"}]},{"status":"public","type":"conference","file_date_updated":"2019-08-26T09:21:27Z","department":[{"_id":"79"}],"user_id":"477","series_title":"LIPIcs","_id":"10586","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"page":"150:1--150:14","intvolume":"       132","citation":{"chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>","apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14."},"has_accepted_license":"1","publication_status":"published","conference":{"start_date":"2019-07-09","name":"ICALP 2019","location":"Patras, Greece","end_date":"2019-07-12"},"doi":"10.4230/LIPICS.ICALP.2019.150","volume":132,"author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"}],"date_updated":"2022-01-06T06:50:45Z","file":[{"creator":"ups","date_created":"2019-08-26T09:21:27Z","date_updated":"2019-08-26T09:21:27Z","access_level":"closed","file_name":"LIPIcs-ICALP-2019-150.pdf","file_id":"12955","file_size":537649,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio."}],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","language":[{"iso":"eng"}],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"ddc":["004"],"year":"2019","title":"On the Complexity of Local Graph Transformations","date_created":"2019-07-08T17:19:01Z","publisher":"Dagstuhl Publishing"},{"type":"conference","publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","status":"public","user_id":"22704","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"12870","external_id":{"arxiv":["1907.09834"]},"language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>.","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">https://doi.org/10.1007/978-3-030-39479-0_9</a>","bibtex":"@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer, 2019, pp. 120–37, doi:<a href=\"https://doi.org/10.1007/978-3-030-39479-0_9\">10.1007/978-3-030-39479-0_9</a>.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137."},"page":"120 - 137","year":"2019","date_created":"2019-07-22T09:00:05Z","author":[{"first_name":"Björn","last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publisher":"Springer","date_updated":"2022-01-06T06:51:20Z","doi":"10.1007/978-3-030-39479-0_9","title":"Managing Multiple Mobile Resources"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"15627","user_id":"32229","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","status":"public","date_updated":"2022-01-06T06:52:30Z","date_created":"2020-01-22T09:07:36Z","author":[{"first_name":"John","full_name":"Augustine, John","last_name":"Augustine"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"}],"title":"Shortest Paths in a Hybrid Network Model","doi":"10.1137/1.9781611975994.78","publication_status":"published","publication_identifier":{"isbn":["9781611975994"]},"place":"Philadelphia, PA","year":"2019","citation":{"bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–99, doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>.","short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.","apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia, PA. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>","ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99. Philadelphia, PA, 2019. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>."},"page":"1280-1299"},{"citation":{"ieee":"C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019.","chicago":"Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>.","ama":"Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>","short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019.","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>}, publisher={ACM}, year={2019} }","mla":"Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3323165\">10.1145/3323165</a>.","apa":"Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>. ACM. <a href=\"https://doi.org/10.1145/3323165\">https://doi.org/10.1145/3323165</a>"},"year":"2019","publication_identifier":{"isbn":["978-1-4503-6184-2"]},"doi":"10.1145/3323165","title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","date_created":"2019-11-06T10:43:41Z","date_updated":"2022-01-06T06:52:07Z","publisher":"ACM","status":"public","editor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"}],"type":"conference_editor","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"14829","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"publisher":"CIE Working Paper Series, Paderborn University","date_updated":"2022-01-06T06:52:16Z","volume":128,"author":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"},{"full_name":"Upmann, Thorsten","last_name":"Upmann","first_name":"Thorsten"},{"last_name":"Duman","id":"72752","full_name":"Duman, Papatya","first_name":"Papatya"}],"date_created":"2019-11-28T09:49:08Z","title":"The Decomposability of the Nash Bargaining Solution in Labor Markets","has_accepted_license":"1","year":"2019","intvolume":"       128","citation":{"bibtex":"@book{Haake_Upmann_Duman_2019, series={Working Papers CIE}, title={The Decomposability of the Nash Bargaining Solution in Labor Markets}, volume={128}, publisher={CIE Working Paper Series, Paderborn University}, author={Haake, Claus-Jochen and Upmann, Thorsten and Duman, Papatya}, year={2019}, collection={Working Papers CIE} }","mla":"Haake, Claus-Jochen, et al. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol. 128, CIE Working Paper Series, Paderborn University, 2019.","short":"C.-J. Haake, T. Upmann, P. Duman, The Decomposability of the Nash Bargaining Solution in Labor Markets, CIE Working Paper Series, Paderborn University, 2019.","apa":"Haake, C.-J., Upmann, T., &#38; Duman, P. (2019). <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i> (Vol. 128). CIE Working Paper Series, Paderborn University.","ama":"Haake C-J, Upmann T, Duman P. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol 128. CIE Working Paper Series, Paderborn University; 2019.","ieee":"C.-J. Haake, T. Upmann, and P. Duman, <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>, vol. 128. CIE Working Paper Series, Paderborn University, 2019.","chicago":"Haake, Claus-Jochen, Thorsten Upmann, and Papatya Duman. <i>The Decomposability of the Nash Bargaining Solution in Labor Markets</i>. Vol. 128. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2019."},"_id":"15202","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"205"},{"_id":"475"}],"series_title":"Working Papers CIE","user_id":"477","keyword":["Labor market negotiations","Efficient bargains","Nash bargaining solution","Sequential bargaining","Restricted bargaining games"],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2019-11-28T09:50:10Z","type":"working_paper","abstract":[{"lang":"eng","text":"In this paper, we analyze the two-dimensional Nash bargaining solution (NBS) deploying a standard labor market negotiations model (see McDonald and Solow, 1981; Creedy and McDonald, 1991). We show that the two-dimensional bargaining problem can be decomposed into two one-dimensional problems such that the (Cartesian) product of the solutions of these problems replicates the solution of the two-dimensional problem, if the NBS is applied. However, this decomposition fails for any solution concept that does not satisfy the axiom of Independence of Irrelevant Alternatives (IIA axiom). Our decomposition result has significant implications for actual negotiations, as it allows for the decomposition of a multi-issue bargaining problem into a set of simpler problems, in particular a set of single-issue bargaining problems. In this way, the decomposition may help facilitate negotiations in labor markets and also in other environments."}],"status":"public","file":[{"file_id":"15203","access_level":"closed","file_name":"WP - The Decomposability of the Nash Bargaining Solution in Labor Markets.pdf","file_size":1068284,"creator":"stela","date_created":"2019-11-28T09:50:10Z","date_updated":"2019-11-28T09:50:10Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"type":"working_paper","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"stela","date_created":"2019-11-28T10:01:40Z","date_updated":"2019-11-28T10:01:40Z","access_level":"closed","file_name":"WP - Duality for General TU-games Redefined.pdf","file_id":"15205","file_size":369323}],"status":"public","abstract":[{"lang":"eng","text":"We criticize some conceptual weaknesses in the recent literature on coalitional TUgames and propose, based on our critics, a new definition of dual TU-games that coincides with the one in the literature on the class of super-additive games. We justify our new definition in four alternative ways: 1. Via an adequate definition of ecient payo vectors. 2. Via a modification of the Bondareva-Shapley duality. 3. Via an explicit consideration of \\coalition building\". 4. Via associating general TU-games to coalition-production economies. Rather than imputations, we base our analysis on a modification of aspirations."}],"series_title":"Working Papers CIE","user_id":"65453","department":[{"_id":"205"},{"_id":"475"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"15204","file_date_updated":"2019-11-28T10:01:40Z","language":[{"iso":"eng"}],"ddc":["040"],"keyword":["TU-games","duality","core","c-Core","cohesive games","complete game efficiency"],"has_accepted_license":"1","citation":{"ama":"Aslan F, Duman P, Trockel W. <i>Duality for General TU-Games Redefined</i>. Vol 121. CIE Working Paper Series, Paderborn University; 2019.","ieee":"F. Aslan, P. Duman, and W. Trockel, <i>Duality for General TU-games Redefined</i>, vol. 121. CIE Working Paper Series, Paderborn University, 2019.","chicago":"Aslan, Fatma, Papatya Duman, and Walter Trockel. <i>Duality for General TU-Games Redefined</i>. Vol. 121. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2019.","short":"F. Aslan, P. Duman, W. Trockel, Duality for General TU-Games Redefined, CIE Working Paper Series, Paderborn University, 2019.","mla":"Aslan, Fatma, et al. <i>Duality for General TU-Games Redefined</i>. Vol. 121, CIE Working Paper Series, Paderborn University, 2019.","bibtex":"@book{Aslan_Duman_Trockel_2019, series={Working Papers CIE}, title={Duality for General TU-games Redefined}, volume={121}, publisher={CIE Working Paper Series, Paderborn University}, author={Aslan, Fatma and Duman, Papatya and Trockel, Walter}, year={2019}, collection={Working Papers CIE} }","apa":"Aslan, F., Duman, P., &#38; Trockel, W. (2019). <i>Duality for General TU-games Redefined</i> (Vol. 121). CIE Working Paper Series, Paderborn University."},"intvolume":"       121","year":"2019","author":[{"first_name":"Fatma","full_name":"Aslan, Fatma","last_name":"Aslan"},{"full_name":"Duman, Papatya","last_name":"Duman","first_name":"Papatya"},{"first_name":"Walter","last_name":"Trockel","full_name":"Trockel, Walter"}],"date_created":"2019-11-28T10:00:41Z","volume":121,"date_updated":"2022-01-06T06:52:17Z","publisher":"CIE Working Paper Series, Paderborn University","title":"Duality for General TU-games Redefined"},{"date_updated":"2022-01-06T06:51:46Z","author":[{"id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord","first_name":"Björn"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"volume":6,"doi":"10.1145/3364204","publication_status":"published","has_accepted_license":"1","citation":{"ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>","ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>.","short":"B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing (TOPC) 6 (2019).","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019, doi:<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>.","bibtex":"@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem}, volume={6}, DOI={<a href=\"https://doi.org/10.1145/3364204\">10.1145/3364204</a>}, number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2019} }","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem. <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href=\"https://doi.org/10.1145/3364204\">https://doi.org/10.1145/3364204</a>"},"intvolume":"         6","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"13873","user_id":"15504","department":[{"_id":"63"}],"article_number":"14","file_date_updated":"2020-01-24T08:12:58Z","type":"journal_article","status":"public","date_created":"2019-10-16T07:06:22Z","title":"The Mobile Server Problem","issue":"3","year":"2019","ddc":["000"],"language":[{"iso":"eng"}],"publication":"ACM Transactions on Parallel Computing (TOPC)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":633652,"file_id":"15632","access_level":"closed","file_name":"DissertationFeldkord.pdf","date_updated":"2020-01-24T08:12:58Z","date_created":"2020-01-24T08:12:58Z","creator":"florida"}]},{"_id":"13942","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"Proceedings of the 8th International Conference on Operations Research and Enterprise Systems","type":"conference","status":"public","date_updated":"2022-01-06T06:51:47Z","publisher":"SciTePress","author":[{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine","id":"37612"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2019-10-21T13:42:50Z","title":"Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location","doi":"10.5220/0007369503150321","year":"2019","page":"315-321","citation":{"apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i> (pp. 315–321). SciTePress. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>","mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, SciTePress, 2019, pp. 315–21, doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>}, booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp. 315–321.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 2019, pp. 315–321.","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>, 315–21. SciTePress, 2019. <a href=\"https://doi.org/10.5220/0007369503150321\">https://doi.org/10.5220/0007369503150321</a>.","ama":"Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321. doi:<a href=\"https://doi.org/10.5220/0007369503150321\">10.5220/0007369503150321</a>"}},{"date_updated":"2022-01-06T06:51:48Z","date_created":"2019-10-21T13:57:06Z","author":[{"last_name":"Abu-Khzam","full_name":"Abu-Khzam, Faisal N.","first_name":"Faisal N."},{"last_name":"Li","full_name":"Li, Shouwei","first_name":"Shouwei"},{"first_name":"Christine","full_name":"Markarian, Christine","id":"37612","last_name":"Markarian"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"volume":786,"title":"Efficient parallel algorithms for parameterized problems","doi":"10.1016/j.tcs.2018.11.006","year":"2019","citation":{"mla":"Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>.","bibtex":"@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient parallel algorithms for parameterized problems}, volume={786}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>}, journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2019}, pages={2–12} }","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 786 (2019) 2–12.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>, <i>786</i>, 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer Science</i>, vol. 786, pp. 2–12, 2019.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">https://doi.org/10.1016/j.tcs.2018.11.006</a>.","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>. 2019;786:2-12. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.006\">10.1016/j.tcs.2018.11.006</a>"},"intvolume":"       786","page":"2-12","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"13946","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theoretical Computer Science","status":"public"},{"status":"public","publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","type":"conference","language":[{"iso":"eng"}],"_id":"14539","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"477","year":"2019","page":"345-348","citation":{"short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp. 345–48, doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>.","apa":"Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2019:345-348. doi:<a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">10.1007/978-3-030-24922-9\\_26</a>","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, L’Aquila, Italy, 2019, pp. 345–348.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 345–48, 2019. <a href=\"https://doi.org/10.1007/978-3-030-24922-9\\_26\">https://doi.org/10.1007/978-3-030-24922-9\\_26</a>."},"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","conference":{"location":"L'Aquila, Italy","end_date":"2019-07-04","start_date":"2019-07-01","name":"SIROCCO 2019"},"doi":"10.1007/978-3-030-24922-9\\_26","date_updated":"2022-01-06T06:52:00Z","date_created":"2019-11-04T10:09:35Z","author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"publication_identifier":{"issn":["0167-2681"]},"publication_status":"published","year":"2019","page":"469-485","citation":{"apa":"Gu, Y., Hehenkamp, B., &#38; Leininger, W. (2019). Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation. <i>Journal of Economic Behavior &#38; Organization</i>, 469–485. <a href=\"https://doi.org/10.1016/j.jebo.2019.06.011\">https://doi.org/10.1016/j.jebo.2019.06.011</a>","bibtex":"@article{Gu_Hehenkamp_Leininger_2019, title={Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation}, DOI={<a href=\"https://doi.org/10.1016/j.jebo.2019.06.011\">10.1016/j.jebo.2019.06.011</a>}, journal={Journal of Economic Behavior &#38; Organization}, author={Gu, Yiquan and Hehenkamp, Burkhard and Leininger, Wolfgang}, year={2019}, pages={469–485} }","short":"Y. Gu, B. Hehenkamp, W. Leininger, Journal of Economic Behavior &#38; Organization (2019) 469–485.","mla":"Gu, Yiquan, et al. “Evolutionary Equilibrium in Contests with Stochastic Participation: Entry, Effort and Overdissipation.” <i>Journal of Economic Behavior &#38; Organization</i>, 2019, pp. 469–85, doi:<a href=\"https://doi.org/10.1016/j.jebo.2019.06.011\">10.1016/j.jebo.2019.06.011</a>.","ama":"Gu Y, Hehenkamp B, Leininger W. Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation. <i>Journal of Economic Behavior &#38; Organization</i>. 2019:469-485. doi:<a href=\"https://doi.org/10.1016/j.jebo.2019.06.011\">10.1016/j.jebo.2019.06.011</a>","chicago":"Gu, Yiquan, Burkhard Hehenkamp, and Wolfgang Leininger. “Evolutionary Equilibrium in Contests with Stochastic Participation: Entry, Effort and Overdissipation.” <i>Journal of Economic Behavior &#38; Organization</i>, 2019, 469–85. <a href=\"https://doi.org/10.1016/j.jebo.2019.06.011\">https://doi.org/10.1016/j.jebo.2019.06.011</a>.","ieee":"Y. Gu, B. Hehenkamp, and W. Leininger, “Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation,” <i>Journal of Economic Behavior &#38; Organization</i>, pp. 469–485, 2019."},"date_updated":"2022-01-06T06:51:29Z","author":[{"full_name":"Gu, Yiquan","last_name":"Gu","first_name":"Yiquan"},{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"},{"full_name":"Leininger, Wolfgang","last_name":"Leininger","first_name":"Wolfgang"}],"date_created":"2019-09-06T09:28:46Z","title":"Evolutionary equilibrium in contests with stochastic participation: Entry, effort and overdissipation","doi":"10.1016/j.jebo.2019.06.011","publication":"Journal of Economic Behavior & Organization","type":"journal_article","abstract":[{"lang":"eng","text":"This paper examines the evolutionary stability of behaviour in contests where players’ participation can be stochastic. We find, for exogenously given participation probabilities, players exert more effort under the concept of a finite-population evolutionarily stable strategy (FPESS) than under Nash equilibrium (NE). We show that there is ex-ante overdissipation under FPESS for sufficiently large participation probabilities, if, and only if, the impact function is convex. With costly endogenous entry, players enter the contest with a higher probability and exert more effort under FPESS than under NE. Importantly, under endogenous entry, overdissipation can occur for all (Tullock) contest success functions, in particular those with concave impact functions."}],"status":"public","_id":"13148","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"37953","language":[{"iso":"eng"}]},{"title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory","date_created":"2019-09-10T12:48:33Z","publisher":"Springer, Cham","year":"2019","language":[{"iso":"eng"}],"ddc":["000"],"external_id":{"arxiv":["1909.04544"]},"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":428908,"access_level":"closed","file_id":"13188","file_name":"main.pdf","date_updated":"2019-09-11T11:20:16Z","date_created":"2019-09-11T11:20:16Z","creator":"mfeldma2"}],"abstract":[{"text":"We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.   \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n","lang":"eng"}],"publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","doi":"https://doi.org/10.1007/978-3-030-34992-9_13","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"last_name":"Götte","full_name":"Götte, Thorsten","id":"34727","first_name":"Thorsten"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T06:51:30Z","page":"149-164","citation":{"bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Springer, Cham, 2019, pp. 149–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>.","apa":"Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>.","ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2019, pp. 149–164."},"has_accepted_license":"1","file_date_updated":"2019-09-11T11:20:16Z","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"23538","_id":"13182","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901","_id":"1"}],"status":"public","type":"conference"},{"type":"mastersthesis","status":"public","user_id":"16205","_id":"10277","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"language":[{"iso":"other"}],"citation":{"bibtex":"@book{Althaus_2019, place={Universität Paderborn}, title={Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry}, author={Althaus, Steffen}, year={2019} }","short":"S. Althaus, Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry, Universität Paderborn, 2019.","mla":"Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry</i>. 2019.","apa":"Althaus, S. (2019). <i>Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry</i>. Universität Paderborn.","chicago":"Althaus, Steffen. <i>Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry</i>. Universität Paderborn, 2019.","ieee":"S. Althaus, <i>Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry</i>. Universität Paderborn, 2019.","ama":"Althaus S. <i>Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry</i>. Universität Paderborn; 2019."},"year":"2019","place":"Universität Paderborn","author":[{"full_name":"Althaus, Steffen","last_name":"Althaus","first_name":"Steffen"}],"date_created":"2019-06-19T14:59:00Z","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_updated":"2022-01-06T06:50:33Z","title":"Optimizing Sales Channel Performance with Digital Experiments in the Crafting Industry"},{"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","date_created":"2019-06-20T14:46:08Z","title":" From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation","year":"2019","ddc":["004"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems","abstract":[{"text":"Competing firms tend to select similar locations for their stores. This phenomenon, called the principle of minimum differentiation, was captured by Hotelling with a landmark model of spatial competition but is still the object of an ongoing scientific debate. Although consistently observed in practice, many more realistic variants of Hotelling's model fail to support minimum differentiation or do not have pure equilibria at all. In particular, it was recently proven for a generalized model which incorporates negative network externalities and which contains Hotelling's model and classical selfish load balancing as special cases, that the unique equilibria do not adhere to minimum differentiation. Furthermore, it was shown that for a significant parameter range pure equilibria do not exist. We derive a sharp contrast to these previous results by investigating Hotelling's model with negative network externalities from an entirely new angle: approximate pure subgame perfect equilibria. This approach allows us to prove analytically and via agent-based simulations that approximate equilibria having good approximation guarantees and that adhere to minimum differentiation exist for the full parameter range of the model. Moreover, we show that the obtained approximate equilibria have high social welfare.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-08-26T11:10:02Z","date_created":"2019-08-26T11:10:02Z","creator":"ups","file_size":698599,"file_name":"1903.04265.pdf","file_id":"12962","access_level":"closed"}],"date_updated":"2022-01-06T06:50:33Z","author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"full_name":"Lenzner, Pascal ","last_name":"Lenzner","first_name":"Pascal "},{"first_name":"Louise","full_name":"Molitor, Louise","last_name":"Molitor"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3331973"}],"conference":{"name":"18th International Conference on Autonomous Agents and MultiAgent Systems","location":"Montreal QC, Canada"},"publication_status":"published","has_accepted_license":"1","citation":{"ama":"Feldotto M, Lenzner P, Molitor L, Skopalik A.  From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In: <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>. International Foundation for Autonomous Agents and Multiagent Systems; 2019:1949--1951.","ieee":"M. Feldotto, P. Lenzner, L. Molitor, and A. Skopalik, “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation,” in <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, Montreal QC, Canada, 2019, pp. 1949--1951.","chicago":"Feldotto, Matthias, Pascal  Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.","bibtex":"@inproceedings{Feldotto_Lenzner_Molitor_Skopalik_2019, title={ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation}, booktitle={Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Feldotto, Matthias and Lenzner, Pascal  and Molitor, Louise and Skopalik, Alexander}, year={2019}, pages={1949--1951} }","mla":"Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","short":"M. Feldotto, P. Lenzner, L. Molitor, A. Skopalik, in: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.","apa":"Feldotto, M., Lenzner, P., Molitor, L., &#38; Skopalik, A. (2019).  From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. In <i>Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems</i> (pp. 1949--1951). Montreal QC, Canada: International Foundation for Autonomous Agents and Multiagent Systems."},"page":"1949--1951","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"10281","user_id":"477","department":[{"_id":"541"},{"_id":"63"}],"file_date_updated":"2019-08-26T11:10:02Z","type":"conference","status":"public"},{"citation":{"ama":"Gutt D. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität Paderborn; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-688\">10.17619/UNIPB/1-688</a>","ieee":"D. Gutt, <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität Paderborn, 2019.","chicago":"Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität Paderborn, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-688\">https://doi.org/10.17619/UNIPB/1-688</a>.","apa":"Gutt, D. (2019). <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-688\">https://doi.org/10.17619/UNIPB/1-688</a>","bibtex":"@book{Gutt_2019, place={Universität Paderborn}, title={Essays on Drivers and Economic Outcomes of Online-Reviews}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-688\">10.17619/UNIPB/1-688</a>}, author={Gutt, Dominik}, year={2019} }","mla":"Gutt, Dominik. <i>Essays on Drivers and Economic Outcomes of Online-Reviews</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-688\">10.17619/UNIPB/1-688</a>.","short":"D. Gutt, Essays on Drivers and Economic Outcomes of Online-Reviews, Universität Paderborn, 2019."},"year":"2019","place":"Universität Paderborn","has_accepted_license":"1","doi":"10.17619/UNIPB/1-688","title":"Essays on Drivers and Economic Outcomes of Online-Reviews","author":[{"first_name":"Dominik","full_name":"Gutt, Dominik","id":"14368","last_name":"Gutt"}],"date_created":"2019-06-25T09:43:55Z","supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"date_updated":"2022-01-06T06:50:35Z","status":"public","file":[{"date_updated":"2019-07-16T10:58:09Z","date_created":"2019-07-16T10:58:09Z","creator":"florida","file_size":1149237,"file_id":"11960","access_level":"closed","file_name":"DissertationGutt.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"type":"dissertation","file_date_updated":"2019-07-16T10:58:09Z","language":[{"iso":"eng"}],"ddc":["330"],"department":[{"_id":"276"}],"user_id":"15504","_id":"10290","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}]},{"ddc":["330"],"keyword":["retail bundling","leverage theory","double marginalization"],"file_date_updated":"2019-06-28T08:44:52Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"10332","user_id":"53445","department":[{"_id":"280"},{"_id":"475"}],"abstract":[{"text":"We analyze the incentives for retail bundling and the welfare effects of retail bundling in a decentralized distribution channel with two retailers and two monopolistic manufacturers. One manufacturer exclusively sells his good to one retailer, whereas the other manufacturer sells his good to both retailers. Thus, one retailer is a monopolist for one product but competes with the other retailer in the second product market. The two-product retailer has the option to bundle his goods or to sell them separately. We find that bundling aggravates the double marginalization problem for the bundling retailer. Nevertheless, when the retailers compete in prices, bundling can be more profitable than separate selling for the retailer as bundling softens the retail competition. The ultimate outcome depends on the manufacturers’ marginal costs. Given retail quantity competition, however, bundling is in no case the retailer’s best strategy. Furthermore, we show that profitable bundling reduces consumer and producer surplus in the equilibrium.","lang":"eng"}],"file":[{"date_updated":"2019-06-28T08:44:52Z","date_created":"2019-06-28T08:44:52Z","creator":"jheinzel","file_size":375054,"file_name":"WP120.pdf","access_level":"closed","file_id":"10333","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"report","title":"Bundling in a Distribution Channel with Retail Competition","publisher":"CIE Working Paper Series","date_updated":"2022-01-06T06:50:37Z","author":[{"first_name":"Joachim Maria Josef","last_name":"Heinzel","id":"53445","full_name":"Heinzel, Joachim Maria Josef"}],"date_created":"2019-06-28T08:42:49Z","year":"2019","place":"Paderborn University","citation":{"ama":"Heinzel JMJ. <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series; 2019.","chicago":"Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.","ieee":"J. M. J. Heinzel, <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series, 2019.","apa":"Heinzel, J. M. J. (2019). <i>Bundling in a Distribution Channel with Retail Competition</i>. Paderborn University: CIE Working Paper Series.","short":"J.M.J. Heinzel, Bundling in a Distribution Channel with Retail Competition, CIE Working Paper Series, Paderborn University, 2019.","bibtex":"@book{Heinzel_2019, place={Paderborn University}, title={Bundling in a Distribution Channel with Retail Competition}, publisher={CIE Working Paper Series}, author={Heinzel, Joachim Maria Josef}, year={2019} }","mla":"Heinzel, Joachim Maria Josef. <i>Bundling in a Distribution Channel with Retail Competition</i>. CIE Working Paper Series, 2019."},"has_accepted_license":"1"}]