[{"department":[{"_id":"208"},{"_id":"282"}],"type":"book_chapter","date_created":"2018-09-19T11:39:06Z","place":"New York","extern":"1","citation":{"short":"T. Jenert, in: T. Škerlak, H. Kaufmann, G. Bachmann (Eds.), Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen , Waxmann Verlag GmbH , New York, 2014, pp. 159–175.","chicago":"Jenert, Tobias. “Verändern Medien Die Lernkultur? Mögliche Rollen von Technologie Zwischen Virtuellen Und Physischen Lernräumen.” In <i>Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen </i>, edited by Tina  Škerlak, Helen Kaufmann, and Gudrun Bachmann, Band 66:159–75. Medien in Der Wissenschaft . New York: Waxmann Verlag GmbH , 2014.","apa":"Jenert, T. (2014). Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen. In T. Škerlak, H. Kaufmann, &#38; G. Bachmann (Eds.), <i>Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen </i> (Vol. Band 66, pp. 159–175). New York: Waxmann Verlag GmbH .","ieee":"T. Jenert, “Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen,” in <i>Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen </i>, vol. Band 66, T. Škerlak, H. Kaufmann, and G. Bachmann, Eds. New York: Waxmann Verlag GmbH , 2014, pp. 159–175.","ama":"Jenert T. Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen. In: Škerlak T, Kaufmann H, Bachmann G, eds. <i>Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen </i>. Vol Band 66. Medien in der Wissenschaft . New York: Waxmann Verlag GmbH ; 2014:159-175.","bibtex":"@inbook{Jenert_2014, place={New York}, series={Medien in der Wissenschaft }, title={Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen}, volume={Band 66}, booktitle={Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen }, publisher={Waxmann Verlag GmbH }, author={Jenert, Tobias}, editor={Škerlak, Tina  and Kaufmann, Helen and Bachmann, GudrunEditors}, year={2014}, pages={159–175}, collection={Medien in der Wissenschaft } }","mla":"Jenert, Tobias. “Verändern Medien Die Lernkultur? Mögliche Rollen von Technologie Zwischen Virtuellen Und Physischen Lernräumen.” <i>Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen </i>, edited by Tina  Škerlak et al., vol. Band 66, Waxmann Verlag GmbH , 2014, pp. 159–75."},"publication":"Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen ","volume":"Band 66","editor":[{"last_name":"Škerlak","first_name":"Tina ","full_name":"Škerlak, Tina "},{"last_name":"Kaufmann","first_name":"Helen","full_name":"Kaufmann, Helen"},{"full_name":"Bachmann, Gudrun","last_name":"Bachmann","first_name":"Gudrun"}],"user_id":"51057","series_title":"Medien in der Wissenschaft ","_id":"4508","publisher":"Waxmann Verlag GmbH ","page":"159-175","date_updated":"2022-01-06T07:01:07Z","publication_identifier":{"isbn":["978-3-8309-3056-3"]},"author":[{"orcid":" https://orcid.org/0000-0001-9262-5646","first_name":"Tobias","last_name":"Jenert","full_name":"Jenert, Tobias","id":"71994"}],"year":"2014","status":"public","title":"Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file_date_updated":"2018-03-16T11:25:10Z","citation":{"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.","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>","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>.","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} }","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>","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.","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>."},"ddc":["040"],"user_id":"477","editor":[{"full_name":"Lavi, Ron","last_name":"Lavi","first_name":"Ron"}],"page":"110-121","_id":"451","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file":[{"file_id":"1344","success":1,"content_type":"application/pdf","file_name":"451-DRS14.pdf","access_level":"closed","file_size":283266,"relation":"main_file","date_updated":"2018-03-16T11:25:10Z","date_created":"2018-03-16T11:25:10Z","creator":"florida"}],"date_created":"2017-10-17T12:42:20Z","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."}],"publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","doi":"10.1007/978-3-662-44803-8_10","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T07:01:07Z","year":"2014","title":"Budget-restricted utility games with ordered strategic decisions","author":[{"full_name":"Drees, Maximilian","last_name":"Drees","first_name":"Maximilian"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik","id":"40384"}]},{"abstract":[{"text":"Today's networks, like the Internet, do not consist of one but a mixture of several interconnected networks. Each has individual qualities and hence the performance of a network node results from the networks' interplay.We introduce a new game theoretic model capturing the interplay between a high-speed backbone network and a low-speed general purpose network. In our model, n nodes are connected by a static network and each node can decide individually to become a gateway node. A gateway node pays a fixed price for its connection to the high-speed network, but can utilize the high-speed network to gain communication distance 0 to all other gateways. Communication distances in the low-speed network are given by the hop distances. The effective communication distance between any two nodes then is given by the shortest path, which is possibly improved by using gateways as shortcuts.Every node v has the objective to minimize its communication costs, given by the sum (SUM-game) or maximum (MAX-game) of the effective communication distances from v to all other nodes plus a fixed price \\alpha > 0, if it decides to be a gateway. For both games and different ranges of \\alpha, we study the existence of equilibria, the price of anarchy, and convergence properties of best-response dynamics.","lang":"eng"}],"publication":"Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file":[{"date_created":"2018-03-16T11:24:40Z","creator":"florida","file_id":"1343","success":1,"content_type":"application/pdf","file_name":"452-title_multilevel-sagt.pdf","file_size":84783,"access_level":"closed","relation":"main_file","date_updated":"2018-03-16T11:24:40Z"}],"date_created":"2017-10-17T12:42:20Z","date_updated":"2022-01-06T07:01:08Z","title":"Brief Announcement: A Model for Multilevel Network Games","year":"2014","author":[{"last_name":"Abshoff","first_name":"Sebastian","full_name":"Abshoff, Sebastian"},{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"id":"37827","last_name":"Jung","first_name":"Daniel","full_name":"Jung, Daniel"},{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"series_title":"LNCS","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-16T11:24:40Z","citation":{"ieee":"S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, p. 294.","apa":"Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (p. 294).","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 294. LNCS, 2014.","short":"S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p. 294.","mla":"Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited by Ron Lavi, 2014, p. 294.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS}, title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander}, editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }","ama":"Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294."},"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15415","editor":[{"first_name":"Ron","last_name":"Lavi","full_name":"Lavi, Ron"}],"page":"294","_id":"452"},{"date_updated":"2022-01-06T07:01:09Z","year":"2014","title":"Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria","author":[{"id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias","last_name":"Feldotto","orcid":"0000-0003-1348-6516"},{"full_name":"Gairing, Martin","last_name":"Gairing","first_name":"Martin"},{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"doi":"10.1007/978-3-319-13129-0_3","series_title":"LNCS","abstract":[{"text":"In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as well as games with non-increasing utility functions. We show that the value of the potential function $\\Phi(\\sf s)$ of any outcome $\\sf s$ of a congestion game approximates the optimum potential value $\\Phi(\\sf s^*)$ by a factor $\\Psi_{\\mathcal{F}}$ which only depends on the set of cost/utility functions $\\mathcal{F}$, and an additive term which is bounded by the sum of the total possible improvements of the players in the outcome $\\sf s$. The significance of this result is twofold. On the one hand it provides \\emph{Price-of-Anarchy}-like results with respect to the potential function. On the other hand, we show that these approximations can be used to compute $(1+\\varepsilon)\\cdot\\Psi_{\\mathcal{F}}$-approximate pure Nash equilibria for congestion games with non-decreasing cost functions. For the special case of polynomial cost functions, this significantly improves the guarantees from Caragiannis et al. [FOCS 2011]. Moreover, our machinery provides the first guarantees for general latency functions.","lang":"eng"}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","type":"conference","department":[{"_id":"63"},{"_id":"541"}],"file":[{"date_created":"2018-03-16T11:24:11Z","creator":"florida","file_id":"1342","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:24:11Z","file_name":"453-WINE14FGS.pdf","file_size":324307,"access_level":"closed"}],"date_created":"2017-10-17T12:42:20Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14052","page":"30-43","_id":"453","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Teilprojekt A","_id":"2"},{"name":"SFB 901 - Subprojekt A3","_id":"7"}],"file_date_updated":"2018-03-16T11:24:11Z","citation":{"ama":"Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:30-43. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>","bibtex":"@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Skopalik, Alexander}, year={2014}, pages={30–43}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">10.1007/978-3-319-13129-0_3</a>.","short":"M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.","chicago":"Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 30–43. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>.","apa":"Feldotto, M., Gairing, M., &#38; Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 30–43). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_3\">https://doi.org/10.1007/978-3-319-13129-0_3</a>","ieee":"M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 30–43."}},{"_id":"4534","user_id":"51057","title":"Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha","status":"public","year":"2014","author":[{"full_name":"Jenert, Tobias","first_name":"Tobias","orcid":" https://orcid.org/0000-0001-9262-5646","last_name":"Jenert","id":"71994"}],"conference":{"name":" Impulsvortrag an der zweiten Lehr-/Lernkonferenz des Fellowship-Programms für innovative Lehre","location":"Berlin"},"date_updated":"2022-01-06T07:01:09Z","date_created":"2018-09-20T09:21:16Z","type":"conference","department":[{"_id":"208"},{"_id":"282"}],"citation":{"mla":"Jenert, Tobias. <i>Viel Neues Und Doch Keine Innovation!?: Fünf Thesen, Warum Es Die Lehrentwicklung an Hochschulen Schwer Ha</i>. 2014.","bibtex":"@inproceedings{Jenert_2014, title={Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha}, author={Jenert, Tobias}, year={2014} }","ama":"Jenert T. Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha. In: ; 2014.","ieee":"T. Jenert, “Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha,” presented at the  Impulsvortrag an der zweiten Lehr-/Lernkonferenz des Fellowship-Programms für innovative Lehre, Berlin, 2014.","apa":"Jenert, T. (2014). Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha. Presented at the  Impulsvortrag an der zweiten Lehr-/Lernkonferenz des Fellowship-Programms für innovative Lehre, Berlin.","short":"T. Jenert, in: 2014.","chicago":"Jenert, Tobias. “Viel Neues Und Doch Keine Innovation!?: Fünf Thesen, Warum Es Die Lehrentwicklung an Hochschulen Schwer Ha,” 2014."},"extern":"1"},{"citation":{"bibtex":"@inproceedings{Brahm_Jenert_2014, title={Change Management in Higher Education Institutions}, author={Brahm, Taiga and Jenert, Tobias}, year={2014} }","ama":"Brahm T, Jenert T. Change Management in Higher Education Institutions. In: ; 2014.","mla":"Brahm, Taiga, and Tobias Jenert. <i>Change Management in Higher Education Institutions</i>. 2014.","chicago":"Brahm, Taiga, and Tobias Jenert. “Change Management in Higher Education Institutions,” 2014.","short":"T. Brahm, T. Jenert, in: 2014.","ieee":"T. Brahm and T. Jenert, “Change Management in Higher Education Institutions,” presented at the Workshop held at ICED 2014, Stockholm , 2014.","apa":"Brahm, T., &#38; Jenert, T. (2014). Change Management in Higher Education Institutions. Presented at the Workshop held at ICED 2014, Stockholm ."},"extern":"1","date_created":"2018-09-20T09:23:55Z","type":"conference","department":[{"_id":"208"},{"_id":"282"}],"title":"Change Management in Higher Education Institutions","year":"2014","status":"public","conference":{"name":"Workshop held at ICED 2014","location":"Stockholm "},"author":[{"full_name":"Brahm, Taiga","last_name":"Brahm","first_name":"Taiga"},{"last_name":"Jenert","first_name":"Tobias","orcid":" https://orcid.org/0000-0001-9262-5646","full_name":"Jenert, Tobias","id":"71994"}],"date_updated":"2022-01-06T07:01:09Z","_id":"4535","user_id":"51057"},{"type":"mastersthesis","date_created":"2017-10-17T12:42:20Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"mla":"Heldt, Waleri. <i>Automated Service Composition: Adaption of the ASTRO Approach</i>. Universität Paderborn, 2014.","ama":"Heldt W. <i>Automated Service Composition: Adaption of the ASTRO Approach</i>. Universität Paderborn; 2014.","bibtex":"@book{Heldt_2014, title={Automated Service Composition: Adaption of the ASTRO Approach}, publisher={Universität Paderborn}, author={Heldt, Waleri}, year={2014} }","apa":"Heldt, W. (2014). <i>Automated Service Composition: Adaption of the ASTRO Approach</i>. Universität Paderborn.","ieee":"W. Heldt, <i>Automated Service Composition: Adaption of the ASTRO Approach</i>. Universität Paderborn, 2014.","short":"W. Heldt, Automated Service Composition: Adaption of the ASTRO Approach, Universität Paderborn, 2014.","chicago":"Heldt, Waleri. <i>Automated Service Composition: Adaption of the ASTRO Approach</i>. Universität Paderborn, 2014."},"user_id":"15504","_id":"454","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:09Z","status":"public","title":"Automated Service Composition: Adaption of the ASTRO Approach","year":"2014","author":[{"full_name":"Heldt, Waleri","first_name":"Waleri","last_name":"Heldt"}]},{"publication":"Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)","abstract":[{"text":"We study the existence of approximate pure Nash equilibria in weighted congestion games and develop techniques to obtain approximate potential functions that prove the existence of alpha-approximate pure Nash equilibria and the convergence of alpha-improvement steps. Specifically, we show how to obtain upper bounds for approximation factor alpha for a given class of cost functions. For example for concave cost functions the factor is at most 3/2, for quadratic cost functions it is at most 4/3, and for polynomial cost functions of maximal degree d it is at at most d + 1. For games with two players we obtain tight bounds which are as small as for example 1.054 in the case of quadratic cost functions.","lang":"eng"}],"date_created":"2017-10-17T12:42:20Z","file":[{"relation":"main_file","date_updated":"2018-03-16T11:23:40Z","file_name":"455-HKS14.pdf","access_level":"closed","file_size":512712,"file_id":"1341","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-16T11:23:40Z"}],"department":[{"_id":"541"},{"_id":"63"}],"type":"conference","author":[{"first_name":"Christoph","last_name":"Hansknecht","full_name":"Hansknecht, Christoph"},{"full_name":"Klimm, Max","first_name":"Max","last_name":"Klimm"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"year":"2014","title":"Approximate pure Nash equilibria in weighted congestion games","date_updated":"2022-01-06T07:01:09Z","language":[{"iso":"eng"}],"series_title":"LIPIcs","doi":"10.4230/LIPIcs.APPROX-RANDOM.2014.242","citation":{"chicago":"Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 242–57. LIPIcs, 2014. <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>.","short":"C. Hansknecht, M. Klimm, A. Skopalik, in: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257.","apa":"Hansknecht, C., Klimm, M., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i> (pp. 242–257). <a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>","ieee":"C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–257.","ama":"Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>. LIPIcs. ; 2014:242-257. doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>","bibtex":"@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>}, booktitle={Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)}, author={Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander}, year={2014}, pages={242–257}, collection={LIPIcs} }","mla":"Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” <i>Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)</i>, 2014, pp. 242–57, doi:<a href=\"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242\">10.4230/LIPIcs.APPROX-RANDOM.2014.242</a>."},"file_date_updated":"2018-03-16T11:23:40Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","has_accepted_license":"1","_id":"455","page":"242 - 257","user_id":"477","ddc":["040"]},{"file_date_updated":"2018-03-16T11:22:57Z","citation":{"apa":"Gairing, M., Kotsialou, G., &#38; Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i> (pp. 480–485). <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>","ieee":"M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” in <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–485.","chicago":"Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 480–85. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">https://doi.org/10.1007/978-3-319-13129-0_43</a>.","short":"M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.","mla":"Gairing, Martin, et al. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>, 2014, pp. 480–85, doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>.","ama":"Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: <i>Proceedings of the 10th International Conference on Web and Internet Economics (WINE)</i>. LNCS. ; 2014:480-485. doi:<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>","bibtex":"@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-13129-0_43\">10.1007/978-3-319-13129-0_43</a>}, booktitle={Proceedings of the 10th International Conference on Web and Internet Economics (WINE)}, author={Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2014}, pages={480–485}, collection={LNCS} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"page":"480 - 485","_id":"456","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","file":[{"creator":"florida","date_created":"2018-03-16T11:22:57Z","file_name":"456-WINE14final.pdf","file_size":377378,"access_level":"closed","relation":"main_file","date_updated":"2018-03-16T11:22:57Z","file_id":"1340","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:42:21Z","type":"conference","department":[{"_id":"541"},{"_id":"63"}],"publication":"Proceedings of the 10th International Conference on Web and Internet Economics (WINE)","abstract":[{"lang":"eng","text":"We study the existence of approximate pure Nash equilibriain social context congestion games. For any given set of allowed costfunctions F, we provide a threshold value μ(F), and show that for theclass of social context congestion games with cost functions from F, α-Nash dynamics are guaranteed to converge to α-approximate pure Nashequilibrium if and only if α > μ(F).Interestingly, μ(F) is related and always upper bounded by Roughgarden’sanarchy value [19]."}],"series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-13129-0_43","title":"Approximate pure Nash equilibria in Social Context Congestion Games","year":"2014","author":[{"full_name":"Gairing, Martin","last_name":"Gairing","first_name":"Martin"},{"last_name":"Kotsialou","first_name":"Grammateia","full_name":"Kotsialou, Grammateia"},{"id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander","last_name":"Skopalik"}],"date_updated":"2022-01-06T07:01:10Z"},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"page":"105-112","_id":"457","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-16T11:22:26Z","citation":{"mla":"Jungmann, Alexander, et al. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2014, pp. 105–12, doi:<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>.","bibtex":"@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>}, booktitle={Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)}, author={Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd }, year={2014}, pages={105–112} }","ama":"Jungmann A, Mohr F, Kleinjohann B. Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In: <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>. ; 2014:105-112. doi:<a href=\"https://doi.org/10.1109/SOCA.2014.48\">10.1109/SOCA.2014.48</a>","ieee":"A. Jungmann, F. Mohr, and B. Kleinjohann, “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition,” in <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2014, pp. 105–112.","apa":"Jungmann, A., Mohr, F., &#38; Kleinjohann, B. (2014). Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i> (pp. 105–112). <a href=\"https://doi.org/10.1109/SOCA.2014.48\">https://doi.org/10.1109/SOCA.2014.48</a>","short":"A. Jungmann, F. Mohr, B. Kleinjohann, in: Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–112.","chicago":"Jungmann, Alexander, Felix Mohr, and Bernd  Kleinjohann. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” In <i>Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 105–12, 2014. <a href=\"https://doi.org/10.1109/SOCA.2014.48\">https://doi.org/10.1109/SOCA.2014.48</a>."},"date_updated":"2022-01-06T07:01:12Z","year":"2014","title":"Applying Reinforcement Learning for Resolving Ambiguity in Service Composition","author":[{"last_name":"Jungmann","first_name":"Alexander","full_name":"Jungmann, Alexander"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"full_name":"Kleinjohann, Bernd ","first_name":"Bernd ","last_name":"Kleinjohann"}],"doi":"10.1109/SOCA.2014.48","language":[{"iso":"eng"}],"abstract":[{"text":"Automatically composing service-based software solutionsis still a challenging task. Functional as well as nonfunctionalproperties have to be considered in order to satisfyindividual user requests. Regarding non-functional properties,the composition process can be modeled as optimization problemand solved accordingly. Functional properties, in turn, can bedescribed by means of a formal specification language. Statespacebased planning approaches can then be applied to solvethe underlying composition problem. However, depending on theexpressiveness of the applied formalism and the completenessof the functional descriptions, formally equivalent services maystill differ with respect to their implemented functionality. As aconsequence, the most appropriate solution for a desired functionalitycan hardly be determined without considering additionalinformation. In this paper, we demonstrate how to overcome thislack of information by means of Reinforcement Learning. Inorder to resolve ambiguity, we expand state-space based servicecomposition by a recommendation mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism adjusts its recommendation strategy basedon feedback from previous composition runs. Image processingserves as case study. Experimental results show the benefit of ourproposed solution.","lang":"eng"}],"publication":"Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)","type":"conference","department":[{"_id":"355"}],"file":[{"file_id":"1339","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-16T11:22:26Z","file_name":"457-SOCA2014-Jungmann-Mohr.pdf","access_level":"closed","file_size":1324374,"date_created":"2018-03-16T11:22:26Z","creator":"florida"}],"date_created":"2017-10-17T12:42:21Z"},{"date_updated":"2022-01-06T07:01:13Z","title":"Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic","status":"public","year":"2014","author":[{"first_name":"Philipp","last_name":"Dreimann","full_name":"Dreimann, Philipp"}],"user_id":"15504","publisher":"Universität Paderborn","_id":"458","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","ama":"Dreimann P. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn; 2014.","bibtex":"@book{Dreimann_2014, title={Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic}, publisher={Universität Paderborn}, author={Dreimann, Philipp}, year={2014} }","apa":"Dreimann, P. (2014). <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn.","ieee":"P. Dreimann, <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","chicago":"Dreimann, Philipp. <i>Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic</i>. Universität Paderborn, 2014.","short":"P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014."},"type":"mastersthesis","department":[{"_id":"75"}],"date_created":"2017-10-17T12:42:21Z"},{"author":[{"last_name":"Kniesburges","first_name":"Sebastian","full_name":"Kniesburges, Sebastian"},{"last_name":"Markarian","first_name":"Christine","full_name":"Markarian, Christine","id":"37612"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"title":"Algorithmic Aspects of Resource Management in the Cloud","year":"2014","date_updated":"2022-01-06T07:01:14Z","series_title":"LNCS","doi":"10.1007/978-3-319-09620-9_1","publication":"Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)","abstract":[{"text":"In this survey article, we discuss two algorithmic research areas that emerge from problems that arise when resources are offered in the cloud. The first area, online leasing, captures problems arising from the fact that resources in the cloud are not bought, but leased by cloud vendors. The second area, Distributed Storage Systems, deals with problems arising from so-called cloud federations, i.e., when several cloud providers are needed to fulfill a given task.","lang":"eng"}],"date_created":"2017-10-17T12:42:21Z","file":[{"date_created":"2018-03-16T11:21:54Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1338","date_updated":"2018-03-16T11:21:54Z","relation":"main_file","file_size":274496,"access_level":"closed","file_name":"459-SIROCCO2014.pdf"}],"department":[{"_id":"79"},{"_id":"63"}],"type":"conference","status":"public","has_accepted_license":"1","_id":"459","page":"1-13","ddc":["040"],"user_id":"477","citation":{"bibtex":"@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>}, booktitle={Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian, Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014}, pages={1–13}, collection={LNCS} }","ama":"Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. LNCS. ; 2014:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>","mla":"Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">10.1007/978-3-319-09620-9_1</a>.","chicago":"Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>.","short":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.","ieee":"S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13.","apa":"Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 1–13). <a href=\"https://doi.org/10.1007/978-3-319-09620-9_1\">https://doi.org/10.1007/978-3-319-09620-9_1</a>"},"file_date_updated":"2018-03-16T11:21:54Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"status":"public","volume":56,"user_id":"10075","_id":"4599","publisher":"Springer Nature","page":"431-451","citation":{"ieee":"J. Beran, Y. Feng, and S. Ghosh, “Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models,” <i>Statistical Papers</i>, vol. 56, no. 2, pp. 431–451, 2014.","apa":"Beran, J., Feng, Y., &#38; Ghosh, S. (2014). Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. <i>Statistical Papers</i>, <i>56</i>(2), 431–451. <a href=\"https://doi.org/10.1007/s00362-014-0590-x\">https://doi.org/10.1007/s00362-014-0590-x</a>","mla":"Beran, Jan, et al. “Modelling Long-Range Dependence and Trends in Duration Series: An Approach Based on EFARIMA and ESEMIFAR Models.” <i>Statistical Papers</i>, vol. 56, no. 2, Springer Nature, 2014, pp. 431–51, doi:<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>.","bibtex":"@article{Beran_Feng_Ghosh_2014, title={Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models}, volume={56}, DOI={<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>}, number={2}, journal={Statistical Papers}, publisher={Springer Nature}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={431–451} }","ama":"Beran J, Feng Y, Ghosh S. Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. <i>Statistical Papers</i>. 2014;56(2):431-451. doi:<a href=\"https://doi.org/10.1007/s00362-014-0590-x\">10.1007/s00362-014-0590-x</a>","short":"J. Beran, Y. Feng, S. Ghosh, Statistical Papers 56 (2014) 431–451.","chicago":"Beran, Jan, Yuanhua Feng, and Sucharita Ghosh. “Modelling Long-Range Dependence and Trends in Duration Series: An Approach Based on EFARIMA and ESEMIFAR Models.” <i>Statistical Papers</i> 56, no. 2 (2014): 431–51. <a href=\"https://doi.org/10.1007/s00362-014-0590-x\">https://doi.org/10.1007/s00362-014-0590-x</a>."},"intvolume":"        56","publication_status":"published","date_updated":"2022-01-06T07:01:14Z","author":[{"full_name":"Beran, Jan","first_name":"Jan","last_name":"Beran"},{"full_name":"Feng, Yuanhua","last_name":"Feng","first_name":"Yuanhua","id":"20760"},{"first_name":"Sucharita","last_name":"Ghosh","full_name":"Ghosh, Sucharita"}],"publication_identifier":{"issn":["0932-5026","1613-9798"]},"year":"2014","title":"Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models","doi":"10.1007/s00362-014-0590-x","language":[{"iso":"eng"}],"publication":"Statistical Papers","issue":"2","department":[{"_id":"206"}],"type":"journal_article","date_created":"2018-10-10T09:55:25Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"mla":"Mittendorf, Robert. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn, 2014.","bibtex":"@book{Mittendorf_2014, title={Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2014} }","ama":"Mittendorf R. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn; 2014.","ieee":"R. Mittendorf, <i>Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs</i>. Universität Paderborn, 2014.","apa":"Mittendorf, R. (2014). <i>Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs</i>. Universität Paderborn.","short":"R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs, Universität Paderborn, 2014.","chicago":"Mittendorf, Robert. <i>Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs</i>. Universität Paderborn, 2014."},"type":"mastersthesis","date_created":"2017-10-17T12:42:21Z","date_updated":"2022-01-06T07:01:14Z","author":[{"full_name":"Mittendorf, Robert","first_name":"Robert","last_name":"Mittendorf"}],"title":"Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs","year":"2014","status":"public","user_id":"15504","publisher":"Universität Paderborn","_id":"460"},{"user_id":"10075","doi":"10.1007/978-3-319-03122-4_15","page":"239-253","_id":"4602","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T07:01:14Z","title":"On EFARIMA and ESEMIFAR Models","year":"2014","status":"public","author":[{"full_name":"Beran, Jan","last_name":"Beran","first_name":"Jan"},{"id":"20760","first_name":"Yuanhua","last_name":"Feng","full_name":"Feng, Yuanhua"},{"full_name":"Ghosh, Sucharita","first_name":"Sucharita","last_name":"Ghosh"}],"publication_identifier":{"issn":["1570-5811","2214-7977"],"isbn":["9783319031217","9783319031224"]},"type":"book_chapter","department":[{"_id":"206"}],"date_created":"2018-10-10T10:27:24Z","place":"Cham","publication":"Empirical Economic and Financial Research","citation":{"apa":"Beran, J., Feng, Y., &#38; Ghosh, S. (2014). On EFARIMA and ESEMIFAR Models. In <i>Empirical Economic and Financial Research</i> (pp. 239–253). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">https://doi.org/10.1007/978-3-319-03122-4_15</a>","ieee":"J. Beran, Y. Feng, and S. Ghosh, “On EFARIMA and ESEMIFAR Models,” in <i>Empirical Economic and Financial Research</i>, Cham: Springer International Publishing, 2014, pp. 239–253.","short":"J. Beran, Y. Feng, S. Ghosh, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 239–253.","chicago":"Beran, Jan, Yuanhua Feng, and Sucharita Ghosh. “On EFARIMA and ESEMIFAR Models.” In <i>Empirical Economic and Financial Research</i>, 239–53. Cham: Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">https://doi.org/10.1007/978-3-319-03122-4_15</a>.","mla":"Beran, Jan, et al. “On EFARIMA and ESEMIFAR Models.” <i>Empirical Economic and Financial Research</i>, Springer International Publishing, 2014, pp. 239–53, doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>.","ama":"Beran J, Feng Y, Ghosh S. On EFARIMA and ESEMIFAR Models. In: <i>Empirical Economic and Financial Research</i>. Cham: Springer International Publishing; 2014:239-253. doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>","bibtex":"@inbook{Beran_Feng_Ghosh_2014, place={Cham}, title={On EFARIMA and ESEMIFAR Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03122-4_15\">10.1007/978-3-319-03122-4_15</a>}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={239–253} }"}},{"citation":{"ieee":"C. Peitz and Y. Feng, “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model,” in <i>Empirical Economic and Financial Research</i>, Cham: Springer International Publishing, 2014, pp. 341–356.","apa":"Peitz, C., &#38; Feng, Y. (2014). Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In <i>Empirical Economic and Financial Research</i> (pp. 341–356). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">https://doi.org/10.1007/978-3-319-03122-4_21</a>","chicago":"Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” In <i>Empirical Economic and Financial Research</i>, 341–56. Cham: Springer International Publishing, 2014. <a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">https://doi.org/10.1007/978-3-319-03122-4_21</a>.","short":"C. Peitz, Y. Feng, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 341–356.","mla":"Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” <i>Empirical Economic and Financial Research</i>, Springer International Publishing, 2014, pp. 341–56, doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>.","bibtex":"@inbook{Peitz_Feng_2014, place={Cham}, title={Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Peitz, Christian and Feng, Yuanhua}, year={2014}, pages={341–356} }","ama":"Peitz C, Feng Y. Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In: <i>Empirical Economic and Financial Research</i>. Cham: Springer International Publishing; 2014:341-356. doi:<a href=\"https://doi.org/10.1007/978-3-319-03122-4_21\">10.1007/978-3-319-03122-4_21</a>"},"publication":"Empirical Economic and Financial Research","place":"Cham","date_created":"2018-10-10T10:28:44Z","department":[{"_id":"206"}],"type":"book_chapter","publication_identifier":{"issn":["1570-5811","2214-7977"],"isbn":["9783319031217","9783319031224"]},"author":[{"id":"2980","first_name":"Christian","last_name":"Peitz","full_name":"Peitz, Christian"},{"full_name":"Feng, Yuanhua","first_name":"Yuanhua","last_name":"Feng","id":"20760"}],"title":"Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model","status":"public","year":"2014","date_updated":"2022-01-06T07:01:14Z","publication_status":"published","_id":"4603","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"page":"341-356","doi":"10.1007/978-3-319-03122-4_21","user_id":"10075"},{"title":"Data-driven estimation of diurnal patterns of durations between trades on financial markets","year":"2014","status":"public","author":[{"first_name":"Yuanhua","last_name":"Feng","full_name":"Feng, Yuanhua","id":"20760"}],"publication_identifier":{"issn":["0167-7152"]},"publication_status":"published","date_updated":"2022-01-06T07:01:14Z","intvolume":"        92","page":"109-113","language":[{"iso":"eng"}],"_id":"4605","publisher":"Elsevier BV","user_id":"10075","doi":"10.1016/j.spl.2014.05.011","volume":92,"publication":"Statistics & Probability Letters","citation":{"apa":"Feng, Y. (2014). Data-driven estimation of diurnal patterns of durations between trades on financial markets. <i>Statistics &#38; Probability Letters</i>, <i>92</i>, 109–113. <a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">https://doi.org/10.1016/j.spl.2014.05.011</a>","ieee":"Y. Feng, “Data-driven estimation of diurnal patterns of durations between trades on financial markets,” <i>Statistics &#38; Probability Letters</i>, vol. 92, pp. 109–113, 2014.","short":"Y. Feng, Statistics &#38; Probability Letters 92 (2014) 109–113.","chicago":"Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” <i>Statistics &#38; Probability Letters</i> 92 (2014): 109–13. <a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">https://doi.org/10.1016/j.spl.2014.05.011</a>.","mla":"Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” <i>Statistics &#38; Probability Letters</i>, vol. 92, Elsevier BV, 2014, pp. 109–13, doi:<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>.","ama":"Feng Y. Data-driven estimation of diurnal patterns of durations between trades on financial markets. <i>Statistics &#38; Probability Letters</i>. 2014;92:109-113. doi:<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>","bibtex":"@article{Feng_2014, title={Data-driven estimation of diurnal patterns of durations between trades on financial markets}, volume={92}, DOI={<a href=\"https://doi.org/10.1016/j.spl.2014.05.011\">10.1016/j.spl.2014.05.011</a>}, journal={Statistics &#38; Probability Letters}, publisher={Elsevier BV}, author={Feng, Yuanhua}, year={2014}, pages={109–113} }"},"date_created":"2018-10-10T10:34:03Z","type":"journal_article","department":[{"_id":"206"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ama":"Dräxler S. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn; 2014.","bibtex":"@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }","mla":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","short":"S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014.","chicago":"Dräxler, Sevil. <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014.","apa":"Dräxler, S. (2014). <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn.","ieee":"S. Dräxler, <i>Adaptive Placement of Programmable Virtual Network Function Chains</i>. Universität Paderborn, 2014."},"department":[{"_id":"75"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:21Z","date_updated":"2022-01-06T07:01:14Z","author":[{"full_name":"Dräxler, Sevil","last_name":"Dräxler","first_name":"Sevil","id":"31764"}],"title":"Adaptive Placement of Programmable Virtual Network Function Chains","status":"public","year":"2014","user_id":"477","_id":"461","publisher":"Universität Paderborn"},{"date_created":"2017-10-17T12:42:22Z","file":[{"file_id":"1337","content_type":"application/pdf","success":1,"file_name":"462-FS2014SIMULTECH.pdf","file_size":993721,"access_level":"closed","relation":"main_file","date_updated":"2018-03-16T11:21:24Z","date_created":"2018-03-16T11:21:24Z","creator":"florida"}],"department":[{"_id":"63"},{"_id":"541"}],"type":"conference","citation":{"short":"M. Feldotto, A. Skopalik, in: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630.","chicago":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 625–30, 2014. <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>.","ieee":"M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–630.","apa":"Feldotto, M., &#38; Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i> (pp. 625–630). <a href=\"https://doi.org/10.5220/0005110406250630\">https://doi.org/10.5220/0005110406250630</a>","bibtex":"@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>}, booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)}, author={Feldotto, Matthias and Skopalik, Alexander}, year={2014}, pages={625–630} }","ama":"Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>. ; 2014:625-630. doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>","mla":"Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” <i>Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)</i>, 2014, pp. 625–30, doi:<a href=\"https://doi.org/10.5220/0005110406250630\">10.5220/0005110406250630</a>."},"file_date_updated":"2018-03-16T11:21:24Z","publication":"Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014)","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Teilprojekt A"},{"_id":"7","name":"SFB 901 - Subprojekt A3"}],"abstract":[{"lang":"eng","text":"We discuss a technique to analyze complex infinitely repeated games using techniques from the fields of game theory and simulations. Our research is motivated by the analysis of electronic markets with thousands of participants and possibly complex strategic behavior. We consider an example of a global market of composed IT services to demonstrate the use of our simulation technique. We present our current work in this area and we want to discuss further approaches for the future."}],"_id":"462","page":"625-630","user_id":"14052","ddc":["040"],"doi":"10.5220/0005110406250630","author":[{"id":"14052","first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias"},{"id":"40384","first_name":"Alexander","last_name":"Skopalik","full_name":"Skopalik, Alexander"}],"title":"A Simulation Framework for Analyzing Complex Infinitely Repeated Games","status":"public","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T07:01:15Z"},{"type":"conference","department":[{"_id":"64"}],"file":[{"creator":"florida","date_created":"2018-03-16T11:20:54Z","file_name":"463-FDTC14.pdf","access_level":"closed","file_size":437518,"relation":"main_file","date_updated":"2018-03-16T11:20:54Z","file_id":"1336","success":1,"content_type":"application/pdf"}],"date_created":"2017-10-17T12:42:22Z","abstract":[{"lang":"eng","text":"Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"file_date_updated":"2018-03-16T11:20:54Z","publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","citation":{"ama":"Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:123--136. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>","bibtex":"@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }","mla":"Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.22\">10.1109/FDTC.2014.22</a>.","chicago":"Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 123--136, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>.","short":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.","apa":"Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., &#38; Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 123--136). <a href=\"https://doi.org/10.1109/FDTC.2014.22\">https://doi.org/10.1109/FDTC.2014.22</a>","ieee":"J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 123--136."},"user_id":"25078","ddc":["040"],"doi":"10.1109/FDTC.2014.22","page":"123--136","_id":"463","date_updated":"2022-01-06T07:01:16Z","has_accepted_license":"1","title":"A Practical Second-Order Fault Attack against a Real-World Pairing Implementation","year":"2014","status":"public","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"last_name":"Gomes da Silva","first_name":"Ricardo","full_name":"Gomes da Silva, Ricardo"},{"last_name":"Günther","first_name":"Peter","full_name":"Günther, Peter"},{"full_name":"Krämer, Juliane","first_name":"Juliane","last_name":"Krämer"},{"last_name":"Seifert","first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre"}]}]