--- _id: '669' abstract: - lang: eng text: We study a new class of games which generalizes congestion games andits bottleneck variant. We introduce congestion games with mixed objectives to modelnetwork scenarios in which players seek to optimize for latency and bandwidths alike.We characterize the (non-)existence of pure Nash equilibria (PNE), the convergenceof improvement dynamics, the quality of equilibria and show the complexity of thedecision problem. For games that do not possess PNE we give bounds on the approx-imation ratio of approximate pure Nash equilibria. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: Feldotto M, Leder L, Skopalik A. Congestion games with mixed objectives. Journal of Combinatorial Optimization. 2018;36(4):1145-1167. doi:10.1007/s10878-017-0189-y apa: Feldotto, M., Leder, L., & Skopalik, A. (2018). Congestion games with mixed objectives. Journal of Combinatorial Optimization, 36(4), 1145–1167. https://doi.org/10.1007/s10878-017-0189-y bibtex: '@article{Feldotto_Leder_Skopalik_2018, title={Congestion games with mixed objectives}, volume={36}, DOI={10.1007/s10878-017-0189-y}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2018}, pages={1145–1167} }' chicago: 'Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.' ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion games with mixed objectives,” Journal of Combinatorial Optimization, vol. 36, no. 4, pp. 1145–1167, 2018. mla: Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y. short: M. Feldotto, L. Leder, A. Skopalik, Journal of Combinatorial Optimization 36 (2018) 1145–1167. date_created: 2017-10-26T14:11:04Z date_updated: 2022-01-06T07:03:15Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/s10878-017-0189-y external_id: arxiv: - '1607.05143' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:57:32Z date_updated: 2018-10-31T16:57:32Z file_id: '5226' file_name: Feldotto2018_Article_CongestionGamesWithMixedObject.pdf file_size: 605207 relation: main_file success: 1 file_date_updated: 2018-10-31T16:57:32Z has_accepted_license: '1' intvolume: ' 36' issue: '4' language: - iso: eng page: 1145-1167 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Journal of Combinatorial Optimization publication_identifier: issn: - 1382-6905 - 1573-2886 publication_status: published publisher: Springer Nature status: public title: Congestion games with mixed objectives type: journal_article user_id: '14052' volume: 36 year: '2018' ... --- _id: '1186' author: - first_name: Arne full_name: Kemper, Arne last_name: Kemper citation: ama: Kemper A. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn; 2018. apa: Kemper, A. (2018). Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn. bibtex: '@book{Kemper_2018, title={Pure Nash Equilibria in Robust Congestion Games via Potential Functions}, publisher={Universität Paderborn}, author={Kemper, Arne}, year={2018} }' chicago: Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018. ieee: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018. mla: Kemper, Arne. Pure Nash Equilibria in Robust Congestion Games via Potential Functions. Universität Paderborn, 2018. short: A. Kemper, Pure Nash Equilibria in Robust Congestion Games via Potential Functions, Universität Paderborn, 2018. date_created: 2018-03-02T13:47:57Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Pure Nash Equilibria in Robust Congestion Games via Potential Functions type: mastersthesis user_id: '14052' year: '2018' ... --- _id: '1187' author: - first_name: Marcel full_name: Nachtigall, Marcel last_name: Nachtigall citation: ama: Nachtigall M. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn; 2018. apa: Nachtigall, M. (2018). Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn. bibtex: '@book{Nachtigall_2018, title={Scenario-driven Strategy Analysis in a n-player Composition Game Model}, publisher={Universität Paderborn}, author={Nachtigall, Marcel}, year={2018} }' chicago: Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018. ieee: M. Nachtigall, Scenario-driven Strategy Analysis in a n-player Composition Game Model. Universität Paderborn, 2018. mla: Nachtigall, Marcel. Scenario-Driven Strategy Analysis in a n-Player Composition Game Model. Universität Paderborn, 2018. short: M. Nachtigall, Scenario-Driven Strategy Analysis in a n-Player Composition Game Model, Universität Paderborn, 2018. date_created: 2018-03-02T13:49:39Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Scenario-driven Strategy Analysis in a n-player Composition Game Model type: bachelorsthesis user_id: '14052' year: '2018' ... --- _id: '1188' author: - first_name: Jérôme full_name: Kempf, Jérôme last_name: Kempf citation: ama: Kempf J. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn; 2018. apa: Kempf, J. (2018). Learning deterministic bandit behaviour form compositions. Universität Paderborn. bibtex: '@book{Kempf_2018, title={Learning deterministic bandit behaviour form compositions}, publisher={Universität Paderborn}, author={Kempf, Jérôme}, year={2018} }' chicago: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018. ieee: J. Kempf, Learning deterministic bandit behaviour form compositions. Universität Paderborn, 2018. mla: Kempf, Jérôme. Learning Deterministic Bandit Behaviour Form Compositions. Universität Paderborn, 2018. short: J. Kempf, Learning Deterministic Bandit Behaviour Form Compositions, Universität Paderborn, 2018. date_created: 2018-03-02T13:51:14Z date_updated: 2022-01-06T06:51:11Z department: - _id: '63' - _id: '541' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik title: Learning deterministic bandit behaviour form compositions type: bachelorsthesis user_id: '14052' year: '2018' ... --- _id: '1369' abstract: - lang: eng text: In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player. 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. Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. 2018. doi:10.1007/s10878-018-0269-7 apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-018-0269-7 bibtex: '@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={10.1007/s10878-018-0269-7}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }' chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7. ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” Journal of Combinatorial Optimization, 2018. mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7. short: M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018). date_created: 2018-03-18T11:12:49Z date_updated: 2022-01-06T06:51:42Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/s10878-018-0269-7 file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T16:56:13Z date_updated: 2018-10-31T16:56:13Z file_id: '5225' file_name: Drees2018_Article_PureNashEquilibriaInRestricted.pdf file_size: 561187 relation: main_file file_date_updated: 2018-10-31T16:56:13Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '4' name: SFB 901 - Project Area C - _id: '16' name: SFB 901 - Subproject C4 publication: Journal of Combinatorial Optimization publication_identifier: issn: - 1382-6905 - 1573-2886 publication_status: epub_ahead publisher: Springer Nature status: public title: Pure Nash equilibria in restricted budget games type: journal_article user_id: '14052' year: '2018' ... --- _id: '112' abstract: - lang: eng text: We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study $L_p$ norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Lennart full_name: Leder, Lennart last_name: Leder - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Leder L, Skopalik A. Congestion Games with Complementarities. In: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC). LNCS. ; 2017:222--233. doi:10.1007/978-3-319-57586-5_19' apa: Feldotto, M., Leder, L., & Skopalik, A. (2017). Congestion Games with Complementarities. In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC) (pp. 222--233). https://doi.org/10.1007/978-3-319-57586-5_19 bibtex: '@inproceedings{Feldotto_Leder_Skopalik_2017, series={LNCS}, title={Congestion Games with Complementarities}, DOI={10.1007/978-3-319-57586-5_19}, booktitle={Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2017}, pages={222--233}, collection={LNCS} }' chicago: Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19. ieee: M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Complementarities,” in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233. mla: Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19. short: 'M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233.' date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:58Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-57586-5_19 external_id: arxiv: - '1701.07304' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T13:05:37Z date_updated: 2018-03-21T13:05:37Z file_id: '1566' file_name: 112-FeldottoLederSkopalik2017.pdf file_size: 264089 relation: main_file success: 1 file_date_updated: 2018-03-21T13:05:37Z has_accepted_license: '1' page: 222--233 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 Algorithms and Complexity (CIAC) series_title: LNCS status: public title: Congestion Games with Complementarities type: conference user_id: '14052' year: '2017' ... --- _id: '113' abstract: - lang: eng text: We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7]. 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: Grammateia full_name: Kotsialou, Grammateia last_name: Kotsialou - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Feldotto M, Gairing M, Kotsialou G, Skopalik A. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In: Proceedings of the 13th International Conference on Web and Internet Economics (WINE). ; 2017. doi:10.1007/978-3-319-71924-5_14' apa: Feldotto, M., Gairing, M., Kotsialou, G., & Skopalik, A. (2017). Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. In Proceedings of the 13th International Conference on Web and Internet Economics (WINE). https://doi.org/10.1007/978-3-319-71924-5_14 bibtex: '@inproceedings{Feldotto_Gairing_Kotsialou_Skopalik_2017, title={Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}, DOI={10.1007/978-3-319-71924-5_14}, booktitle={Proceedings of the 13th International Conference on Web and Internet Economics (WINE)}, author={Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander}, year={2017} }' chicago: Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14. ieee: M. Feldotto, M. Gairing, G. Kotsialou, and A. Skopalik, “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games,” in Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. mla: Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14. short: 'M. Feldotto, M. Gairing, G. Kotsialou, A. Skopalik, in: Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017.' date_created: 2017-10-17T12:41:13Z date_updated: 2022-01-06T06:50:59Z ddc: - '000' department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-71924-5_14 external_id: arxiv: - '1710.01634' file: - access_level: closed content_type: application/pdf creator: feldi date_created: 2018-10-31T17:01:32Z date_updated: 2018-10-31T17:01:32Z file_id: '5231' file_name: Feldotto2017_Chapter_ComputingApproximatePureNashEq.pdf file_size: 279055 relation: main_file success: 1 file_date_updated: 2018-10-31T17:01:32Z has_accepted_license: '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: Proceedings of the 13th International Conference on Web and Internet Economics (WINE) status: public title: Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games type: conference user_id: '14052' year: '2017' ... --- _id: '17652' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Stojan full_name: Trajanovski, Stojan last_name: Trajanovski - first_name: Paola full_name: Grosso, Paola last_name: Grosso - first_name: Cees full_name: de Laat, Cees last_name: de Laat citation: ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-71150-8_1' apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering Undesirable Flows in Networks. In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1' bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }' chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.' ieee: 'G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, 2017, pp. 3–17.' mla: 'Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.' short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17.' date_created: 2020-08-06T15:19:48Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1007/978-3-319-71150-8_1 extern: '1' keyword: - flow - filter - MMSA - set cover - approximation - local ratio algorithm language: - iso: eng page: 3-17 place: Cham publication: 'Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I' publication_identifier: isbn: - 978-3-319-71150-8 publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Filtering Undesirable Flows in Networks type: conference user_id: '83983' year: '2017' ... --- _id: '17653' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:09Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - interaction - reciprocation - contribute - shared effort - curbing - convergence - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Reciprocation Effort Games type: conference user_id: '83983' year: '2017' ... --- _id: '17654' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: M.M. full_name: de Weerdt, M.M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.' apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence. Springer. bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }' chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In Proceedings of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer, 2017. ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in Proceedings of the 29th Benelux Conference on Artificial Intelligence, 2017. mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.' date_created: 2020-08-06T15:20:19Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - agents - projects - contribute - shared effort game - competition - quota - threshold - Nash equilibrium - social welfare - efficiency - price of anarchy - price of stability language: - iso: eng publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence publisher: Springer series_title: CCIS status: public title: Competition between Cooperative Projects type: conference user_id: '83983' year: '2017' ...