--- _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: '277' author: - first_name: Nils full_name: Kothe, Nils last_name: Kothe citation: ama: Kothe N. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn; 2015. apa: Kothe, N. (2015). Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn. bibtex: '@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils}, year={2015} }' chicago: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015. ieee: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015. mla: Kothe, Nils. Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk. Universität Paderborn, 2015. short: N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:46Z date_updated: 2022-01-06T06:57:44Z department: - _id: '63' - _id: '541' language: - iso: ger 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: Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk type: bachelorsthesis user_id: '14052' year: '2015' ... --- _id: '17657' abstract: - lang: eng text: Inter-datacenter transfers of non-interactive but timely large flows over a private (managed) network is an important problem faced by many cloud service providers. The considered flows are non-interactive because they do not explicitly target the end users. However, most of them must be performed on a timely basis and are associated with a deadline. We propose to schedule these flows by a centralized controller, which determines when to transmit each flow and which path to use. Two scheduling models are presented in this paper. In the first, the controller also determines the rate of each flow, while in the second bandwidth is assigned by the network according to the TCP rules. We develop scheduling algorithms for both models and compare their complexity and performance. author: - first_name: R. full_name: Cohen, R. last_name: Cohen - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy citation: ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964 apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964 bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964}, number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R. and Polevoy, Gleb}, year={2015}, pages={1–1} }' chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.' ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015. mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1, doi:10.1109/TCC.2015.2487964. short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1. date_created: 2020-08-06T15:20:58Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1109/TCC.2015.2487964 extern: '1' issue: '99' keyword: - Approximation algorithms - Approximation methods - Bandwidth - Cloud computing - Routing - Schedules - Scheduling language: - iso: eng page: 1-1 publication: Cloud Computing, IEEE Transactions on publication_identifier: issn: - 2168-7161 status: public title: Inter-Datacenter Scheduling of Large Data Flows type: journal_article user_id: '83983' volume: PP year: '2015' ... --- _id: '17658' abstract: - lang: eng text: 'Abstract We study the problem of bandwidth allocation with multiple interferences. In this problem the input consists of a set of users and a set of base stations. Each user has a list of requests, each consisting of a base station, a frequency demand, and a profit that may be gained by scheduling this request. The goal is to find a maximum profit set of user requests S that satisfies the following conditions: (i) S contains at most one request per user, (ii) the frequency sets allotted to requests in S that correspond to the same base station are pairwise non-intersecting, and (iii) the QoS received by any user at any frequency is reasonable according to an interference model. In this paper we consider two variants of bandwidth allocation with multiple interferences. In the first each request specifies a demand that can be satisfied by any subset of frequencies that is large enough. In the second each request specifies a specific frequency interval. Furthermore, we consider two interference models, multiplicative and additive. We show that these problems are extremely hard to approximate if the interferences depend on both the interfered and the interfering base stations. On the other hand, we provide constant factor approximation algorithms for both variants of bandwidth allocation with multiple interferences for the case where the interferences depend only on the interfering base stations. We also consider a restrictive special case that is closely related to the Knapsack problem. We show that this special case is NP-hard and that it admits an FPTAS. ' author: - first_name: Reuven full_name: Bar-Yehuda, Reuven last_name: Bar-Yehuda - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Dror full_name: Rawitz, Dror last_name: Rawitz citation: ama: Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics . 2015;194:23-36. doi:http://dx.doi.org/10.1016/j.dam.2015.05.013 apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics , 194, 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013 bibtex: '@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in cellular networks with multiple interferences}, volume={194}, DOI={http://dx.doi.org/10.1016/j.dam.2015.05.013}, journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }' chicago: 'Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics 194 (2015): 23–36. http://dx.doi.org/10.1016/j.dam.2015.05.013.' ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” Discrete Applied Mathematics , vol. 194, pp. 23–36, 2015. mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” Discrete Applied Mathematics , vol. 194, Elsevier, 2015, pp. 23–36, doi:http://dx.doi.org/10.1016/j.dam.2015.05.013. short: R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics 194 (2015) 23–36. date_created: 2020-08-06T15:21:15Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: http://dx.doi.org/10.1016/j.dam.2015.05.013 extern: '1' intvolume: ' 194' keyword: - Local ratio language: - iso: eng page: 23 - 36 publication: 'Discrete Applied Mathematics ' publication_identifier: issn: - 0166-218X publisher: Elsevier status: public title: Bandwidth allocation in cellular networks with multiple interferences type: journal_article user_id: '83983' volume: 194 year: '2015' ... --- _id: '370' abstract: - lang: eng text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the bandwidths of all users without violating capacity constraints. We consider an extension of these allocations by raising the bandwidth with arbitrary and not necessarily uniform time-depending velocities (allocation rates). These allocations are used in a game-theoretic context for routing choices, which we formalize in progressive filling games (PFGs).We present a variety of results for equilibria in PFGs. We show that these games possess pure Nash and strong equilibria. While computation in general is NP-hard, there are polynomial-time algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case when all users have the same source-destination pair. We characterize prices of anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when players have different or the same source-destination pairs. In addition, we show that when a designer can adjust allocation rates, it is possible to design games with optimal strong equilibria. Some initial results on polynomial-time algorithms in this direction are also derived. ' author: - first_name: Tobias full_name: Harks, Tobias last_name: Harks - first_name: Martin full_name: Höfer, Martin last_name: Höfer - first_name: Kevin full_name: Schewior, Kevin last_name: Schewior - first_name: Alexander full_name: Skopalik, Alexander id: '40384' last_name: Skopalik citation: ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling. In: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571' apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games with Progressive Filling. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571 bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games with Progressive Filling}, DOI={10.1109/TNET.2015.2468571}, booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior, Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }' chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571. ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive Filling,” in Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360. mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–60, doi:10.1109/TNET.2015.2468571. short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14), 2014, pp. 352–360.' date_created: 2017-10-17T12:42:04Z date_updated: 2022-01-06T06:59:30Z ddc: - '040' department: - _id: '63' - _id: '541' doi: 10.1109/TNET.2015.2468571 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-20T07:17:04Z date_updated: 2018-03-20T07:17:04Z file_id: '1402' file_name: 370-HHSS14.pdf file_size: 179583 relation: main_file success: 1 file_date_updated: 2018-03-20T07:17:04Z has_accepted_license: '1' language: - iso: eng page: 352-360 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 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14) status: public title: Routing Games with Progressive Filling type: conference user_id: '477' year: '2014' ... --- _id: '373' author: - first_name: David full_name: Pahl, David last_name: Pahl citation: ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn; 2014. apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn. bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen}, publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }' chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität Paderborn, 2014. short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität Paderborn, 2014. date_created: 2017-10-17T12:42:04Z date_updated: 2022-01-06T06:59:31Z department: - _id: '63' - _id: '541' language: - iso: ger 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: Reputationssysteme für zusammengesetzte Dienstleistungen type: bachelorsthesis user_id: '14052' year: '2014' ... --- _id: '17659' 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: Mathijs M. full_name: de Weerdt, Mathijs M. last_name: de Weerdt citation: ama: 'Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:861-868.' apa: 'Polevoy, G., Trajanovski, S., & de Weerdt, M. M. (2014). Nash Equilibria in Shared Effort Games. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 861–868). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.' bibtex: '@inproceedings{Polevoy_Trajanovski_de Weerdt_2014, place={Richland, SC}, series={AAMAS ’14}, title={Nash Equilibria in Shared Effort Games}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.}, year={2014}, pages={861–868}, collection={AAMAS ’14} }' chicago: 'Polevoy, Gleb, Stojan Trajanovski, and Mathijs M. de Weerdt. “Nash Equilibria in Shared Effort Games.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 861–68. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.' ieee: G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared Effort Games,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 861–868. mla: Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 861–68. short: 'G. Polevoy, S. Trajanovski, M.M. de Weerdt, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 861–868.' date_created: 2020-08-06T15:21:26Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - competition - equilibrium - market - models - shared effort games - simulation language: - iso: eng page: 861-868 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Nash Equilibria in Shared Effort Games type: conference user_id: '83983' year: '2014' ... --- _id: '17660' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs M. full_name: de Weerdt, Mathijs M. last_name: de Weerdt citation: ama: 'Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1741-1742.' apa: 'Polevoy, G., & de Weerdt, M. M. (2014). Improving Human Interaction in Crowdsensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1741–1742). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.' bibtex: '@inproceedings{Polevoy_de Weerdt_2014, place={Richland, SC}, series={AAMAS ’14}, title={Improving Human Interaction in Crowdsensing}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={Polevoy, Gleb and de Weerdt, Mathijs M.}, year={2014}, pages={1741–1742}, collection={AAMAS ’14} }' chicago: 'Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 1741–42. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.' ieee: G. Polevoy and M. M. de Weerdt, “Improving Human Interaction in Crowdsensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1741–1742. mla: Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1741–42. short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 1741–1742.' date_created: 2020-08-06T15:21:35Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - dynamics - emotion modeling - negotiation - network interaction - shared effort game language: - iso: eng page: 1741-1742 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Improving Human Interaction in Crowdsensing type: conference user_id: '83983' year: '2014' ... --- _id: '17661' author: - first_name: Thomas C. full_name: King, Thomas C. last_name: King - first_name: Qingzhi full_name: Liu, Qingzhi last_name: Liu - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Mathijs full_name: de Weerdt, Mathijs last_name: de Weerdt - first_name: Virginia full_name: Dignum, Virginia last_name: Dignum - first_name: M. Birna full_name: van Riemsdijk, M. Birna last_name: van Riemsdijk - first_name: Martijn full_name: Warnier, Martijn last_name: Warnier citation: ama: 'King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1651-1652.' apa: 'King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk, M. B., & Warnier, M. (2014). Request Driven Social Sensing. In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems (pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.' bibtex: '@inproceedings{King_Liu_Polevoy_de Weerdt_Dignum_van Riemsdijk_Warnier_2014, place={Richland, SC}, series={AAMAS ’14}, title={Request Driven Social Sensing}, booktitle={Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}, publisher={International Foundation for Autonomous Agents and Multiagent Systems}, author={King, Thomas C. and Liu, Qingzhi and Polevoy, Gleb and de Weerdt, Mathijs and Dignum, Virginia and van Riemsdijk, M. Birna and Warnier, Martijn}, year={2014}, pages={1651–1652}, collection={AAMAS ’14} }' chicago: 'King, Thomas C., Qingzhi Liu, Gleb Polevoy, Mathijs de Weerdt, Virginia Dignum, M. Birna van Riemsdijk, and Martijn Warnier. “Request Driven Social Sensing.” In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, 1651–52. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.' ieee: T. C. King et al., “Request Driven Social Sensing,” in Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, 2014, pp. 1651–1652. mla: King, Thomas C., et al. “Request Driven Social Sensing.” Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1651–52. short: 'T.C. King, Q. Liu, G. Polevoy, M. de Weerdt, V. Dignum, M.B. van Riemsdijk, M. Warnier, in: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 2014, pp. 1651–1652.' date_created: 2020-08-06T15:21:45Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' extern: '1' keyword: - crowd-sensing - crowdsourcing - data aggregation - game theory - norms - reciprocation - self interested agents - simulation language: - iso: eng page: 1651-1652 place: Richland, SC publication: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems publication_identifier: isbn: - 978-1-4503-2738-1 publisher: International Foundation for Autonomous Agents and Multiagent Systems series_title: AAMAS '14 status: public title: Request Driven Social Sensing type: conference user_id: '83983' year: '2014' ... --- _id: '17662' author: - first_name: Gleb full_name: Polevoy, Gleb id: '83983' last_name: Polevoy - first_name: Rann full_name: Smorodinsky, Rann last_name: Smorodinsky - first_name: Moshe full_name: Tennenholtz, Moshe last_name: Tennenholtz citation: ama: Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare. ACM Trans Econ Comput. 2014;2(1):1:1-1:16. doi:10.1145/2560766 apa: Polevoy, G., Smorodinsky, R., & Tennenholtz, M. (2014). Signaling Competition and Social Welfare. ACM Trans. Econ. Comput., 2(1), 1:1-1:16. https://doi.org/10.1145/2560766 bibtex: '@article{Polevoy_Smorodinsky_Tennenholtz_2014, title={Signaling Competition and Social Welfare}, volume={2}, DOI={10.1145/2560766}, number={1}, journal={ACM Trans. Econ. Comput.}, publisher={ACM}, author={Polevoy, Gleb and Smorodinsky, Rann and Tennenholtz, Moshe}, year={2014}, pages={1:1-1:16} }' chicago: 'Polevoy, Gleb, Rann Smorodinsky, and Moshe Tennenholtz. “Signaling Competition and Social Welfare.” ACM Trans. Econ. Comput. 2, no. 1 (2014): 1:1-1:16. https://doi.org/10.1145/2560766.' ieee: G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and Social Welfare,” ACM Trans. Econ. Comput., vol. 2, no. 1, pp. 1:1-1:16, 2014. mla: Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.” ACM Trans. Econ. Comput., vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:10.1145/2560766. short: G. Polevoy, R. Smorodinsky, M. Tennenholtz, ACM Trans. Econ. Comput. 2 (2014) 1:1-1:16. date_created: 2020-08-06T15:21:55Z date_updated: 2022-01-06T06:53:16Z department: - _id: '63' - _id: '541' doi: 10.1145/2560766 extern: '1' intvolume: ' 2' issue: '1' keyword: - Competition - efficiency - equilibrium - market - social welfare language: - iso: eng page: 1:1-1:16 publication: ACM Trans. Econ. Comput. publication_identifier: issn: - 2167-8375 publisher: ACM status: public title: Signaling Competition and Social Welfare type: journal_article user_id: '83983' volume: 2 year: '2014' ...