[{"ddc":["000"],"file_date_updated":"2018-11-02T15:37:41Z","language":[{"iso":"eng"}],"_id":"3307","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"department":[{"_id":"183"}],"user_id":"477","status":"public","file":[{"date_updated":"2018-11-02T15:37:41Z","date_created":"2018-11-02T15:37:41Z","creator":"ups","file_size":700352,"file_name":"FrickKaimann.pdf","file_id":"5308","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Applied Economics Letters","type":"journal_article","title":"The impact of customer reviews and advertisement efforts on the performance of experience goods in electronic markets","doi":"10.1080/13504851.2016.1270399","date_updated":"2022-01-06T06:59:10Z","publisher":"Taylor & Francis","volume":24,"author":[{"first_name":"Bernd","last_name":"Frick","full_name":"Frick, Bernd"},{"id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann","first_name":"Daniel"}],"date_created":"2018-06-22T11:25:35Z","year":"2017","intvolume":"        24","page":"1237-1240","citation":{"apa":"Frick, B., &#38; Kaimann, D. (2017). The impact of customer reviews and advertisement efforts on the performance of experience goods in electronic markets. <i>Applied Economics Letters</i>, <i>24</i>(17), 1237–1240. <a href=\"https://doi.org/10.1080/13504851.2016.1270399\">https://doi.org/10.1080/13504851.2016.1270399</a>","bibtex":"@article{Frick_Kaimann_2017, title={The impact of customer reviews and advertisement efforts on the performance of experience goods in electronic markets}, volume={24}, DOI={<a href=\"https://doi.org/10.1080/13504851.2016.1270399\">10.1080/13504851.2016.1270399</a>}, number={17}, journal={Applied Economics Letters}, publisher={Taylor &#38; Francis}, author={Frick, Bernd and Kaimann, Daniel}, year={2017}, pages={1237–1240} }","mla":"Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and Advertisement Efforts on the Performance of Experience Goods in Electronic Markets.” <i>Applied Economics Letters</i>, vol. 24, no. 17, Taylor &#38; Francis, 2017, pp. 1237–40, doi:<a href=\"https://doi.org/10.1080/13504851.2016.1270399\">10.1080/13504851.2016.1270399</a>.","short":"B. Frick, D. Kaimann, Applied Economics Letters 24 (2017) 1237–1240.","chicago":"Frick, Bernd, and Daniel Kaimann. “The Impact of Customer Reviews and Advertisement Efforts on the Performance of Experience Goods in Electronic Markets.” <i>Applied Economics Letters</i> 24, no. 17 (2017): 1237–40. <a href=\"https://doi.org/10.1080/13504851.2016.1270399\">https://doi.org/10.1080/13504851.2016.1270399</a>.","ieee":"B. Frick and D. Kaimann, “The impact of customer reviews and advertisement efforts on the performance of experience goods in electronic markets,” <i>Applied Economics Letters</i>, vol. 24, no. 17, pp. 1237–1240, 2017.","ama":"Frick B, Kaimann D. The impact of customer reviews and advertisement efforts on the performance of experience goods in electronic markets. <i>Applied Economics Letters</i>. 2017;24(17):1237-1240. doi:<a href=\"https://doi.org/10.1080/13504851.2016.1270399\">10.1080/13504851.2016.1270399</a>"},"has_accepted_license":"1","issue":"17"},{"user_id":"477","_id":"3312","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2018-06-22T12:09:27Z","supervisor":[{"full_name":"Frick, Bernd","last_name":"Frick","first_name":"Bernd"},{"first_name":"Daniel","id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann"}],"author":[{"last_name":"Zarindast","full_name":"Zarindast, Mana","id":"18949","first_name":"Mana"}],"date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","title":"The role of eWOM in the movie industry: The effect of online user ratings on box office sales ","citation":{"bibtex":"@book{Zarindast_2017, title={The role of eWOM in the movie industry: The effect of online user ratings on box office sales }, publisher={Universität Paderborn}, author={Zarindast, Mana}, year={2017} }","short":"M. Zarindast, The Role of EWOM in the Movie Industry: The Effect of Online User Ratings on Box Office Sales , Universität Paderborn, 2017.","mla":"Zarindast, Mana. <i>The Role of EWOM in the Movie Industry: The Effect of Online User Ratings on Box Office Sales </i>. Universität Paderborn, 2017.","apa":"Zarindast, M. (2017). <i>The role of eWOM in the movie industry: The effect of online user ratings on box office sales </i>. Universität Paderborn.","chicago":"Zarindast, Mana. <i>The Role of EWOM in the Movie Industry: The Effect of Online User Ratings on Box Office Sales </i>. Universität Paderborn, 2017.","ieee":"M. Zarindast, <i>The role of eWOM in the movie industry: The effect of online user ratings on box office sales </i>. Universität Paderborn, 2017.","ama":"Zarindast M. <i>The Role of EWOM in the Movie Industry: The Effect of Online User Ratings on Box Office Sales </i>. Universität Paderborn; 2017."},"year":"2017"},{"publication":"Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1829552,"file_id":"5987","file_name":"main.pdf","access_level":"closed","date_updated":"2018-11-30T09:47:59Z","date_created":"2018-11-30T09:47:59Z","creator":"melnikov"}],"department":[{"_id":"355"}],"user_id":"15504","_id":"3325","project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-30T09:47:59Z","ddc":["000"],"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>}, booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2017} }","short":"V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, KIT Scientific Publishing, 2017, doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>.","apa":"Melnikov, V., &#38; Hüllermeier, E. (2017). Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>","ieee":"V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics,” in <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, 2017.","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing, 2017. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>.","ama":"Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In: <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing; 2017. doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>"},"year":"2017","author":[{"first_name":"Vitalik","last_name":"Melnikov","full_name":"Melnikov, Vitalik"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"date_created":"2018-06-25T08:14:49Z","publisher":"KIT Scientific Publishing","date_updated":"2022-01-06T06:59:10Z","doi":"10.5445/KSP/1000074341","title":"Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics"},{"citation":{"apa":"Börding, P. (2017). <i>Testing Java Method Contracts</i>. Universität Paderborn.","bibtex":"@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität Paderborn}, author={Börding, Paul}, year={2017} }","mla":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","short":"P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.","ieee":"P. Börding, <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","chicago":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","ama":"Börding P. <i>Testing Java Method Contracts</i>. Universität Paderborn; 2017."},"year":"2017","author":[{"last_name":"Börding","full_name":"Börding, Paul","first_name":"Paul"}],"supervisor":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2018-07-09T09:32:41Z","date_updated":"2022-01-06T06:59:21Z","publisher":"Universität Paderborn","title":"Testing Java Method Contracts","type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"3512","language":[{"iso":"eng"}]},{"date_created":"2018-07-20T13:44:34Z","supervisor":[{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"author":[{"first_name":"Tim","full_name":"Hansmeier, Tim","id":"49992","last_name":"Hansmeier","orcid":"0000-0003-1377-3339"}],"date_updated":"2022-01-06T06:59:25Z","publisher":"Universität Paderborn","title":"An FPGA Accelerator for Checking Resolution Proofs","citation":{"mla":"Hansmeier, Tim. <i>An FPGA Accelerator for Checking Resolution Proofs</i>. Universität Paderborn, 2017.","short":"T. Hansmeier, An FPGA Accelerator for Checking Resolution Proofs, Universität Paderborn, 2017.","bibtex":"@book{Hansmeier_2017, title={An FPGA Accelerator for Checking Resolution Proofs}, publisher={Universität Paderborn}, author={Hansmeier, Tim}, year={2017} }","apa":"Hansmeier, T. (2017). <i>An FPGA Accelerator for Checking Resolution Proofs</i>. Universität Paderborn.","chicago":"Hansmeier, Tim. <i>An FPGA Accelerator for Checking Resolution Proofs</i>. Universität Paderborn, 2017.","ieee":"T. Hansmeier, <i>An FPGA Accelerator for Checking Resolution Proofs</i>. Universität Paderborn, 2017.","ama":"Hansmeier T. <i>An FPGA Accelerator for Checking Resolution Proofs</i>. Universität Paderborn; 2017."},"year":"2017","department":[{"_id":"78"},{"_id":"34"},{"_id":"7"}],"user_id":"3118","_id":"3580","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"file":[{"file_size":463904,"access_level":"closed","file_id":"5286","file_name":"SubtletiesInSecurityDefinition.pdf","date_updated":"2018-11-02T14:52:10Z","date_created":"2018-11-02T14:52:10Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)","ddc":["000"],"language":[{"iso":"eng"}],"year":"2017","title":"Subtleties in Security Definitions for Predicate Encryption with Public Index","publisher":"Springer International Publishing","date_created":"2018-06-04T12:17:48Z","status":"public","type":"conference","file_date_updated":"2018-11-02T14:52:10Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"2967","user_id":"477","series_title":"Lecture Notes in Computer Science","department":[{"_id":"64"}],"place":"Cham","citation":{"ieee":"J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate Encryption with Public Index,” in <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2017, vol. 10693, pp. 438–453.","chicago":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>.","ama":"Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>","mla":"Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.” <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>.","bibtex":"@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption with Public Index}, volume={10693}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">10.1007/978-3-319-72453-9_35</a>}, booktitle={Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}, publisher={Springer International Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453}, collection={Lecture Notes in Computer Science} }","short":"J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.","apa":"Blömer, J., &#38; Liske, G. (2017). Subtleties in Security Definitions for Predicate Encryption with Public Index. In <i>Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-72453-9_35\">https://doi.org/10.1007/978-3-319-72453-9_35</a>"},"intvolume":"     10693","page":"438-453","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319724522","9783319724539"]},"main_file_link":[{"url":"https://eprint.iacr.org/2017/453.pdf","open_access":"1"}],"doi":"10.1007/978-3-319-72453-9_35","date_updated":"2022-01-06T06:58:49Z","oa":"1","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"volume":10693},{"date_created":"2017-10-17T12:41:13Z","title":"Congestion Games with Complementarities","year":"2017","external_id":{"arxiv":["1701.07304"]},"ddc":["040"],"publication":"Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)","abstract":[{"text":"We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.","lang":"eng"}],"file":[{"date_updated":"2018-03-21T13:05:37Z","date_created":"2018-03-21T13:05:37Z","creator":"florida","file_size":264089,"access_level":"closed","file_id":"1566","file_name":"112-FeldottoLederSkopalik2017.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"date_updated":"2022-01-06T06:50:58Z","author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","id":"14052","first_name":"Matthias"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"doi":"10.1007/978-3-319-57586-5_19","has_accepted_license":"1","page":"222--233","citation":{"ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 222--233. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>.","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>. LNCS. ; 2017:222--233. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2017). Congestion Games with Complementarities. In <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i> (pp. 222--233). <a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">https://doi.org/10.1007/978-3-319-57586-5_19</a>","mla":"Feldotto, Matthias, et al. “Congestion Games with Complementarities.” <i>Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)</i>, 2017, pp. 222--233, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_19\">10.1007/978-3-319-57586-5_19</a>}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }"},"_id":"112","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"}],"series_title":"LNCS","user_id":"14052","file_date_updated":"2018-03-21T13:05:37Z","type":"conference","status":"public"},{"title":"Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games","date_created":"2017-10-17T12:41:13Z","year":"2017","language":[{"iso":"eng"}],"ddc":["000"],"external_id":{"arxiv":["1710.01634"]},"file":[{"creator":"feldi","date_created":"2018-10-31T17:01:32Z","date_updated":"2018-10-31T17:01:32Z","file_id":"5231","access_level":"closed","file_name":"Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf","file_size":279055,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].","lang":"eng"}],"publication":"Proceedings of the 13th International Conference on Web and Internet Economics (WINE)","doi":"10.1007/978-3-319-71924-5_14","author":[{"full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias"},{"first_name":"Martin","last_name":"Gairing","full_name":"Gairing, Martin"},{"first_name":"Grammateia","last_name":"Kotsialou","full_name":"Kotsialou, Grammateia"},{"first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T06:50:59Z","citation":{"apa":"Feldotto, M., Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>","mla":"Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>.","bibtex":"@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }","short":"M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.","ieee":"M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017.","chicago":"Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">https://doi.org/10.1007/978-3-319-71924-5_14</a>.","ama":"Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: <i>Proceedings of the 13th International Conference on Web and Internet Economics (WINE)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-71924-5_14\">10.1007/978-3-319-71924-5_14</a>"},"has_accepted_license":"1","file_date_updated":"2018-10-31T17:01:32Z","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"113","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"conference"},{"language":[{"iso":"eng"}],"ddc":["040"],"publication":"NASA Formal Methods: 9th International Symposium","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":492800,"file_name":"114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf","access_level":"closed","file_id":"1565","date_updated":"2018-03-21T13:05:02Z","creator":"florida","date_created":"2018-03-21T13:05:02Z"}],"abstract":[{"text":"Proof witnesses are proof artifacts showing correctness of programs wrt. safety properties. The recent past has seen a rising interest in witnesses as (a) proofs in a proof-carrying-code context, (b) certificates for the correct functioning of verification tools, or simply (c) exchange formats for (partial) verification results. As witnesses in all theses scenarios need to be stored and processed, witnesses are required to be as small as possible. However, software verification tools – the prime suppliers of witnesses – do not necessarily construct small witnesses. In this paper, we present a formal account of proof witnesses. We introduce the concept of weakenings, reducing the complexity of proof witnesses while preserving the ability of witnessing safety. We develop aweakening technique for a specific class of program analyses, and prove it to be sound. Finally, we experimentally demonstrate our weakening technique to indeed achieve a size reduction of proof witnesses.","lang":"eng"}],"date_created":"2017-10-17T12:41:13Z","title":"Compact Proof Witnesses","year":"2017","series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"114","file_date_updated":"2018-03-21T13:05:02Z","type":"conference","status":"public","editor":[{"full_name":"Barrett, Clark","last_name":"Barrett","first_name":"Clark"},{"first_name":"Misty","full_name":"Davies, Misty","last_name":"Davies"},{"first_name":"Temesghen","full_name":"Kahsai, Temesghen","last_name":"Kahsai"}],"author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T06:51:00Z","doi":"10.1007/978-3-319-57288-8_28","has_accepted_license":"1","citation":{"ama":"Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M, Kahsai T, eds. <i>NASA Formal Methods: 9th International Symposium</i>. Lecture Notes in Computer Science. ; 2017:389-403. doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>","ieee":"M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in <i>NASA Formal Methods: 9th International Symposium</i>, 2017, pp. 389–403.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” In <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett, Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>.","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett et al., 2017, pp. 389–403, doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>.","bibtex":"@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Compact Proof Witnesses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>}, booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture Notes in Computer Science} }","short":"M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett, M. Davies, &#38; T. Kahsai (Eds.), <i>NASA Formal Methods: 9th International Symposium</i> (pp. 389–403). <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>"},"page":"389-403"},{"title":"Certification Matters for Service Markets","date_created":"2017-10-17T12:41:14Z","year":"2017","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"access_level":"closed","file_name":"115-JakobsKraemerVanStraatenLettmann2017.pdf","file_id":"1564","file_size":133531,"date_created":"2018-03-21T13:04:12Z","creator":"florida","date_updated":"2018-03-21T13:04:12Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective.","lang":"eng"}],"publication":"The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Julia","full_name":"Krämer, Julia","last_name":"Krämer"},{"last_name":"van Straaten","id":"10311","full_name":"van Straaten, Dirk","first_name":"Dirk"},{"first_name":"Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann","id":"315","full_name":"Lettmann, Theodor"}],"date_updated":"2022-01-06T06:51:02Z","page":"7-12","citation":{"apa":"Jakobs, M.-C., Krämer, J., van Straaten, D., &#38; Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 7–12).","bibtex":"@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }","short":"M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.","mla":"Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12.","ama":"Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2017:7-12.","chicago":"Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.","ieee":"M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2017, pp. 7–12."},"has_accepted_license":"1","file_date_updated":"2018-03-21T13:04:12Z","department":[{"_id":"77"},{"_id":"355"},{"_id":"179"}],"user_id":"477","_id":"115","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","editor":[{"last_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl","full_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz","first_name":"Thomas Prinz"}],"type":"conference"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"78"},{"_id":"7"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"1157","citation":{"short":"L.M. Witschen, A Framework for the Synthesis of Approximate Circuits, Universität Paderborn, 2017.","mla":"Witschen, Linus Matthias. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017.","bibtex":"@book{Witschen_2017, title={A Framework for the Synthesis of Approximate Circuits}, publisher={Universität Paderborn}, author={Witschen, Linus Matthias}, year={2017} }","apa":"Witschen, L. M. (2017). <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn.","ama":"Witschen LM. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn; 2017.","chicago":"Witschen, Linus Matthias. <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017.","ieee":"L. M. Witschen, <i>A Framework for the Synthesis of Approximate Circuits</i>. Universität Paderborn, 2017."},"year":"2017","title":"A Framework for the Synthesis of Approximate Circuits","date_created":"2018-02-01T14:21:19Z","author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"}],"supervisor":[{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"}],"date_updated":"2022-01-06T06:51:03Z","publisher":"Universität Paderborn"},{"type":"dissertation","status":"public","user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"116","citation":{"ieee":"G. Liske, <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017.","chicago":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>.","ama":"Liske G. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>","mla":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>.","bibtex":"@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }","short":"G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.","apa":"Liske, G. (2017). <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>"},"year":"2017","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"author":[{"first_name":"Gennadij","full_name":"Liske, Gennadij","last_name":"Liske"}],"date_created":"2017-10-17T12:41:14Z","date_updated":"2022-01-06T06:51:04Z","publisher":"Universität Paderborn","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690"}],"doi":"10.17619/UNIPB/1-220","title":"CCA-Security for Predicate Encryption Schemes"},{"file_date_updated":"2018-11-02T14:53:56Z","user_id":"477","series_title":"LNCS","department":[{"_id":"7"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1767","status":"public","type":"conference","doi":"10.1007/978-3-319-66700-3_11","conference":{"end_date":"2017-09-14","location":"L'Aquila, Italy","name":"10th International Symposium on Algorithmic Game Theory (SAGT 2017)","start_date":"2017-09-12"},"author":[{"first_name":"Marios","last_name":"Mavronicolas","full_name":"Mavronicolas, Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"volume":10504,"date_updated":"2022-01-06T06:53:16Z","citation":{"bibtex":"@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>}, booktitle={Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017}, pages={131--143}, collection={LNCS} }","mla":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, vol. 10504, 2017, pp. 131--143, doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>.","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143.","apa":"Mavronicolas, M., &#38; Monien, B. (2017). Conditional Value-at-Risk: Structure and Complexity of Equilibria. In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i> (Vol. 10504, pp. 131--143). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>","ama":"Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity of Equilibria. In: <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>. Vol 10504. LNCS. ; 2017:131--143. doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>","ieee":"M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and Complexity of Equilibria,” in <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, L’Aquila, Italy, 2017, vol. 10504, pp. 131--143.","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, 10504:131--143. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>."},"intvolume":"     10504","page":"131--143","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T14:53:56Z","date_created":"2018-11-02T14:53:56Z","creator":"ups","file_size":352365,"file_id":"5287","file_name":"ConditionalValue-at-RiskStruct.pdf","access_level":"closed"}],"abstract":[{"text":"Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain; α∈(0,1) is the confidence level. In this work, we study the strategic equilibria for an economic system modeled as a game, where risk-averse players seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value property: For any best-response of a player, each mixed strategy in the support gives the same cost to the player. This follows directly from the concavity of CVaRα in the involved probabilities, which we establish. (2) The Crawford property: For every α, there is a 2-player game with no CVaRα-equilibrium. The property is established using the Optimal-Value property and a new functional property of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties, we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium is strongly NP-hard even for 2-player games. As our other main result, we show the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player games, for any valuation V with the Optimal-Value and the Crawford properties. This result has a rich potential since we prove that the very significant and broad class of strictly quasiconcave valuations has the Optimal-Value property.","lang":"eng"}],"publication":"Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)","title":"Conditional Value-at-Risk: Structure and Complexity of Equilibria","date_created":"2018-03-23T13:58:02Z","year":"2017"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"date_updated":"2018-11-02T15:04:13Z","date_created":"2018-11-02T15:04:13Z","creator":"ups","file_size":634736,"file_id":"5292","file_name":"Attribute-BasedEncryptionAsASe.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"},{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"5425","file_name":"abe_aas.pdf","file_size":522516,"date_created":"2018-11-08T09:53:34Z","creator":"nilo","date_updated":"2018-11-08T09:53:34Z"}],"publication":"Foundations and Practice of Security","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations","date_created":"2018-04-13T11:40:48Z","publisher":"Springer International Publishing","year":"2017","file_date_updated":"2018-11-08T09:53:34Z","user_id":"13703","department":[{"_id":"64"}],"project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"1","name":"SFB 901"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"2344","status":"public","type":"conference","doi":"10.1007/978-3-319-75650-9_1","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"last_name":"Günther","full_name":"Günther, Peter","first_name":"Peter"},{"last_name":"Krummel","full_name":"Krummel, Volker","first_name":"Volker"},{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"oa":"1","date_updated":"2022-01-06T06:55:55Z","citation":{"apa":"Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>","short":"J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.","bibtex":"@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>}, booktitle={Foundations and Practice of Security}, publisher={Springer International Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}, year={2017}, pages={3–17} }","mla":"Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>.","ama":"Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>","ieee":"J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations and Practice of Security</i>, 2017, pp. 3–17.","chicago":"Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>."},"page":"3-17","place":"Cham","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319756493","9783319756509"]}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18026","citation":{"short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michél }, year={2017} }","mla":"Burkhardt, Michél. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.","ama":"Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn; 2017.","chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017."},"year":"2017","title":"Untersuchungen zum Cone-Hashing","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Michél ","full_name":"Burkhardt, Michél ","last_name":"Burkhardt"}],"date_created":"2020-08-18T08:39:19Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn"},{"citation":{"apa":"Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }","ieee":"N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ama":"Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017."},"year":"2017","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2020-08-18T08:40:19Z","author":[{"first_name":"Ngoc Chi","last_name":"Banh","full_name":"Banh, Ngoc Chi"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","title":"An Asynchronous Adaption of a Churn-resistant Overlay Network","type":"bachelorsthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"18027","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"language":[{"iso":"eng"}]},{"year":"2017","citation":{"short":"A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.","mla":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn.","ieee":"A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","chicago":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","ama":"Schenk A. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn; 2017."},"title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-18T08:41:42Z","author":[{"first_name":"Andreas","last_name":"Schenk","full_name":"Schenk, Andreas"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"18028","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"_id":"18029","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"477","year":"2017","citation":{"bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","mla":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","apa":"Beckendorf, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","ieee":"B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","chicago":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","ama":"Beckendorf B. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn; 2017."},"title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","author":[{"last_name":"Beckendorf","full_name":"Beckendorf, Björn","first_name":"Björn"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-18T08:42:36Z"},{"type":"journal_article","status":"public","_id":"2269","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"204"},{"_id":"205"}],"user_id":"65453","file_date_updated":"2018-10-31T08:21:31Z","has_accepted_license":"1","publication_identifier":{"issn":["0899-8256"]},"publication_status":"published","page":"135-152","intvolume":"       107","citation":{"ieee":"A. Mauleon, N. Roehl, and V. Vannetelbosch, “Constitutions and groups,” <i>Games and Economic Behavior</i>, vol. 107, pp. 135–152, 2017.","chicago":"Mauleon, Ana, Nils Roehl, and Vincent Vannetelbosch. “Constitutions and Groups.” <i>Games and Economic Behavior</i> 107 (2017): 135–52. <a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">https://doi.org/10.1016/j.geb.2017.10.022</a>.","ama":"Mauleon A, Roehl N, Vannetelbosch V. Constitutions and groups. <i>Games and Economic Behavior</i>. 2017;107:135-152. doi:<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>","apa":"Mauleon, A., Roehl, N., &#38; Vannetelbosch, V. (2017). Constitutions and groups. <i>Games and Economic Behavior</i>, <i>107</i>, 135–152. <a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">https://doi.org/10.1016/j.geb.2017.10.022</a>","bibtex":"@article{Mauleon_Roehl_Vannetelbosch_2017, title={Constitutions and groups}, volume={107}, DOI={<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>}, journal={Games and Economic Behavior}, publisher={Elsevier}, author={Mauleon, Ana and Roehl, Nils and Vannetelbosch, Vincent}, year={2017}, pages={135–152} }","mla":"Mauleon, Ana, et al. “Constitutions and Groups.” <i>Games and Economic Behavior</i>, vol. 107, Elsevier, 2017, pp. 135–52, doi:<a href=\"https://doi.org/10.1016/j.geb.2017.10.022\">10.1016/j.geb.2017.10.022</a>.","short":"A. Mauleon, N. Roehl, V. Vannetelbosch, Games and Economic Behavior 107 (2017) 135–152."},"date_updated":"2022-01-06T06:55:38Z","volume":107,"author":[{"first_name":"Ana","full_name":"Mauleon, Ana","last_name":"Mauleon"},{"full_name":"Roehl, Nils","last_name":"Roehl","first_name":"Nils"},{"first_name":"Vincent","last_name":"Vannetelbosch","full_name":"Vannetelbosch, Vincent"}],"doi":"10.1016/j.geb.2017.10.022","publication":"Games and Economic Behavior","file":[{"date_created":"2018-10-31T08:21:31Z","creator":"stela","date_updated":"2018-10-31T08:21:31Z","access_level":"closed","file_name":"Constitutions and groups.pdf","file_id":"5122","file_size":577360,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2017","publisher":"Elsevier","date_created":"2018-04-09T09:25:05Z","title":"Constitutions and groups"},{"language":[{"iso":"ger"}],"department":[{"_id":"19"}],"user_id":"477","_id":"2272","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"status":"public","type":"bachelorsthesis","title":"Signaling und Screening - Abbau von Informationsasymmetrie","date_created":"2018-04-10T09:59:38Z","author":[{"full_name":"Golke, Vanessa","last_name":"Golke","first_name":"Vanessa"}],"date_updated":"2022-01-06T06:55:39Z","publisher":"Universität Paderborn","citation":{"chicago":"Golke, Vanessa. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","ieee":"V. Golke, <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","ama":"Golke V. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn; 2017.","short":"V. Golke, Signaling und Screening - Abbau von Informationsasymmetrie, Universität Paderborn, 2017.","mla":"Golke, Vanessa. <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn, 2017.","bibtex":"@book{Golke_2017, title={Signaling und Screening - Abbau von Informationsasymmetrie}, publisher={Universität Paderborn}, author={Golke, Vanessa}, year={2017} }","apa":"Golke, V. (2017). <i>Signaling und Screening - Abbau von Informationsasymmetrie</i>. Universität Paderborn."},"year":"2017"}]