[{"date_created":"2020-08-06T15:20:30Z","status":"public","volume":"Volume 285: ECAI 2016","publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"department":[{"_id":"63"},{"_id":"541"}],"author":[{"full_name":"Polevoy, Gleb","first_name":"Gleb","id":"83983","last_name":"Polevoy"},{"full_name":"de Weerdt, M.M.","first_name":"M.M.","last_name":"de Weerdt"},{"first_name":"C.M.","full_name":"Jonker, C.M.","last_name":"Jonker"}],"user_id":"83983","title":"The Game of Reciprocation Habits","extern":"1","language":[{"iso":"eng"}],"page":"417-425","type":"conference","year":"2016","citation":{"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} }","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.","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.","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."},"series_title":"Frontiers in Artificial Intelligence and Applications","doi":"10.3233/978-1-61499-672-9-417","date_updated":"2022-01-06T06:53:16Z","_id":"17655"},{"publication_identifier":{"isbn":["978-1-4503-4239-1"]},"date_created":"2020-08-06T15:20:45Z","status":"public","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","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"},{"last_name":"Jonker","first_name":"Catholijn","full_name":"Jonker, Catholijn"}],"title":"The Convergence of Reciprocation","user_id":"83983","extern":"1","place":"Richland, SC","page":"1431-1432","type":"conference","year":"2016","citation":{"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.","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.","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.","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.","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} }","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."},"language":[{"iso":"eng"}],"series_title":"AAMAS '16","_id":"17656","date_updated":"2022-01-06T06:53:16Z"},{"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"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"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","page":"655--669","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.","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","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","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.","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} }"},"type":"conference","year":"2016","_id":"209","file_date_updated":"2018-10-31T17:03:44Z","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","author":[{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"full_name":"Leder, Lennart","first_name":"Lennart","last_name":"Leder"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"file":[{"date_created":"2018-10-31T17:03:44Z","file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","access_level":"closed","creator":"feldi","file_id":"5233","file_size":235739,"relation":"main_file","success":1,"date_updated":"2018-10-31T17:03:44Z","content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:32Z","status":"public","has_accepted_license":"1","abstract":[{"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.","lang":"eng"}],"ddc":["000"],"user_id":"14052"},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-12-19T10:10:17Z","publisher":"Universität Paderborn","author":[{"first_name":"Tobias","full_name":"Handirk, Tobias","last_name":"Handirk"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","title":"Über die Rolle von Informationen in Verkehrsnetzwerken","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","citation":{"apa":"Handirk, T. (2016). Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn.","ama":"Handirk T. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn; 2016.","chicago":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","mla":"Handirk, Tobias. Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016.","bibtex":"@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }","short":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016.","ieee":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken. Universität Paderborn, 2016."},"_id":"1082","date_updated":"2022-01-06T06:50:51Z"},{"date_created":"2017-10-17T12:41:23Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-21T12:48:02Z","publication":"IEEE/ACM Transactions on Networking","publisher":"IEEE","author":[{"full_name":"Harks, Tobias","first_name":"Tobias","last_name":"Harks"},{"last_name":"Höfer","full_name":"Höfer, Martin","first_name":"Martin"},{"first_name":"Kevin","full_name":"Schewior, Kevin","last_name":"Schewior"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"file":[{"file_size":1655309,"file_id":"1547","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T12:48:02Z","success":1,"relation":"main_file","file_name":"159-Harks-Hoefer-Schewior-Skopalik2016.pdf","date_created":"2018-03-21T12:48:02Z","access_level":"closed"}],"ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"Abstract—Max-min fairness (MMF) is a widely known approachto a fair allocation of bandwidth to each of the usersin a network. This allocation can be computed by uniformlyraising the bandwidths of all users without violating capacityconstraints. We consider an extension of these allocations byraising the bandwidth with arbitrary and not necessarily uniformtime-depending velocities (allocation rates). These allocationsare used in a game-theoretic context for routing choices, whichwe formalize in progressive filling games (PFGs). We present avariety of results for equilibria in PFGs. We show that these gamespossess pure Nash and strong equilibria. While computation ingeneral is NP-hard, there are polynomial-time algorithms forprominent classes of Max-Min-Fair Games (MMFG), includingthe case when all users have the same source-destination pair.We characterize prices of anarchy and stability for pure Nashand strong equilibria in PFGs and MMFGs when players havedifferent or the same source-destination pairs. In addition, weshow that when a designer can adjust allocation rates, it is possibleto design games with optimal strong equilibria. Some initial resultson polynomial-time algorithms in this direction are also derived."}],"page":"2553 - 2562","citation":{"short":"T. Harks, M. Höfer, K. Schewior, A. Skopalik, IEEE/ACM Transactions on Networking (2016) 2553–2562.","ieee":"T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games With Progressive Filling,” IEEE/ACM Transactions on Networking, no. 4, pp. 2553–2562, 2016.","apa":"Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2016). Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking, (4), 2553–2562. https://doi.org/10.1109/TNET.2015.2468571","ama":"Harks T, Höfer M, Schewior K, Skopalik A. Routing Games With Progressive Filling. IEEE/ACM Transactions on Networking. 2016;(4):2553-2562. doi:10.1109/TNET.2015.2468571","chicago":"Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.","mla":"Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.","bibtex":"@article{Harks_Höfer_Schewior_Skopalik_2016, title={Routing Games With Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, number={4}, journal={IEEE/ACM Transactions on Networking}, publisher={IEEE}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2016}, pages={2553–2562} }"},"year":"2016","type":"journal_article","issue":"4","_id":"159","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"},{"_id":"541"}],"title":"Routing Games With Progressive Filling","language":[{"iso":"eng"}],"doi":"10.1109/TNET.2015.2468571","date_updated":"2022-01-06T06:52:40Z"},{"abstract":[{"text":"In this paper we consider a strategic variant of the online facility location problem. Given is a graph in which each node serves two roles: it is a strategic client stating requests as well as a potential location for a facility. In each time step one client states a request which induces private costs equal to the distance to the closest facility. Before serving, the clients may collectively decide to open new facilities, sharing the corresponding price. Instead of optimizing the global costs, each client acts selfishly. The prices of new facilities vary between nodes and also change over time, but are always bounded by some fixed value α. Both the requests as well as the facility prices are given by an online sequence and are not known in advance.We characterize the optimal strategies of the clients and analyze their overall performance in comparison to a centralized offline solution. If all players optimize their own competitiveness, the global performance of the system is O(√α⋅α) times worse than the offline optimum. A restriction to a natural subclass of strategies improves this result to O(α). We also show that for fixed facility costs, we can find strategies such that this bound further improves to O(√α).","lang":"eng"}],"ddc":["040"],"user_id":"477","file_date_updated":"2018-03-21T12:55:43Z","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","author":[{"last_name":"Drees","first_name":"Maximilian","full_name":"Drees, Maximilian"},{"last_name":"Feldkord","id":"22704","first_name":"Björn","full_name":"Feldkord, Björn"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"file":[{"file_size":236253,"creator":"florida","file_id":"1553","date_updated":"2018-03-21T12:55:43Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-21T12:55:43Z","file_name":"149-chp_3A10.1007_2F978-3-319-48749-6_43.pdf","access_level":"closed"}],"date_created":"2017-10-17T12:41:21Z","has_accepted_license":"1","status":"public","_id":"149","page":"593--607","year":"2016","citation":{"mla":"Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.","bibtex":"@inproceedings{Drees_Feldkord_Skopalik_2016, series={LNCS}, title={Strategic Online Facility Location}, DOI={10.1007/978-3-319-48749-6_43}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Drees, Maximilian and Feldkord, Björn and Skopalik, Alexander}, year={2016}, pages={593--607}, collection={LNCS} }","apa":"Drees, M., Feldkord, B., & Skopalik, A. (2016). Strategic Online Facility Location. In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA) (pp. 593--607). https://doi.org/10.1007/978-3-319-48749-6_43","ama":"Drees M, Feldkord B, Skopalik A. Strategic Online Facility Location. In: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ; 2016:593--607. doi:10.1007/978-3-319-48749-6_43","chicago":"Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43.","ieee":"M. Drees, B. Feldkord, and A. Skopalik, “Strategic Online Facility Location,” in Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607.","short":"M. Drees, B. Feldkord, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607."},"type":"conference","title":"Strategic Online Facility Location","department":[{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T06:52:10Z","doi":"10.1007/978-3-319-48749-6_43","series_title":"LNCS","language":[{"iso":"eng"}]},{"department":[{"_id":"79"},{"_id":"63"},{"_id":"541"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication_status":"published","title":"Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM","date_updated":"2022-01-06T06:52:00Z","doi":"10.1002/cpe.3716","file":[{"relation":"main_file","success":1,"date_updated":"2018-03-21T12:57:57Z","content_type":"application/pdf","file_id":"1556","creator":"florida","file_size":3121363,"access_level":"closed","date_created":"2018-03-21T12:57:57Z","file_name":"145-Feldotto_et_al-2016-Concurrency_and_Computation-_Practice_and_Experience.pdf"}],"publication":"Concurrency and Computation: Practice and Experience","file_date_updated":"2018-03-21T12:57:57Z","author":[{"last_name":"Feldotto","id":"14052","first_name":"Matthias","orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias"},{"full_name":"Graffi, Kalman","first_name":"Kalman","last_name":"Graffi"}],"publisher":"Wiley Online Library","date_created":"2017-10-17T12:41:20Z","has_accepted_license":"1","status":"public","volume":28,"abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we present the peer-to-peer system simulator PeerfactSim.KOM, which we extended over the last years. PeerfactSim.KOM comes with an extensive layer model to support various facets and protocols of peer-to-peer networking. In this article, we describe PeerfactSim.KOM and show how it can be used for detailed measurements of large-scale peer-to-peer networks. We enhanced PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate sets of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated, and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. An immediate comparison of different configurations and overlays under different aspects is possible directly after the execution without any manual post-processing. "}],"user_id":"14052","ddc":["040"],"page":"1655-1677","year":"2016","citation":{"apa":"Feldotto, M., & Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677. https://doi.org/10.1002/cpe.3716","ama":"Feldotto M, Graffi K. Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience. 2016;28(5):1655-1677. doi:10.1002/cpe.3716","chicago":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience 28, no. 5 (2016): 1655–77. https://doi.org/10.1002/cpe.3716.","mla":"Feldotto, Matthias, and Kalman Graffi. “Systematic Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, Wiley Online Library, 2016, pp. 1655–77, doi:10.1002/cpe.3716.","bibtex":"@article{Feldotto_Graffi_2016, title={Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM}, volume={28}, DOI={10.1002/cpe.3716}, number={5}, journal={Concurrency and Computation: Practice and Experience}, publisher={Wiley Online Library}, author={Feldotto, Matthias and Graffi, Kalman}, year={2016}, pages={1655–1677} }","short":"M. Feldotto, K. Graffi, Concurrency and Computation: Practice and Experience 28 (2016) 1655–1677.","ieee":"M. Feldotto and K. Graffi, “Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM,” Concurrency and Computation: Practice and Experience, vol. 28, no. 5, pp. 1655–1677, 2016."},"type":"journal_article","intvolume":" 28","_id":"145","issue":"5"},{"supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"year":"2015","type":"mastersthesis","citation":{"ama":"Pfannschmidt K. Solving the Aggregated Bandits Problem. Universität Paderborn; 2015.","apa":"Pfannschmidt, K. (2015). Solving the aggregated bandits problem. Universität Paderborn.","chicago":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.","mla":"Pfannschmidt, Karlson. Solving the Aggregated Bandits Problem. Universität Paderborn, 2015.","bibtex":"@book{Pfannschmidt_2015, title={Solving the aggregated bandits problem}, publisher={Universität Paderborn}, author={Pfannschmidt, Karlson}, year={2015} }","short":"K. Pfannschmidt, Solving the Aggregated Bandits Problem, Universität Paderborn, 2015.","ieee":"K. Pfannschmidt, Solving the aggregated bandits problem. Universität Paderborn, 2015."},"_id":"251","date_updated":"2022-01-06T06:56:50Z","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:41:41Z","author":[{"last_name":"Pfannschmidt","full_name":"Pfannschmidt, Karlson","first_name":"Karlson"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","title":"Solving the aggregated bandits problem"},{"citation":{"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} }","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.","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","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.","short":"I. Caragiannis, A. Fanelli, N. Gravin, A. Skopalik, Transactions on Economics and Computation 3 (2015)."},"type":"journal_article","year":"2015","_id":"320","intvolume":" 3","issue":"1","article_number":"2","file":[{"file_size":260503,"creator":"florida","file_id":"1433","date_updated":"2018-03-20T07:40:55Z","content_type":"application/pdf","success":1,"relation":"main_file","file_name":"320-a2-caragiannis.pdf","date_created":"2018-03-20T07:40:55Z","access_level":"closed"}],"publication":"Transactions on Economics and Computation","file_date_updated":"2018-03-20T07:40:55Z","author":[{"last_name":"Caragiannis","first_name":"Ioannis","full_name":"Caragiannis, Ioannis"},{"full_name":"Fanelli, Angelo","first_name":"Angelo","last_name":"Fanelli"},{"first_name":"Nick","full_name":"Gravin, Nick","last_name":"Gravin"},{"full_name":"Skopalik, Alexander","first_name":"Alexander","id":"40384","last_name":"Skopalik"}],"publisher":"ACM","date_created":"2017-10-17T12:41:54Z","status":"public","has_accepted_license":"1","volume":3,"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."}],"user_id":"477","ddc":["040"],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:04Z","doi":"10.1145/2614687","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"title":"Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure"},{"user_id":"14052","title":"Budget Games with priced strategies","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:41:53Z","publisher":"Universität Paderborn","author":[{"last_name":"Pautz","first_name":"Jannis","full_name":"Pautz, Jannis"}],"department":[{"_id":"63"},{"_id":"541"}],"_id":"316","date_updated":"2022-01-06T06:59:01Z","supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"year":"2015","citation":{"chicago":"Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.","apa":"Pautz, J. (2015). Budget Games with priced strategies. Universität Paderborn.","ama":"Pautz J. Budget Games with Priced Strategies. Universität Paderborn; 2015.","mla":"Pautz, Jannis. Budget Games with Priced Strategies. Universität Paderborn, 2015.","bibtex":"@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }","short":"J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.","ieee":"J. Pautz, Budget Games with priced strategies. Universität Paderborn, 2015."},"type":"bachelorsthesis"}]