[{"year":"2015","citation":{"apa":"N, N. (2015). <i>Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren</i>. Universität Paderborn.","short":"N. N, Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren, Universität Paderborn, 2015.","bibtex":"@book{N_2015, title={Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren}, publisher={Universität Paderborn}, author={N, N}, year={2015} }","mla":"N, N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","ieee":"N. N, <i>Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","chicago":"N, N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn, 2015.","ama":"N N. <i>Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine Analyse Mit Dem Adjusted-Winner-Verfahren</i>. Universität Paderborn; 2015."},"title":"Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse mit dem Adjusted-Winner-Verfahren","publisher":"Universität Paderborn","date_updated":"2022-11-30T14:28:44Z","date_created":"2018-11-28T10:00:27Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5926","user_id":"477","department":[{"_id":"205"}]},{"title":"Competitive outcomes and the inner core of NTU market games","date_created":"2018-04-26T10:52:28Z","publisher":"Springer Nature","year":"2014","issue":"3","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"closed","file_id":"3868","file_name":"Competitive outcomes and the inner core of NTU market games.pdf","file_size":391317,"creator":"cjhaake","date_created":"2018-08-09T09:35:19Z","date_updated":"2018-08-09T09:35:19Z"}],"publication":"Economic Theory","doi":"10.1007/s00199-014-0846-7","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"full_name":"Gamp, Jan-Philip","last_name":"Gamp","first_name":"Jan-Philip"}],"volume":57,"date_updated":"2022-01-06T06:56:55Z","citation":{"short":"S. Brangewitz, J.-P. Gamp, Economic Theory 57 (2014) 529–554.","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, vol. 57, no. 3, Springer Nature, 2014, pp. 529–54, doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>.","bibtex":"@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner core of NTU market games}, volume={57}, DOI={<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>}, number={3}, journal={Economic Theory}, publisher={Springer Nature}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2014). Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>, <i>57</i>(3), 529–554. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>","ama":"Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>. 2014;57(3):529-554. doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i> 57, no. 3 (2014): 529–54. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>.","ieee":"S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of NTU market games,” <i>Economic Theory</i>, vol. 57, no. 3, pp. 529–554, 2014."},"intvolume":"        57","page":"529-554","publication_status":"published","publication_identifier":{"issn":["0938-2259","1432-0479"]},"has_accepted_license":"1","file_date_updated":"2018-08-09T09:35:19Z","user_id":"65453","department":[{"_id":"205"},{"_id":"475"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"2522","status":"public","type":"journal_article"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"330","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"280"}],"user_id":"42447","year":"2014","citation":{"apa":"Drigalsky, L. (2014). <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn.","short":"L. Drigalsky, Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse, Universität Paderborn, 2014.","bibtex":"@book{Drigalsky_2014, title={Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse}, publisher={Universität Paderborn}, author={Drigalsky, Liesa}, year={2014} }","mla":"Drigalsky, Liesa. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","ieee":"L. Drigalsky, <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","chicago":"Drigalsky, Liesa. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn, 2014.","ama":"Drigalsky L. <i>Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse</i>. Universität Paderborn; 2014."},"title":"Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse","date_updated":"2022-01-06T06:59:09Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:56Z","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"author":[{"first_name":"Liesa","last_name":"Drigalsky","full_name":"Drigalsky, Liesa"}]},{"citation":{"apa":"Berkemeier, C. (2014). <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn.","bibtex":"@book{Berkemeier_2014, title={Verhandlungen vs Auktionen im Beschäftigungsmanagement}, publisher={Universität Paderborn}, author={Berkemeier, Christopher}, year={2014} }","mla":"Berkemeier, Christopher. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014.","short":"C. Berkemeier, Verhandlungen vs Auktionen im Beschäftigungsmanagement, Universität Paderborn, 2014.","ama":"Berkemeier C. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn; 2014.","ieee":"C. Berkemeier, <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014.","chicago":"Berkemeier, Christopher. <i>Verhandlungen vs Auktionen im Beschäftigungsmanagement</i>. Universität Paderborn, 2014."},"year":"2014","author":[{"last_name":"Berkemeier","full_name":"Berkemeier, Christopher","first_name":"Christopher"}],"date_created":"2017-10-17T12:41:57Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","title":"Verhandlungen vs Auktionen im Beschäftigungsmanagement","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"337","language":[{"iso":"ger"}]},{"date_updated":"2022-01-06T06:59:13Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","_id":"338","date_created":"2017-10-17T12:41:57Z","user_id":"477","author":[{"first_name":"Henri","full_name":"Beck, Henri","last_name":"Beck"}],"title":"Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens","language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2014","citation":{"short":"H. Beck, Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens, Universität Paderborn, 2014.","bibtex":"@book{Beck_2014, title={Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens}, publisher={Universität Paderborn}, author={Beck, Henri}, year={2014} }","mla":"Beck, Henri. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014.","apa":"Beck, H. (2014). <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn.","ama":"Beck H. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn; 2014.","ieee":"H. Beck, <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014.","chicago":"Beck, Henri. <i>Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner Verfahrens</i>. Universität Paderborn, 2014."},"status":"public"},{"status":"public","citation":{"bibtex":"@book{Fang Cheng_2014, title={Two-Sided Market and Game Console Vendors}, publisher={Universität Paderborn}, author={Fang Cheng, Terry}, year={2014} }","short":"T. Fang Cheng, Two-Sided Market and Game Console Vendors, Universität Paderborn, 2014.","mla":"Fang Cheng, Terry. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014.","apa":"Fang Cheng, T. (2014). <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn.","ama":"Fang Cheng T. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn; 2014.","ieee":"T. Fang Cheng, <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014.","chicago":"Fang Cheng, Terry. <i>Two-Sided Market and Game Console Vendors</i>. Universität Paderborn, 2014."},"year":"2014","type":"bachelorsthesis","title":"Two-Sided Market and Game Console Vendors","author":[{"first_name":"Terry","last_name":"Fang Cheng","full_name":"Fang Cheng, Terry"}],"user_id":"477","date_created":"2017-10-17T12:41:58Z","_id":"341","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_updated":"2022-01-06T06:59:14Z","publisher":"Universität Paderborn"},{"type":"dissertation","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:28:26Z","creator":"florida","date_updated":"2018-03-20T07:28:26Z","file_id":"1421","access_level":"closed","file_name":"343-2014_Diss_Kuensemoeller.pdf","file_size":1378657}],"_id":"343","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-20T07:28:26Z","has_accepted_license":"1","year":"2014","citation":{"ama":"Künsemöller J. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn; 2014.","ieee":"J. Künsemöller, <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","chicago":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","short":"J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market, Universität Paderborn, 2014.","bibtex":"@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn}, author={Künsemöller, Jörn}, year={2014} }","mla":"Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.","apa":"Künsemöller, J. (2014). <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market</i>. Universität Paderborn."},"date_updated":"2022-01-06T06:59:16Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"author":[{"full_name":"Künsemöller, Jörn","last_name":"Künsemöller","first_name":"Jörn"}],"date_created":"2017-10-17T12:41:58Z","title":"Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service Market"},{"abstract":[{"lang":"eng","text":"One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet."}],"file":[{"file_size":334101,"access_level":"closed","file_id":"1418","file_name":"346-service_computation_2014_3_10_10005.pdf","date_updated":"2018-03-20T07:26:49Z","creator":"florida","date_created":"2018-03-20T07:26:49Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:26:49Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"346","user_id":"477","department":[{"_id":"205"},{"_id":"76"}],"year":"2014","citation":{"apa":"Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 49–57).","short":"S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.","mla":"Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","bibtex":"@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}, booktitle={Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57} }","ama":"Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2014:49-57.","ieee":"S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services,” in <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","chicago":"Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014."},"page":"49-57","has_accepted_license":"1","title":"Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services","date_updated":"2022-01-06T06:59:18Z","author":[{"full_name":"Brangewitz, Sonja","last_name":"Brangewitz","first_name":"Sonja"},{"last_name":"Jungmann","full_name":"Jungmann, Alexander","first_name":"Alexander"},{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"}],"date_created":"2017-10-17T12:41:59Z"},{"ddc":["040"],"file_date_updated":"2018-03-20T07:24:40Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"350","user_id":"477","department":[{"_id":"183"}],"abstract":[{"text":"Customers continuously evaluate the credibility and reliability of a range of signals both separately and jointly. However, existing econometric studies pay insufficient attention to the interactions and complex combinations of these signals, and are typically limited as a result of difficulties controlling for multicollinearity and endogeneity in their data. We develop a novel theoretical approach to address these issues and study different signaling effects (i.e., word-of-mouth, brand reputation, and distribution strategy) on customer perceptions. Using data on the US video games market, we apply a fuzzy set qualitative comparative analysis (fsQCA) to account for cause-effect relationships. The results of our study address a number of key issues in the economics and management literature. First, our results support the contention that reviews from professional critics act as a signal of product quality and therefore positively influence unit sales, as do the discriminatory effects of prices and restricted age ratings. Second, we find evidence to support the use of brand extension strategies as marketing tools that create spillover effects and support the launch of new products.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1416","access_level":"closed","file_name":"350-SSRN-id2456991.pdf","file_size":739169,"creator":"florida","date_created":"2018-03-20T07:24:40Z","date_updated":"2018-03-20T07:24:40Z"}],"status":"public","type":"report","title":"The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:20Z","author":[{"first_name":"Daniel","last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949"},{"first_name":"Joe","full_name":"Cox, Joe","last_name":"Cox"}],"date_created":"2017-10-17T12:42:00Z","year":"2014","citation":{"apa":"Kaimann, D., &#38; Cox, J. (2014). <i>The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry</i>. Universität Paderborn.","mla":"Kaimann, Daniel, and Joe Cox. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014.","short":"D. Kaimann, J. Cox, The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry, Universität Paderborn, 2014.","bibtex":"@book{Kaimann_Cox_2014, title={The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry}, publisher={Universität Paderborn}, author={Kaimann, Daniel and Cox, Joe}, year={2014} }","ama":"Kaimann D, Cox J. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn; 2014.","ieee":"D. Kaimann and J. Cox, <i>The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014.","chicago":"Kaimann, Daniel, and Joe Cox. <i>The Interaction of Signals: A Fuzzy Set Analysis of the Video Game Industry</i>. Universität Paderborn, 2014."},"has_accepted_license":"1"},{"title":"The Impact of Customer Reviews and Reputation on Hotel Prices","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:20Z","date_created":"2017-10-17T12:42:00Z","author":[{"first_name":"Lena","full_name":"Holzweißig, Lena","last_name":"Holzweißig"}],"year":"2014","citation":{"ama":"Holzweißig L. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn; 2014.","chicago":"Holzweißig, Lena. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014.","ieee":"L. Holzweißig, <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014.","apa":"Holzweißig, L. (2014). <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn.","bibtex":"@book{Holzweißig_2014, title={The Impact of Customer Reviews and Reputation on Hotel Prices}, publisher={Universität Paderborn}, author={Holzweißig, Lena}, year={2014} }","short":"L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices, Universität Paderborn, 2014.","mla":"Holzweißig, Lena. <i>The Impact of Customer Reviews and Reputation on Hotel Prices</i>. Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"351","user_id":"477","status":"public","type":"mastersthesis"},{"supervisor":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"}],"author":[{"first_name":"Friedrich","last_name":"Scheel","full_name":"Scheel, Friedrich"}],"date_created":"2017-10-17T12:42:00Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:21Z","title":"The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments","has_accepted_license":"1","citation":{"short":"F. Scheel, The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments, Universität Paderborn, 2014.","mla":"Scheel, Friedrich. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","bibtex":"@book{Scheel_2014, title={The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments}, publisher={Universität Paderborn}, author={Scheel, Friedrich}, year={2014} }","apa":"Scheel, F. (2014). <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn.","chicago":"Scheel, Friedrich. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","ieee":"F. Scheel, <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn, 2014.","ama":"Scheel F. <i>The Economics of Individual Behavior in Competitive Environments: Empirical Evidence from Real-Life Tournaments</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"477","department":[{"_id":"19"},{"_id":"183"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"352","file_date_updated":"2018-03-20T07:24:10Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"dissertation","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1609436,"file_id":"1415","access_level":"closed","file_name":"352-Diss_Veröffentlichung_Friedrich_Scheel.pdf","date_updated":"2018-03-20T07:24:10Z","creator":"florida","date_created":"2018-03-20T07:24:10Z"}],"status":"public"},{"citation":{"ama":"Ebel O. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn; 2014.","chicago":"Ebel, Olga. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","ieee":"O. Ebel, <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","mla":"Ebel, Olga. <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn, 2014.","short":"O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten, Universität Paderborn, 2014.","bibtex":"@book{Ebel_2014, title={Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten}, publisher={Universität Paderborn}, author={Ebel, Olga}, year={2014} }","apa":"Ebel, O. (2014). <i>Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten</i>. Universität Paderborn."},"year":"2014","author":[{"last_name":"Ebel","full_name":"Ebel, Olga","first_name":"Olga"}],"date_created":"2017-10-17T12:42:01Z","date_updated":"2022-01-06T06:59:25Z","publisher":"Universität Paderborn","title":"Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching Märkten","type":"bachelorsthesis","status":"public","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"357","language":[{"iso":"ger"}]},{"citation":{"chicago":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","ieee":"N. Röhl, <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","ama":"Röhl N. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn; 2014.","short":"N. Röhl, Strategic and Cooperative Games in Network Economics, Universität Paderborn, 2014.","bibtex":"@book{Röhl_2014, title={Strategic and Cooperative Games in Network Economics}, publisher={Universität Paderborn}, author={Röhl, Nils}, year={2014} }","mla":"Röhl, Nils. <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn, 2014.","apa":"Röhl, N. (2014). <i>Strategic and Cooperative Games in Network Economics</i>. Universität Paderborn."},"year":"2014","has_accepted_license":"1","title":"Strategic and Cooperative Games in Network Economics","author":[{"first_name":"Nils","last_name":"Röhl","full_name":"Röhl, Nils"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"date_created":"2017-10-17T12:42:01Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:25Z","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:21:29Z","date_updated":"2018-03-20T07:21:29Z","file_id":"1410","file_name":"358-DissertationRoehl.pdf","access_level":"closed","file_size":1230059}],"type":"dissertation","file_date_updated":"2018-03-20T07:21:29Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"19"},{"_id":"205"}],"user_id":"477","_id":"358","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"year":"2014","citation":{"apa":"Kaiser, S. (2014). <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn.","bibtex":"@book{Kaiser_2014, title={Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al}, publisher={Universität Paderborn}, author={Kaiser, Sarah}, year={2014} }","short":"S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al, Universität Paderborn, 2014.","mla":"Kaiser, Sarah. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014.","ieee":"S. Kaiser, <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014.","chicago":"Kaiser, Sarah. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn, 2014.","ama":"Kaiser S. <i>Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts &#38; Holt und Kübler et. al</i>. Universität Paderborn; 2014."},"title":"Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts & Holt und Kübler et. al","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:27Z","date_created":"2017-10-17T12:42:02Z","author":[{"first_name":"Sarah","full_name":"Kaiser, Sarah","last_name":"Kaiser"}],"supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"362","user_id":"42447","department":[{"_id":"280"}]},{"title":"Routing Games with Progressive Filling","doi":"10.1109/TNET.2015.2468571","date_updated":"2022-01-06T06:59:30Z","author":[{"full_name":"Harks, Tobias","last_name":"Harks","first_name":"Tobias"},{"last_name":"Höfer","full_name":"Höfer, Martin","first_name":"Martin"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_created":"2017-10-17T12:42:04Z","year":"2014","page":"352-360","citation":{"bibtex":"@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }","mla":"Harks, Tobias, et al. “Routing Games with Progressive Filling.” <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–60, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>.","short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.","apa":"Harks, T., Höfer, M., Schewior, K., &#38; Skopalik, A. (2014). Routing Games with Progressive Filling. In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i> (pp. 352–360). <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 352–60, 2014. <a href=\"https://doi.org/10.1109/TNET.2015.2468571\">https://doi.org/10.1109/TNET.2015.2468571</a>.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>, 2014, pp. 352–360.","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: <i>Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)</i>. ; 2014:352-360. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2468571\">10.1109/TNET.2015.2468571</a>"},"has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:17:04Z","_id":"370","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"477","abstract":[{"lang":"eng","text":"Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. "}],"status":"public","file":[{"date_updated":"2018-03-20T07:17:04Z","creator":"florida","date_created":"2018-03-20T07:17:04Z","file_size":179583,"access_level":"closed","file_name":"370-HHSS14.pdf","file_id":"1402","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14)","type":"conference"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"373","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","year":"2014","citation":{"short":"D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014.","bibtex":"@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }","mla":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","apa":"Pahl, D. (2014). <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn.","ama":"Pahl D. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn; 2014.","ieee":"D. Pahl, <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014.","chicago":"Pahl, David. <i>Reputationssysteme für zusammengesetzte Dienstleistungen</i>. Universität Paderborn, 2014."},"title":"Reputationssysteme für zusammengesetzte Dienstleistungen","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:31Z","supervisor":[{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"author":[{"last_name":"Pahl","full_name":"Pahl, David","first_name":"David"}],"date_created":"2017-10-17T12:42:04Z"},{"doi":"10.1109/SCC.2014.35","title":"Provider Competition in Infrastructure-as-a-Service","author":[{"first_name":"Jörn","last_name":"Künsemöller","full_name":"Künsemöller, Jörn"},{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"date_created":"2017-10-17T12:42:06Z","date_updated":"2022-01-06T06:59:37Z","citation":{"mla":"Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.” <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–10, doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>.","bibtex":"@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider Competition in Infrastructure-as-a-Service}, DOI={<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>}, booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake, Claus-Jochen}, year={2014}, pages={203–210} }","short":"J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp. 203–210.","apa":"Künsemöller, J., Brangewitz, S., Karl, H., &#38; Haake, C.-J. (2014). Provider Competition in Infrastructure-as-a-Service. In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i> (pp. 203–210). <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>","ieee":"J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition in Infrastructure-as-a-Service,” in <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 2014, pp. 203–210.","chicago":"Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake. “Provider Competition in Infrastructure-as-a-Service.” In <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>, 203–10, 2014. <a href=\"https://doi.org/10.1109/SCC.2014.35\">https://doi.org/10.1109/SCC.2014.35</a>.","ama":"Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service. In: <i>Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)</i>. ; 2014:203-210. doi:<a href=\"https://doi.org/10.1109/SCC.2014.35\">10.1109/SCC.2014.35</a>"},"page":"203-210","year":"2014","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:34:46Z","ddc":["004"],"user_id":"477","department":[{"_id":"75"},{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"382","file":[{"date_created":"2018-11-02T13:34:46Z","creator":"ups","date_updated":"2018-11-02T13:34:46Z","file_id":"5250","file_name":"06930535.pdf","access_level":"closed","file_size":228172,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"This paper explores how cloud provider competition influences instance pricing in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing includes an on-demand price component in addition to a reservation fee (two-part tariffs), different providers might offer different price combinations, where the client’s choice depends on its load profile. We investigate a duopoly of providers and analyze stable market prices in two-part tariffs. Further, we study offers that allow a specified amount of included usage (three-part tariffs). Neither two-part nor three-part tariffs produce an equilibrium market outcome other than a service pricing that equals production cost, i.e., complex price structures do not significantly affect the results from ordinary Bertrand competition.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 2014 IEEE International Conference on Services Computing (SCC)"},{"date_created":"2017-10-17T12:42:18Z","author":[{"last_name":"Mauleon","full_name":"Mauleon, Ana","first_name":"Ana"},{"last_name":"Röhl","full_name":"Röhl, Nils","first_name":"Nils"},{"full_name":"Vannetelbosch, Vincent","last_name":"Vannetelbosch","first_name":"Vincent"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:03Z","title":"Constitutions and Social Networks","has_accepted_license":"1","citation":{"apa":"Mauleon, A., Röhl, N., &#38; Vannetelbosch, V. (2014). <i>Constitutions and Social Networks</i>. Universität Paderborn.","bibtex":"@book{Mauleon_Röhl_Vannetelbosch_2014, title={Constitutions and Social Networks}, publisher={Universität Paderborn}, author={Mauleon, Ana and Röhl, Nils and Vannetelbosch, Vincent}, year={2014} }","short":"A. Mauleon, N. Röhl, V. Vannetelbosch, Constitutions and Social Networks, Universität Paderborn, 2014.","mla":"Mauleon, Ana, et al. <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","chicago":"Mauleon, Ana, Nils Röhl, and Vincent Vannetelbosch. <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","ieee":"A. Mauleon, N. Röhl, and V. Vannetelbosch, <i>Constitutions and Social Networks</i>. Universität Paderborn, 2014.","ama":"Mauleon A, Röhl N, Vannetelbosch V. <i>Constitutions and Social Networks</i>. Universität Paderborn; 2014."},"year":"2014","user_id":"477","department":[{"_id":"205"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"443","language":[{"iso":"eng"}],"file_date_updated":"2018-03-16T11:28:04Z","ddc":["040"],"type":"report","file":[{"file_size":409720,"file_name":"443-WP74.pdf","file_id":"1350","access_level":"closed","date_updated":"2018-03-16T11:28:04Z","creator":"florida","date_created":"2018-03-16T11:28:04Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"The objective of this paper is to analyze the formation of group structures where individuals are allowed to engage in several groups at the same time. These structures are interpreted here as social networks. Each of the groups is supposed to have specific rules or constitutions governing which members may join or leave it. A social network is then considered to be stable if none of the groups is altered any more. Given this framework, we not only analyze which influence the constitutions have on network formation but we also provide requirements under which stable networks are induced for sure. Furthermore, by embedding many-to-many matchings into our setting, we apply our model to job markets with labor unions. To some extent the unions may provide job guarantees and, therefore, have influence on the stability of the job market.","lang":"eng"}]},{"doi":"10.1007/s00199-014-0846-7","title":"Competitive outcomes and the inner core of NTU market games","date_created":"2017-10-17T12:42:18Z","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"first_name":"Jan-Philip","full_name":"Gamp, Jan-Philip","last_name":"Gamp"}],"publisher":"Springer","date_updated":"2022-01-06T07:01:04Z","page":"529-554","citation":{"apa":"Brangewitz, S., &#38; Gamp, J.-P. (2014). Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>, (3), 529–554. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>","short":"S. Brangewitz, J.-P. Gamp, Economic Theory (2014) 529–554.","bibtex":"@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner core of NTU market games}, DOI={<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>}, number={3}, journal={Economic Theory}, publisher={Springer}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, no. 3, Springer, 2014, pp. 529–54, doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>.","ama":"Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market games. <i>Economic Theory</i>. 2014;(3):529-554. doi:<a href=\"https://doi.org/10.1007/s00199-014-0846-7\">10.1007/s00199-014-0846-7</a>","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner Core of NTU Market Games.” <i>Economic Theory</i>, no. 3 (2014): 529–54. <a href=\"https://doi.org/10.1007/s00199-014-0846-7\">https://doi.org/10.1007/s00199-014-0846-7</a>.","ieee":"S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of NTU market games,” <i>Economic Theory</i>, no. 3, pp. 529–554, 2014."},"year":"2014","issue":"3","has_accepted_license":"1","file_date_updated":"2018-03-16T11:27:32Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"205"}],"user_id":"477","_id":"445","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:27:32Z","creator":"florida","date_updated":"2018-03-16T11:27:32Z","access_level":"closed","file_id":"1349","file_name":"445-Brangewitz_and_Gamp__2014__-_Competitive_outcomes_and_the_inner_core_of_NTU_market_games.pdf","file_size":391317}],"abstract":[{"text":"We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to payoffs of competitive equilibria of markets that are induced by NTU games. An NTU game is an NTU market game if there exists a market such that the set of utility allocations a coalition can achieve in the market coincides with the set of utility allocations the coalition can achieve in the game. In this paper, we introduce a new construction of a market based on a closed subset of the inner core which satisfies a strict positive separability. We show that the constructed market represents the NTU game and, further, has the given closed set as the set of payoff vectors of competitive equilibria. It turns out that this market is not uniquely determined, and thus, we obtain a class of markets. Our results generalize those relating to competitive outcomes of NTU market games in the literature.","lang":"eng"}],"publication":"Economic Theory","type":"journal_article"},{"type":"conference","publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","editor":[{"first_name":"Ron","last_name":"Lavi","full_name":"Lavi, Ron"}],"abstract":[{"lang":"eng","text":"We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to be shared between the tasks. We study strategic budget games, where the budget is shared proportionally. We also consider a variant in which the order of the strategic decisions influences the distribution of the budgets. The complexity of the optimal solution as well as existence, complexity and quality of equilibria are analysed. Finally, we show that the time an ordered budget game needs to convergence towards an equilibrium may be exponential."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:25:10Z","date_updated":"2018-03-16T11:25:10Z","file_id":"1344","access_level":"closed","file_name":"451-DRS14.pdf","file_size":283266}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"451","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"63"},{"_id":"541"}],"ddc":["040"],"file_date_updated":"2018-03-16T11:25:10Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2014","citation":{"apa":"Drees, M., Riechers, S., &#38; Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 110–121). <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>","bibtex":"@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes in Computer Science} }","mla":"Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, pp. 110–21, doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>.","short":"M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.","ama":"Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2014:110-121. doi:<a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">10.1007/978-3-662-44803-8_10</a>","chicago":"Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44803-8_10\">https://doi.org/10.1007/978-3-662-44803-8_10</a>.","ieee":"M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, pp. 110–121."},"page":"110-121","date_updated":"2022-01-06T07:01:07Z","date_created":"2017-10-17T12:42:20Z","author":[{"full_name":"Drees, Maximilian","last_name":"Drees","first_name":"Maximilian"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik","first_name":"Alexander"}],"title":"Budget-restricted utility games with ordered strategic decisions","doi":"10.1007/978-3-662-44803-8_10"}]