--- _id: '20005' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: ama: 'Dorigo M, Hamann H, Valentini G. Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015). ; 2015.' apa: 'Dorigo, M., Hamann, H., & Valentini, G. (2015). Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015).' bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}, booktitle={Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }' chicago: 'Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” In Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' ieee: 'M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' mla: 'Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' short: 'M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.' date_created: 2020-10-15T12:29:26Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015) status: public title: 'Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off' type: conference user_id: '15415' year: '2015' ... --- _id: '20006' author: - first_name: Marco full_name: Dorigo, Marco last_name: Dorigo - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann - first_name: Gabriele full_name: Valentini, Gabriele last_name: Valentini citation: ama: 'Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a robot swarm. In: AAAI-15 Video Proceedings. ; 2015.' apa: Dorigo, M., Hamann, H., & Valentini, G. (2015). Self-organized collective decisions in a robot swarm. In AAAI-15 Video Proceedings. bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Self-organized collective decisions in a robot swarm}, booktitle={AAAI-15 Video Proceedings}, author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }' chicago: Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective Decisions in a Robot Swarm.” In AAAI-15 Video Proceedings, 2015. ieee: M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions in a robot swarm,” in AAAI-15 Video Proceedings, 2015. mla: Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.” AAAI-15 Video Proceedings, 2015. short: 'M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.' date_created: 2020-10-15T12:38:13Z date_updated: 2022-01-06T06:54:18Z department: - _id: '63' - _id: '238' language: - iso: eng publication: AAAI-15 Video Proceedings status: public title: Self-organized collective decisions in a robot swarm type: conference user_id: '15415' year: '2015' ... --- _id: '266' abstract: - lang: eng text: 'Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of "online leasing problems" by introducing leasing to online optimization problems. Resources required to provide a service in an "online leasing problem" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of "online resource leasing problems". ' author: - 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 citation: ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ; 2015:343-344. doi:10.1145/2767386.2767454' apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454 bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={10.1145/2767386.2767454}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }' chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454. ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344. mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454. short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.' date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:22Z ddc: - '040' department: - _id: '63' doi: 10.1145/2767386.2767454 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:11Z date_updated: 2018-03-21T09:33:11Z file_id: '1478' file_name: 266-p343-markarian.pdf file_size: 679580 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:11Z has_accepted_license: '1' page: 343-344 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC) status: public title: Online Resource Leasing type: conference user_id: '15504' year: '2015' ... --- _id: '267' author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian citation: ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015. apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn. bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }' chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015. mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn, 2015. short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:26Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:33:41Z date_updated: 2018-03-21T09:33:41Z file_id: '1479' file_name: 267-Dissertation_-_Markarian.pdf file_size: 1328685 relation: main_file success: 1 file_date_updated: 2018-03-21T09:33:41Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656 status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online Resource Leasing type: dissertation user_id: '15415' year: '2015' ... --- _id: '320' abstract: - lang: eng text: 'We consider structural and algorithmic questions related to the Nash dynamics of weighted congestion games. In weighted congestion games with linear latency functions, the existence of pure Nash equilibria is guaranteed by a potential function argument. Unfortunately, this proof of existence is inefficient and computing pure Nash equilibria in such games is a PLS-hard problem even when all players have unit weights. The situation gets worse when superlinear (e.g., quadratic) latency functions come into play; in this case, the Nash dynamics of the game may contain cycles and pure Nash equilibria may not even exist. Given these obstacles, we consider approximate pure Nash equilibria as alternative solution concepts. A ρ--approximate pure Nash equilibrium is a state of a (weighted congestion) game from which no player has any incentive to deviate in order to improve her cost by a multiplicative factor higher than ρ. Do such equilibria exist for small values of ρ? And if so, can we compute them efficiently?We provide positive answers to both questions for weighted congestion games with polynomial latency functions by exploiting an “approximation” of such games by a new class of potential games that we call Ψ-games. This allows us to show that these games have d!-approximate pure Nash equilibria, where d is the maximum degree of the latency functions. Our main technical contribution is an efficient algorithm for computing O(1)-approximate pure Nash equilibria when d is a constant. For games with linear latency functions, the approximation guarantee is 3+√5/2 + Oγ for arbitrarily small γ > 0; for latency functions with maximum degree d≥ 2, it is d2d+o(d). The running time is polynomial in the number of bits in the representation of the game and 1/γ. As a byproduct of our techniques, we also show the following interesting structural statement for weighted congestion games with polynomial latency functions of maximum degree d ≥ 2: polynomially-long sequences of best-response moves from any initial state to a dO(d2)-approximate pure Nash equilibrium exist and can be efficiently identified in such games as long as d is a constant.To the best of our knowledge, these are the first positive algorithmic results for approximate pure Nash equilibria in weighted congestion games. Our techniques significantly extend our recent work on unweighted congestion games through the use of Ψ-games. The concept of approximating nonpotential games by potential ones is interesting in itself and might have further applications.' article_number: '2' author: - first_name: Ioannis full_name: Caragiannis, Ioannis last_name: Caragiannis - first_name: Angelo full_name: Fanelli, Angelo last_name: Fanelli - first_name: Nick full_name: Gravin, Nick last_name: Gravin - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Caragiannis I, Fanelli A, Gravin N, Skopalik A. Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation. 2015;3(1). doi:10.1145/2614687' apa: 'Caragiannis, I., Fanelli, A., Gravin, N., & Skopalik, A. (2015). Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure. Transactions on Economics and Computation, 3(1). https://doi.org/10.1145/2614687' bibtex: '@article{Caragiannis_Fanelli_Gravin_Skopalik_2015, title={Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure}, volume={3}, DOI={10.1145/2614687}, number={12}, journal={Transactions on Economics and Computation}, publisher={ACM}, author={Caragiannis, Ioannis and Fanelli, Angelo and Gravin, Nick and Skopalik, Alexander}, year={2015} }' chicago: 'Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation 3, no. 1 (2015). https://doi.org/10.1145/2614687.' ieee: 'I. Caragiannis, A. Fanelli, N. Gravin, and A. Skopalik, “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure,” Transactions on Economics and Computation, vol. 3, no. 1, 2015.' mla: 'Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.' short: I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015). date_created: 2017-10-17T12:41:54Z date_updated: 2022-01-06T06:59:04Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1145/2614687 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:40:55Z date_updated: 2018-03-20T07:40:55Z file_id: '1433' file_name: 320-a2-caragiannis.pdf file_size: 260503 relation: main_file success: 1 file_date_updated: 2018-03-20T07:40:55Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Transactions on Economics and Computation publisher: ACM status: public title: 'Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure' type: journal_article user_id: '477' volume: 3 year: '2015' ... --- _id: '316' author: - first_name: Jannis full_name: Pautz, Jannis last_name: Pautz citation: ama: Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015. apa: Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn. bibtex: '@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }' chicago: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015. ieee: J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015. mla: Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015. short: J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:53Z date_updated: 2022-01-06T06:59:01Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Budget Games with priced strategies type: bachelorsthesis user_id: '14052' year: '2015' ... --- _id: '317' author: - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn citation: ama: Jähn C. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn; 2015. apa: Jähn, C. (2015). Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn. bibtex: '@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015} }' chicago: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015. ieee: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015. mla: Jähn, Claudius. Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen. Universität Paderborn, 2015. short: C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:53Z date_updated: 2022-01-06T06:59:02Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:20:34Z date_updated: 2018-03-21T09:20:34Z file_id: '1462' file_name: 317-Dissertation_ClaudiusJaehn.pdf file_size: 20442332 relation: main_file success: 1 file_date_updated: 2018-03-21T09:20:34Z has_accepted_license: '1' language: - iso: ger publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen type: dissertation user_id: '14052' year: '2015' ... --- _id: '270' author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff citation: ama: Abshoff S. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn; 2015. apa: Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn. bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }' chicago: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015. ieee: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn, 2015. mla: Abshoff, Sebastian. On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks. Universität Paderborn, 2015. short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:44Z date_updated: 2022-01-06T06:57:32Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:30:02Z date_updated: 2018-03-21T09:30:02Z file_id: '1476' file_name: 270-Dissertation_-_Abshoff.pdf file_size: 448614 relation: main_file success: 1 file_date_updated: 2018-03-21T09:30:02Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks type: dissertation user_id: '477' year: '2015' ... --- _id: '271' abstract: - lang: eng text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\alpha$ through unilateral strategy changes. There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\alpha$-approximate pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for $\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold $\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard. We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum. author: - first_name: Maximilian full_name: Drees, Maximilian last_name: Drees - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - 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, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14' apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14 bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes in Computer Science}, title={On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14}, booktitle={Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture Notes in Computer Science} }' chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14. ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189. mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14. short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.' date_created: 2017-10-17T12:41:45Z date_updated: 2022-01-06T06:57:34Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-662-48433-3_14 external_id: arxiv: - '1507.02908' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:29:34Z date_updated: 2018-03-21T09:29:34Z file_id: '1475' file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf file_size: 256718 relation: main_file success: 1 file_date_updated: 2018-03-21T09:29:34Z has_accepted_license: '1' page: 178-189 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '16' name: SFB 901 - Subproject C4 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT) series_title: Lecture Notes in Computer Science status: public title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games type: conference user_id: '14052' year: '2015' ... --- _id: '274' abstract: - lang: eng text: Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2. author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Sören full_name: Riechers, Sören last_name: Riechers citation: ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553. doi:10.1007/978-3-319-21840-3_45' apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, & U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553). https://doi.org/10.1007/978-3-319-21840-3_45' bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={10.1007/978-3-319-21840-3_45}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }' chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.' ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.' mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.' short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.' date_created: 2017-10-17T12:41:45Z date_updated: 2022-01-06T06:57:39Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-21840-3_45 editor: - first_name: Frank full_name: Dehne, Frank last_name: Dehne - first_name: Jörg Rüdiger full_name: Sack, Jörg Rüdiger last_name: Sack - first_name: Ulrike full_name: Stege, Ulrike last_name: Stege file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:28:34Z date_updated: 2018-03-21T09:28:34Z file_id: '1473' file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf file_size: 215498 relation: main_file success: 1 file_date_updated: 2018-03-21T09:28:34Z has_accepted_license: '1' page: 542--553 project: - _id: '1' name: SFB 901 - _id: '16' name: SFB 901 - Subprojekt C4 - _id: '4' name: SFB 901 - Project Area C publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings' series_title: Lecture Notes in Computer Science status: public title: Non-preemptive Scheduling on Machines with Setup Times type: conference user_id: '15504' year: '2015' ...