--- _id: '4508' author: - first_name: Tobias full_name: Jenert, Tobias id: '71994' last_name: Jenert orcid: ' https://orcid.org/0000-0001-9262-5646' citation: 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. Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen . Vol Band 66. Medien in der Wissenschaft . New York: Waxmann Verlag GmbH ; 2014:159-175.' 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, & G. Bachmann (Eds.), Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen (Vol. Band 66, pp. 159–175). New York: Waxmann Verlag GmbH .' 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 } }' chicago: 'Jenert, Tobias. “Verändern Medien Die Lernkultur? Mögliche Rollen von Technologie Zwischen Virtuellen Und Physischen Lernräumen.” In Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen , edited by Tina Škerlak, Helen Kaufmann, and Gudrun Bachmann, Band 66:159–75. Medien in Der Wissenschaft . New York: Waxmann Verlag GmbH , 2014.' ieee: 'T. Jenert, “Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen,” in Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen , vol. Band 66, T. Škerlak, H. Kaufmann, and G. Bachmann, Eds. New York: Waxmann Verlag GmbH , 2014, pp. 159–175.' mla: Jenert, Tobias. “Verändern Medien Die Lernkultur? Mögliche Rollen von Technologie Zwischen Virtuellen Und Physischen Lernräumen.” Lernumgebungen an Der Hochschule. Auf Dem Weg Zum Campus von Morgen , edited by Tina Škerlak et al., vol. Band 66, Waxmann Verlag GmbH , 2014, pp. 159–75. 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.' date_created: 2018-09-19T11:39:06Z date_updated: 2022-01-06T07:01:07Z department: - _id: '208' - _id: '282' editor: - first_name: 'Tina ' full_name: 'Škerlak, Tina ' last_name: Škerlak - first_name: Helen full_name: Kaufmann, Helen last_name: Kaufmann - first_name: Gudrun full_name: Bachmann, Gudrun last_name: Bachmann extern: '1' page: 159-175 place: New York publication: 'Lernumgebungen an der Hochschule. Auf dem Weg zum Campus von morgen ' publication_identifier: isbn: - 978-3-8309-3056-3 publisher: 'Waxmann Verlag GmbH ' series_title: 'Medien in der Wissenschaft ' status: public title: Verändern Medien die Lernkultur? Mögliche Rollen von Technologie zwischen virtuellen und physischen Lernräumen type: book_chapter user_id: '51057' volume: Band 66 year: '2014' ... --- _id: '451' 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. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Sören full_name: Riechers, Sören last_name: Riechers - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121. doi:10.1007/978-3-662-44803-8_10' apa: Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121). https://doi.org/10.1007/978-3-662-44803-8_10 bibtex: '@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer Science}, title={Budget-restricted utility games with ordered strategic decisions}, DOI={10.1007/978-3-662-44803-8_10}, 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} }' chicago: Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10. ieee: M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with ordered strategic decisions,” in Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121. mla: Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10. 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.' date_created: 2017-10-17T12:42:20Z date_updated: 2022-01-06T07:01:07Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-662-44803-8_10 editor: - first_name: Ron full_name: Lavi, Ron last_name: Lavi file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:25:10Z date_updated: 2018-03-16T11:25:10Z file_id: '1344' file_name: 451-DRS14.pdf file_size: 283266 relation: main_file success: 1 file_date_updated: 2018-03-16T11:25:10Z has_accepted_license: '1' language: - iso: eng page: 110-121 project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subproject C2 - _id: '16' name: SFB 901 - Subproject C4 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) series_title: Lecture Notes in Computer Science status: public title: Budget-restricted utility games with ordered strategic decisions type: conference user_id: '477' year: '2014' ... --- _id: '452' abstract: - lang: eng 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. author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model for Multilevel Network Games. In: Lavi R, ed. Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2014:294.' apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., & Skopalik, A. (2014). Brief Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) (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} }' chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.' ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement: A Model for Multilevel Network Games,” in 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.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.' 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.' date_created: 2017-10-17T12:42:20Z date_updated: 2022-01-06T07:01:08Z ddc: - '040' department: - _id: '63' - _id: '541' editor: - first_name: Ron full_name: Lavi, Ron last_name: Lavi file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:24:40Z date_updated: 2018-03-16T11:24:40Z file_id: '1343' file_name: 452-title_multilevel-sagt.pdf file_size: 84783 relation: main_file success: 1 file_date_updated: 2018-03-16T11:24:40Z has_accepted_license: '1' language: - iso: eng page: '294' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT) series_title: LNCS status: public title: 'Brief Announcement: A Model for Multilevel Network Games' type: conference user_id: '15415' year: '2014' ... --- _id: '453' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Martin full_name: Gairing, Martin last_name: Gairing - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Gairing M, Skopalik A. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:30-43. doi:10.1007/978-3-319-13129-0_3' apa: Feldotto, M., Gairing, M., & Skopalik, A. (2014). Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 30–43). https://doi.org/10.1007/978-3-319-13129-0_3 bibtex: '@inproceedings{Feldotto_Gairing_Skopalik_2014, series={LNCS}, title={Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria}, DOI={10.1007/978-3-319-13129-0_3}, 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} }' chicago: Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3. ieee: M. Feldotto, M. Gairing, and A. Skopalik, “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria,” in Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43. mla: Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3. short: 'M. Feldotto, M. Gairing, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43.' date_created: 2017-10-17T12:42:20Z date_updated: 2022-01-06T07:01:09Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-13129-0_3 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:24:11Z date_updated: 2018-03-16T11:24:11Z file_id: '1342' file_name: 453-WINE14FGS.pdf file_size: 324307 relation: main_file success: 1 file_date_updated: 2018-03-16T11:24:11Z has_accepted_license: '1' page: 30-43 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Teilprojekt A - _id: '7' name: SFB 901 - Subprojekt A3 publication: Proceedings of the 10th International Conference on Web and Internet Economics (WINE) series_title: LNCS status: public title: Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria type: conference user_id: '14052' year: '2014' ... --- _id: '4534' author: - first_name: Tobias full_name: Jenert, Tobias id: '71994' last_name: Jenert orcid: ' https://orcid.org/0000-0001-9262-5646' citation: ama: 'Jenert T. Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha. In: ; 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.' 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} }' chicago: 'Jenert, Tobias. “Viel Neues Und Doch Keine Innovation!?: Fünf Thesen, Warum Es Die Lehrentwicklung an Hochschulen Schwer Ha,” 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.' mla: 'Jenert, Tobias. Viel Neues Und Doch Keine Innovation!?: Fünf Thesen, Warum Es Die Lehrentwicklung an Hochschulen Schwer Ha. 2014.' short: 'T. Jenert, in: 2014.' conference: location: Berlin name: ' Impulsvortrag an der zweiten Lehr-/Lernkonferenz des Fellowship-Programms für innovative Lehre' date_created: 2018-09-20T09:21:16Z date_updated: 2022-01-06T07:01:09Z department: - _id: '208' - _id: '282' extern: '1' status: public title: 'Viel Neues und doch keine Innovation!?: Fünf Thesen, warum es die Lehrentwicklung an Hochschulen schwer ha' type: conference user_id: '51057' year: '2014' ... --- _id: '4535' author: - first_name: Taiga full_name: Brahm, Taiga last_name: Brahm - first_name: Tobias full_name: Jenert, Tobias id: '71994' last_name: Jenert orcid: ' https://orcid.org/0000-0001-9262-5646' citation: ama: 'Brahm T, Jenert T. Change Management in Higher Education Institutions. In: ; 2014.' apa: Brahm, T., & Jenert, T. (2014). Change Management in Higher Education Institutions. Presented at the Workshop held at ICED 2014, Stockholm . bibtex: '@inproceedings{Brahm_Jenert_2014, title={Change Management in Higher Education Institutions}, author={Brahm, Taiga and Jenert, Tobias}, year={2014} }' chicago: Brahm, Taiga, and Tobias Jenert. “Change Management in Higher Education Institutions,” 2014. ieee: T. Brahm and T. Jenert, “Change Management in Higher Education Institutions,” presented at the Workshop held at ICED 2014, Stockholm , 2014. mla: Brahm, Taiga, and Tobias Jenert. Change Management in Higher Education Institutions. 2014. short: 'T. Brahm, T. Jenert, in: 2014.' conference: location: 'Stockholm ' name: Workshop held at ICED 2014 date_created: 2018-09-20T09:23:55Z date_updated: 2022-01-06T07:01:09Z department: - _id: '208' - _id: '282' extern: '1' status: public title: Change Management in Higher Education Institutions type: conference user_id: '51057' year: '2014' ... --- _id: '454' author: - first_name: Waleri full_name: Heldt, Waleri last_name: Heldt citation: ama: 'Heldt W. Automated Service Composition: Adaption of the ASTRO Approach. Universität Paderborn; 2014.' apa: 'Heldt, W. (2014). Automated Service Composition: Adaption of the ASTRO Approach. Universität Paderborn.' bibtex: '@book{Heldt_2014, title={Automated Service Composition: Adaption of the ASTRO Approach}, publisher={Universität Paderborn}, author={Heldt, Waleri}, year={2014} }' chicago: 'Heldt, Waleri. Automated Service Composition: Adaption of the ASTRO Approach. Universität Paderborn, 2014.' ieee: 'W. Heldt, Automated Service Composition: Adaption of the ASTRO Approach. Universität Paderborn, 2014.' mla: 'Heldt, Waleri. Automated Service Composition: Adaption of the ASTRO Approach. Universität Paderborn, 2014.' short: 'W. Heldt, Automated Service Composition: Adaption of the ASTRO Approach, Universität Paderborn, 2014.' date_created: 2017-10-17T12:42:20Z date_updated: 2022-01-06T07:01:09Z project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: 'Automated Service Composition: Adaption of the ASTRO Approach' type: mastersthesis user_id: '15504' year: '2014' ... --- _id: '455' abstract: - lang: eng 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. author: - first_name: Christoph full_name: Hansknecht, Christoph last_name: Hansknecht - first_name: Max full_name: Klimm, Max last_name: Klimm - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Hansknecht C, Klimm M, Skopalik A. Approximate pure Nash equilibria in weighted congestion games. In: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). LIPIcs. ; 2014:242-257. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242' apa: Hansknecht, C., Klimm, M., & Skopalik, A. (2014). Approximate pure Nash equilibria in weighted congestion games. In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) (pp. 242–257). https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242 bibtex: '@inproceedings{Hansknecht_Klimm_Skopalik_2014, series={LIPIcs}, title={Approximate pure Nash equilibria in weighted congestion games}, DOI={10.4230/LIPIcs.APPROX-RANDOM.2014.242}, 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} }' chicago: Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242. ieee: C. Hansknecht, M. Klimm, and A. Skopalik, “Approximate pure Nash equilibria in weighted congestion games,” in Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–257. mla: Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57, doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242. 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.' date_created: 2017-10-17T12:42:20Z date_updated: 2022-01-06T07:01:09Z ddc: - '040' department: - _id: '541' - _id: '63' doi: 10.4230/LIPIcs.APPROX-RANDOM.2014.242 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:23:40Z date_updated: 2018-03-16T11:23:40Z file_id: '1341' file_name: 455-HKS14.pdf file_size: 512712 relation: main_file success: 1 file_date_updated: 2018-03-16T11:23:40Z has_accepted_license: '1' language: - iso: eng page: 242 - 257 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) series_title: LIPIcs status: public title: Approximate pure Nash equilibria in weighted congestion games type: conference user_id: '477' year: '2014' ... --- _id: '456' 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]. author: - first_name: Martin full_name: Gairing, Martin last_name: Gairing - first_name: Grammateia full_name: Kotsialou, Grammateia last_name: Kotsialou - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Gairing M, Kotsialou G, Skopalik A. Approximate pure Nash equilibria in Social Context Congestion Games. In: Proceedings of the 10th International Conference on Web and Internet Economics (WINE). LNCS. ; 2014:480-485. doi:10.1007/978-3-319-13129-0_43' apa: Gairing, M., Kotsialou, G., & Skopalik, A. (2014). Approximate pure Nash equilibria in Social Context Congestion Games. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE) (pp. 480–485). https://doi.org/10.1007/978-3-319-13129-0_43 bibtex: '@inproceedings{Gairing_Kotsialou_Skopalik_2014, series={LNCS}, title={Approximate pure Nash equilibria in Social Context Congestion Games}, DOI={10.1007/978-3-319-13129-0_43}, 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} }' chicago: Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 480–85. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43. ieee: M. Gairing, G. Kotsialou, and A. Skopalik, “Approximate pure Nash equilibria in Social Context Congestion Games,” 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.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–85, doi:10.1007/978-3-319-13129-0_43. short: 'M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 480–485.' date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:10Z ddc: - '040' department: - _id: '541' - _id: '63' doi: 10.1007/978-3-319-13129-0_43 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:22:57Z date_updated: 2018-03-16T11:22:57Z file_id: '1340' file_name: 456-WINE14final.pdf file_size: 377378 relation: main_file success: 1 file_date_updated: 2018-03-16T11:22:57Z has_accepted_license: '1' language: - iso: eng page: 480 - 485 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 10th International Conference on Web and Internet Economics (WINE) series_title: LNCS status: public title: Approximate pure Nash equilibria in Social Context Congestion Games type: conference user_id: '477' year: '2014' ... --- _id: '457' abstract: - lang: eng 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. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Felix full_name: Mohr, Felix last_name: Mohr - first_name: 'Bernd ' full_name: 'Kleinjohann, Bernd ' last_name: Kleinjohann citation: ama: 'Jungmann A, Mohr F, Kleinjohann B. Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In: Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA). ; 2014:105-112. doi:10.1109/SOCA.2014.48' apa: Jungmann, A., Mohr, F., & Kleinjohann, B. (2014). Applying Reinforcement Learning for Resolving Ambiguity in Service Composition. In Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA) (pp. 105–112). https://doi.org/10.1109/SOCA.2014.48 bibtex: '@inproceedings{Jungmann_Mohr_Kleinjohann_2014, title={Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}, DOI={10.1109/SOCA.2014.48}, 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} }' chicago: Jungmann, Alexander, Felix Mohr, and Bernd Kleinjohann. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” In Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA), 105–12, 2014. https://doi.org/10.1109/SOCA.2014.48. ieee: A. Jungmann, F. Mohr, and B. Kleinjohann, “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition,” in Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–112. mla: Jungmann, Alexander, et al. “Applying Reinforcement Learning for Resolving Ambiguity in Service Composition.” Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA), 2014, pp. 105–12, doi:10.1109/SOCA.2014.48. 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.' date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:12Z ddc: - '040' department: - _id: '355' doi: 10.1109/SOCA.2014.48 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:22:26Z date_updated: 2018-03-16T11:22:26Z file_id: '1339' file_name: 457-SOCA2014-Jungmann-Mohr.pdf file_size: 1324374 relation: main_file success: 1 file_date_updated: 2018-03-16T11:22:26Z has_accepted_license: '1' language: - iso: eng page: 105-112 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA) status: public title: Applying Reinforcement Learning for Resolving Ambiguity in Service Composition type: conference user_id: '477' year: '2014' ... --- _id: '458' author: - first_name: Philipp full_name: Dreimann, Philipp last_name: Dreimann citation: ama: Dreimann P. Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic. Universität Paderborn; 2014. apa: Dreimann, P. (2014). Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic. Universität Paderborn. 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} }' chicago: Dreimann, Philipp. Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic. Universität Paderborn, 2014. ieee: P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic. Universität Paderborn, 2014. mla: Dreimann, Philipp. Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic. Universität Paderborn, 2014. short: P. Dreimann, Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic, Universität Paderborn, 2014. date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:13Z department: - _id: '75' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Anticipatory Power Cycling of Mobile Network Equipment for High-Demand Multimedia Traffic type: mastersthesis user_id: '15504' year: '2014' ... --- _id: '459' abstract: - lang: eng 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. author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1' apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1 bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014, series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud}, DOI={10.1007/978-3-319-09620-9_1}, 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} }' chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.” In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1. ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13. mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1. 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.' date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:14Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1007/978-3-319-09620-9_1 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:21:54Z date_updated: 2018-03-16T11:21:54Z file_id: '1338' file_name: 459-SIROCCO2014.pdf file_size: 274496 relation: main_file success: 1 file_date_updated: 2018-03-16T11:21:54Z has_accepted_license: '1' page: 1-13 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) series_title: LNCS status: public title: Algorithmic Aspects of Resource Management in the Cloud type: conference user_id: '477' year: '2014' ... --- _id: '4599' author: - first_name: Jan full_name: Beran, Jan last_name: Beran - first_name: Yuanhua full_name: Feng, Yuanhua id: '20760' last_name: Feng - first_name: Sucharita full_name: Ghosh, Sucharita last_name: Ghosh citation: ama: 'Beran J, Feng Y, Ghosh S. Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. Statistical Papers. 2014;56(2):431-451. doi:10.1007/s00362-014-0590-x' apa: 'Beran, J., Feng, Y., & Ghosh, S. (2014). Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models. Statistical Papers, 56(2), 431–451. https://doi.org/10.1007/s00362-014-0590-x' 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={10.1007/s00362-014-0590-x}, number={2}, journal={Statistical Papers}, publisher={Springer Nature}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={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.” Statistical Papers 56, no. 2 (2014): 431–51. https://doi.org/10.1007/s00362-014-0590-x.' 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,” Statistical Papers, vol. 56, no. 2, pp. 431–451, 2014.' mla: 'Beran, Jan, et al. “Modelling Long-Range Dependence and Trends in Duration Series: An Approach Based on EFARIMA and ESEMIFAR Models.” Statistical Papers, vol. 56, no. 2, Springer Nature, 2014, pp. 431–51, doi:10.1007/s00362-014-0590-x.' short: J. Beran, Y. Feng, S. Ghosh, Statistical Papers 56 (2014) 431–451. date_created: 2018-10-10T09:55:25Z date_updated: 2022-01-06T07:01:14Z department: - _id: '206' doi: 10.1007/s00362-014-0590-x intvolume: ' 56' issue: '2' language: - iso: eng page: 431-451 publication: Statistical Papers publication_identifier: issn: - 0932-5026 - 1613-9798 publication_status: published publisher: Springer Nature status: public title: 'Modelling long-range dependence and trends in duration series: an approach based on EFARIMA and ESEMIFAR models' type: journal_article user_id: '10075' volume: 56 year: '2014' ... --- _id: '460' author: - first_name: Robert full_name: Mittendorf, Robert last_name: Mittendorf citation: ama: Mittendorf R. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs. Universität Paderborn; 2014. apa: Mittendorf, R. (2014). Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs. Universität Paderborn. 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} }' chicago: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs. Universität Paderborn, 2014. ieee: R. Mittendorf, Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs. Universität Paderborn, 2014. mla: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs. Universität Paderborn, 2014. short: R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading and FPGAs, Universität Paderborn, 2014. date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:14Z project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Advanced AES-key recovery from decayed RAM-dumps using multi-threading and FPGAs type: mastersthesis user_id: '15504' year: '2014' ... --- _id: '4602' author: - first_name: Jan full_name: Beran, Jan last_name: Beran - first_name: Yuanhua full_name: Feng, Yuanhua id: '20760' last_name: Feng - first_name: Sucharita full_name: Ghosh, Sucharita last_name: Ghosh citation: ama: 'Beran J, Feng Y, Ghosh S. On EFARIMA and ESEMIFAR Models. In: Empirical Economic and Financial Research. Cham: Springer International Publishing; 2014:239-253. doi:10.1007/978-3-319-03122-4_15' apa: 'Beran, J., Feng, Y., & Ghosh, S. (2014). On EFARIMA and ESEMIFAR Models. In Empirical Economic and Financial Research (pp. 239–253). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-03122-4_15' bibtex: '@inbook{Beran_Feng_Ghosh_2014, place={Cham}, title={On EFARIMA and ESEMIFAR Models}, DOI={10.1007/978-3-319-03122-4_15}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Beran, Jan and Feng, Yuanhua and Ghosh, Sucharita}, year={2014}, pages={239–253} }' chicago: 'Beran, Jan, Yuanhua Feng, and Sucharita Ghosh. “On EFARIMA and ESEMIFAR Models.” In Empirical Economic and Financial Research, 239–53. Cham: Springer International Publishing, 2014. https://doi.org/10.1007/978-3-319-03122-4_15.' ieee: 'J. Beran, Y. Feng, and S. Ghosh, “On EFARIMA and ESEMIFAR Models,” in Empirical Economic and Financial Research, Cham: Springer International Publishing, 2014, pp. 239–253.' mla: Beran, Jan, et al. “On EFARIMA and ESEMIFAR Models.” Empirical Economic and Financial Research, Springer International Publishing, 2014, pp. 239–53, doi:10.1007/978-3-319-03122-4_15. short: 'J. Beran, Y. Feng, S. Ghosh, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 239–253.' date_created: 2018-10-10T10:27:24Z date_updated: 2022-01-06T07:01:14Z department: - _id: '206' doi: 10.1007/978-3-319-03122-4_15 language: - iso: eng page: 239-253 place: Cham publication: Empirical Economic and Financial Research publication_identifier: isbn: - '9783319031217' - '9783319031224' issn: - 1570-5811 - 2214-7977 publication_status: published publisher: Springer International Publishing status: public title: On EFARIMA and ESEMIFAR Models type: book_chapter user_id: '10075' year: '2014' ... --- _id: '4603' author: - first_name: Christian full_name: Peitz, Christian id: '2980' last_name: Peitz - first_name: Yuanhua full_name: Feng, Yuanhua id: '20760' last_name: Feng citation: ama: 'Peitz C, Feng Y. Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In: Empirical Economic and Financial Research. Cham: Springer International Publishing; 2014:341-356. doi:10.1007/978-3-319-03122-4_21' apa: 'Peitz, C., & Feng, Y. (2014). Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model. In Empirical Economic and Financial Research (pp. 341–356). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-03122-4_21' bibtex: '@inbook{Peitz_Feng_2014, place={Cham}, title={Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model}, DOI={10.1007/978-3-319-03122-4_21}, booktitle={Empirical Economic and Financial Research}, publisher={Springer International Publishing}, author={Peitz, Christian and Feng, Yuanhua}, year={2014}, pages={341–356} }' chicago: 'Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” In Empirical Economic and Financial Research, 341–56. Cham: Springer International Publishing, 2014. https://doi.org/10.1007/978-3-319-03122-4_21.' ieee: 'C. Peitz and Y. Feng, “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model,” in Empirical Economic and Financial Research, Cham: Springer International Publishing, 2014, pp. 341–356.' mla: Peitz, Christian, and Yuanhua Feng. “Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model.” Empirical Economic and Financial Research, Springer International Publishing, 2014, pp. 341–56, doi:10.1007/978-3-319-03122-4_21. short: 'C. Peitz, Y. Feng, in: Empirical Economic and Financial Research, Springer International Publishing, Cham, 2014, pp. 341–356.' date_created: 2018-10-10T10:28:44Z date_updated: 2022-01-06T07:01:14Z department: - _id: '206' doi: 10.1007/978-3-319-03122-4_21 language: - iso: eng page: 341-356 place: Cham publication: Empirical Economic and Financial Research publication_identifier: isbn: - '9783319031217' - '9783319031224' issn: - 1570-5811 - 2214-7977 publication_status: published publisher: Springer International Publishing status: public title: Double Conditional Smoothing of High-Frequency Volatility Surface Under a Spatial Model type: book_chapter user_id: '10075' year: '2014' ... --- _id: '4605' author: - first_name: Yuanhua full_name: Feng, Yuanhua id: '20760' last_name: Feng citation: ama: Feng Y. Data-driven estimation of diurnal patterns of durations between trades on financial markets. Statistics & Probability Letters. 2014;92:109-113. doi:10.1016/j.spl.2014.05.011 apa: Feng, Y. (2014). Data-driven estimation of diurnal patterns of durations between trades on financial markets. Statistics & Probability Letters, 92, 109–113. https://doi.org/10.1016/j.spl.2014.05.011 bibtex: '@article{Feng_2014, title={Data-driven estimation of diurnal patterns of durations between trades on financial markets}, volume={92}, DOI={10.1016/j.spl.2014.05.011}, journal={Statistics & Probability Letters}, publisher={Elsevier BV}, author={Feng, Yuanhua}, year={2014}, pages={109–113} }' chicago: 'Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” Statistics & Probability Letters 92 (2014): 109–13. https://doi.org/10.1016/j.spl.2014.05.011.' ieee: Y. Feng, “Data-driven estimation of diurnal patterns of durations between trades on financial markets,” Statistics & Probability Letters, vol. 92, pp. 109–113, 2014. mla: Feng, Yuanhua. “Data-Driven Estimation of Diurnal Patterns of Durations between Trades on Financial Markets.” Statistics & Probability Letters, vol. 92, Elsevier BV, 2014, pp. 109–13, doi:10.1016/j.spl.2014.05.011. short: Y. Feng, Statistics & Probability Letters 92 (2014) 109–113. date_created: 2018-10-10T10:34:03Z date_updated: 2022-01-06T07:01:14Z department: - _id: '206' doi: 10.1016/j.spl.2014.05.011 intvolume: ' 92' language: - iso: eng page: 109-113 publication: Statistics & Probability Letters publication_identifier: issn: - 0167-7152 publication_status: published publisher: Elsevier BV status: public title: Data-driven estimation of diurnal patterns of durations between trades on financial markets type: journal_article user_id: '10075' volume: 92 year: '2014' ... --- _id: '461' author: - first_name: Sevil full_name: Dräxler, Sevil id: '31764' last_name: Dräxler citation: ama: Dräxler S. Adaptive Placement of Programmable Virtual Network Function Chains. Universität Paderborn; 2014. apa: Dräxler, S. (2014). Adaptive Placement of Programmable Virtual Network Function Chains. Universität Paderborn. bibtex: '@book{Dräxler_2014, title={Adaptive Placement of Programmable Virtual Network Function Chains}, publisher={Universität Paderborn}, author={Dräxler, Sevil}, year={2014} }' chicago: Dräxler, Sevil. Adaptive Placement of Programmable Virtual Network Function Chains. Universität Paderborn, 2014. ieee: S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains. Universität Paderborn, 2014. mla: Dräxler, Sevil. Adaptive Placement of Programmable Virtual Network Function Chains. Universität Paderborn, 2014. short: S. Dräxler, Adaptive Placement of Programmable Virtual Network Function Chains, Universität Paderborn, 2014. date_created: 2017-10-17T12:42:21Z date_updated: 2022-01-06T07:01:14Z department: - _id: '75' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Adaptive Placement of Programmable Virtual Network Function Chains type: bachelorsthesis user_id: '477' year: '2014' ... --- _id: '462' 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. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Skopalik A. A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014). ; 2014:625-630. doi:10.5220/0005110406250630' apa: Feldotto, M., & Skopalik, A. (2014). A Simulation Framework for Analyzing Complex Infinitely Repeated Games. In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014) (pp. 625–630). https://doi.org/10.5220/0005110406250630 bibtex: '@inproceedings{Feldotto_Skopalik_2014, title={A Simulation Framework for Analyzing Complex Infinitely Repeated Games}, DOI={10.5220/0005110406250630}, 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} }' chicago: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630. ieee: M. Feldotto and A. Skopalik, “A Simulation Framework for Analyzing Complex Infinitely Repeated Games,” in Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–630. mla: Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 2014, pp. 625–30, doi:10.5220/0005110406250630. 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.' date_created: 2017-10-17T12:42:22Z date_updated: 2022-01-06T07:01:15Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.5220/0005110406250630 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:21:24Z date_updated: 2018-03-16T11:21:24Z file_id: '1337' file_name: 462-FS2014SIMULTECH.pdf file_size: 993721 relation: main_file success: 1 file_date_updated: 2018-03-16T11:21:24Z has_accepted_license: '1' page: 625-630 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Teilprojekt A - _id: '7' name: SFB 901 - Subprojekt A3 publication: Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014) status: public title: A Simulation Framework for Analyzing Complex Infinitely Repeated Games type: conference user_id: '14052' year: '2014' ... --- _id: '463' 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. author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Ricardo full_name: Gomes da Silva, Ricardo last_name: Gomes da Silva - first_name: Peter full_name: Günther, Peter last_name: Günther - first_name: Juliane full_name: Krämer, Juliane last_name: Krämer - first_name: Jean-Pierre full_name: Seifert, Jean-Pierre last_name: Seifert 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: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22' apa: Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 123--136). https://doi.org/10.1109/FDTC.2014.22 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={10.1109/FDTC.2014.22}, 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} }' 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 Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22. 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 Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136. mla: Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22. 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.' date_created: 2017-10-17T12:42:22Z date_updated: 2022-01-06T07:01:16Z ddc: - '040' department: - _id: '64' doi: 10.1109/FDTC.2014.22 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-16T11:20:54Z date_updated: 2018-03-16T11:20:54Z file_id: '1336' file_name: 463-FDTC14.pdf file_size: 437518 relation: main_file success: 1 file_date_updated: 2018-03-16T11:20:54Z has_accepted_license: '1' page: 123--136 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '43' name: Securing the Financial Cloud publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) status: public title: A Practical Second-Order Fault Attack against a Real-World Pairing Implementation type: conference user_id: '25078' year: '2014' ...