[{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"},{"_id":"63"}],"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","language":[{"iso":"eng"}],"doi":"10.1145/2935764.2935783","date_updated":"2022-01-06T06:55:02Z","date_created":"2017-10-17T12:41:33Z","has_accepted_license":"1","status":"public","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-21T10:41:40Z","content_type":"application/pdf","file_id":"1518","creator":"florida","file_size":352996,"access_level":"closed","date_created":"2018-03-21T10:41:40Z","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf"}],"file_date_updated":"2018-03-21T10:41:40Z","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"14955","ddc":["040"],"abstract":[{"text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems.","lang":"eng"}],"page":"417--427","year":"2016","type":"conference","citation":{"chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783.","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783","apa":"Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427."},"_id":"215"},{"title":"The Game of Reciprocation Habits","user_id":"83983","extern":"1","volume":"Volume 285: ECAI 2016","status":"public","date_created":"2020-08-06T15:20:30Z","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"last_name":"de Weerdt","first_name":"M.M.","full_name":"de Weerdt, M.M."},{"last_name":"Jonker","first_name":"C.M.","full_name":"Jonker, C.M."}],"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","department":[{"_id":"63"},{"_id":"541"}],"doi":"10.3233/978-1-61499-672-9-417","_id":"17655","date_updated":"2022-01-06T06:53:16Z","year":"2016","type":"conference","citation":{"ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of the 2016 European Conference on Artificial Intelligence, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume 285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417}, booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence}, author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425}, collection={Frontiers in Artificial Intelligence and Applications} }","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: Proceedings of the 2016 European Conference on Artificial Intelligence. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:10.3233/978-1-61499-672-9-417","apa":"Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence (Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417","chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. https://doi.org/10.3233/978-1-61499-672-9-417."},"page":"417-425","language":[{"iso":"eng"}],"series_title":"Frontiers in Artificial Intelligence and Applications"},{"_id":"17656","date_updated":"2022-01-06T06:53:16Z","language":[{"iso":"eng"}],"citation":{"ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432.","apa":"Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation. In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","bibtex":"@inproceedings{Polevoy_de Weerdt_Jonker_2016, place={Richland, SC}, series={AAMAS ’16}, title={The Convergence of Reciprocation}, booktitle={Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}, year={2016}, pages={1431–1432}, collection={AAMAS ’16} }","short":"G. Polevoy, M. de Weerdt, C. Jonker, in: Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2016, pp. 1431–1432.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems, 2016, pp. 1431–1432."},"type":"conference","year":"2016","page":"1431-1432","series_title":"AAMAS '16","user_id":"83983","title":"The Convergence of Reciprocation","place":"Richland, SC","extern":"1","status":"public","date_created":"2020-08-06T15:20:45Z","publication_identifier":{"isbn":["978-1-4503-4239-1"]},"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","last_name":"Polevoy","id":"83983"},{"last_name":"de Weerdt","full_name":"de Weerdt, Mathijs","first_name":"Mathijs"},{"first_name":"Catholijn","full_name":"Jonker, Catholijn","last_name":"Jonker"}],"keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"department":[{"_id":"63"},{"_id":"541"}],"publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems"},{"_id":"177","type":"conference","citation":{"bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={On the Parameterized Parallel Complexity and the Vertex Cover Problem}, DOI={10.1007/978-3-319-48749-6_35}, booktitle={Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={477–488}, collection={LNCS} }","mla":"Abu-Khzam, Faisal N., et al. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–88, doi:10.1007/978-3-319-48749-6_35.","chicago":"Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “On the Parameterized Parallel Complexity and the Vertex Cover Problem.” In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 477–88. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_35.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2016). On the Parameterized Parallel Complexity and the Vertex Cover Problem. In Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 477–488). https://doi.org/10.1007/978-3-319-48749-6_35","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. On the Parameterized Parallel Complexity and the Vertex Cover Problem. In: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:477-488. doi:10.1007/978-3-319-48749-6_35","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “On the Parameterized Parallel Complexity and the Vertex Cover Problem,” in Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488.","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 477–488."},"year":"2016","page":"477-488","abstract":[{"text":"Efficiently parallelizable parameterized problems have been classified as being either in the class FPP (fixed-parameter parallelizable) or the class PNC (parameterized analog of NC), which contains FPP as a subclass. In this paper, we propose a more restrictive class of parallelizable parameterized problems called fixed-parameter parallel-tractable (FPPT). For a problem to be in FPPT, it should possess an efficient parallel algorithm not only from a theoretical standpoint but in practice as well. The primary distinction between FPPT and FPP is the parallel processor utilization, which is bounded by a polynomial function in the case of FPPT. We initiate the study of FPPT with the well-known k-vertex cover problem. In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n), where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. We also note that a few P-complete problems fall into FPPT including the monotone circuit value problem (MCV) when the underlying graphs are bounded by a constant Euler genus.","lang":"eng"}],"ddc":["000"],"user_id":"477","author":[{"first_name":"Faisal N.","full_name":"Abu-Khzam, Faisal N.","last_name":"Abu-Khzam"},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"full_name":"Markarian, Christine","first_name":"Christine","id":"37612","last_name":"Markarian"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"publication":"Proceedings of the 10th International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-11-02T14:15:18Z","file":[{"success":1,"relation":"main_file","date_updated":"2018-11-02T14:15:18Z","content_type":"application/pdf","file_id":"5266","creator":"ups","file_size":293345,"access_level":"closed","file_name":"OnTheParameterizedParallelComp.pdf","date_created":"2018-11-02T14:15:18Z"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:26Z","date_updated":"2022-01-06T06:53:17Z","doi":"10.1007/978-3-319-48749-6_35","series_title":"LNCS","language":[{"iso":"eng"}],"title":"On the Parameterized Parallel Complexity and the Vertex Cover Problem","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"type":"journal_editor","year":"2016","citation":{"apa":"Meyer auf der Heide, F. (Ed.). (2016). Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC). https://doi.org/10.1145/2936716","ama":"Meyer auf der Heide F, ed. Introduction to the Special Issue on SPAA 2014.; 2016. doi:10.1145/2936716","chicago":"Meyer auf der Heide, Friedhelm, ed. Introduction to the Special Issue on SPAA 2014. Transactions on Parallel Computing (TOPC), 2016. https://doi.org/10.1145/2936716.","mla":"Meyer auf der Heide, Friedhelm, editor. “Introduction to the Special Issue on SPAA 2014.” Transactions on Parallel Computing (TOPC), no. 1, 2016, doi:10.1145/2936716.","bibtex":"@book{Meyer auf der Heide_2016, title={Introduction to the Special Issue on SPAA 2014}, DOI={10.1145/2936716}, number={1}, journal={Transactions on Parallel Computing (TOPC)}, year={2016} }","short":"F. Meyer auf der Heide, ed., Introduction to the Special Issue on SPAA 2014, 2016.","ieee":"F. Meyer auf der Heide, Ed., Introduction to the Special Issue on SPAA 2014, no. 1. 2016."},"page":"1","_id":"187","date_updated":"2022-01-06T06:53:51Z","doi":"10.1145/2936716","issue":"1","file_date_updated":"2018-03-21T12:31:42Z","department":[{"_id":"63"}],"publication":"Transactions on Parallel Computing (TOPC)","file":[{"file_size":34053,"creator":"florida","file_id":"1531","date_updated":"2018-03-21T12:31:42Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"187-a1-heide.pdf","date_created":"2018-03-21T12:31:42Z","access_level":"closed"}],"editor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:28Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Introduction to the Special Issue on SPAA 2014","ddc":["040"],"user_id":"15504"},{"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:32Z","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Riechers","first_name":"Sören","full_name":"Riechers, Sören"}],"file_date_updated":"2018-11-02T14:18:51Z","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file":[{"date_updated":"2018-11-02T14:18:51Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":608614,"file_id":"5268","creator":"ups","access_level":"closed","date_created":"2018-11-02T14:18:51Z","file_name":"Cost-EfficientSchedulingOnMach.pdf"}],"ddc":["000"],"user_id":"477","abstract":[{"text":"We consider a scheduling problem where machines need to be rented from the cloud in order to process jobs. There are two types of machines available which can be rented for machine-type dependent prices and for arbitrary durations. However, a machine-type dependent setup time is required before a machine is available for processing. Jobs arrive online over time, have machine-type dependent sizes and have individual deadlines. The objective is to rent machines and schedule jobs so as to meet all deadlines while minimizing the rental cost. Since we observe the slack of jobs to have a fundamental influence on the competitiveness, we study the model when instances are parameterized by their (minimum) slack. An instance is called to have a slack of $\\beta$ if, for all jobs, the difference between the job's release time and the latest point in time at which it needs to be started is at least $\\beta$. While for $\\beta series = {LNCS}","lang":"eng"}],"year":"2016","citation":{"ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592. doi:10.1007/978-3-319-48749-6_42","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42."},"type":"conference","page":"578--592","_id":"207","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"title":"Cost-efficient Scheduling on Machines from the Cloud","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-48749-6_42","date_updated":"2022-01-06T06:54:33Z"},{"file":[{"access_level":"closed","file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","date_created":"2018-10-31T17:03:44Z","content_type":"application/pdf","date_updated":"2018-10-31T17:03:44Z","relation":"main_file","success":1,"file_size":235739,"file_id":"5233","creator":"feldi"}],"author":[{"first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","last_name":"Feldotto","id":"14052"},{"last_name":"Leder","full_name":"Leder, Lennart","first_name":"Lennart"},{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file_date_updated":"2018-10-31T17:03:44Z","status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:32Z","abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria."}],"user_id":"14052","ddc":["000"],"year":"2016","citation":{"short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.","ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:655--669. doi:10.1007/978-3-319-48749-6_47","apa":"Feldotto, M., Leder, L., & Skopalik, A. (2016). Congestion Games with Mixed Objectives. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 655--669). https://doi.org/10.1007/978-3-319-48749-6_47","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={10.1007/978-3-319-48749-6_47}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47."},"type":"conference","page":"655--669","_id":"209","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"external_id":{"arxiv":["1607.05143"]},"title":"Congestion Games with Mixed Objectives","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:41Z","doi":"10.1007/978-3-319-48749-6_47"},{"department":[{"_id":"63"}],"author":[{"last_name":"Bülling","first_name":"Jonas","full_name":"Bülling, Jonas"}],"date_created":"2018-11-07T09:26:42Z","status":"public","user_id":"22704","title":"Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden","language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"apa":"Bülling, J. (2016). Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden.","ama":"Bülling J. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden.; 2016.","chicago":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","bibtex":"@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}, author={Bülling, Jonas}, year={2016} }","mla":"Bülling, Jonas. Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden. 2016.","short":"J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","ieee":"J. Bülling, Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden. 2016."},"year":"2016","_id":"5406","date_updated":"2022-01-06T07:01:51Z"},{"title":"Price-Based Allocation Games","user_id":"477","publisher":"Universität Paderborn","author":[{"last_name":"Koepe","first_name":"Jörn","full_name":"Koepe, Jörn"}],"department":[{"_id":"63"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-11-07T09:45:57Z","date_updated":"2022-01-06T07:01:51Z","_id":"5407","citation":{"bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","mla":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","apa":"Koepe, J. (2016). Price-Based Allocation Games. Universität Paderborn.","ama":"Koepe J. Price-Based Allocation Games. Universität Paderborn; 2016.","chicago":"Koepe, Jörn. Price-Based Allocation Games. Universität Paderborn, 2016.","ieee":"J. Koepe, Price-Based Allocation Games. Universität Paderborn, 2016.","short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016."},"year":"2016","type":"bachelorsthesis","language":[{"iso":"eng"}]},{"title":"Friendship Processes in Network Creation Games","user_id":"477","department":[{"_id":"63"}],"publisher":"Universität Paderborn","author":[{"first_name":"Damian","full_name":"Kutzias, Damian","last_name":"Kutzias"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-11-14T06:50:35Z","status":"public","_id":"688","date_updated":"2022-01-06T07:03:23Z","year":"2016","type":"mastersthesis","citation":{"ieee":"D. Kutzias, Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","mla":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016.","ama":"Kutzias D. Friendship Processes in Network Creation Games. Universität Paderborn; 2016.","apa":"Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.","chicago":"Kutzias, Damian. Friendship Processes in Network Creation Games. Universität Paderborn, 2016."},"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}]}]