[{"ddc":["004"],"language":[{"iso":"eng"}],"file":[{"file_size":1116173,"access_level":"open_access","file_id":"45879","file_name":"A3-Chapter-SFB-Buch-Final.pdf","date_updated":"2023-07-07T11:23:07Z","date_created":"2023-07-07T06:59:23Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"The Market for Services: Incentives, Algorithms, Implementation","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T07:02:44Z","year":"2023","file_date_updated":"2023-07-07T11:23:07Z","_id":"45878","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","grant_number":"160364472"}],"department":[{"_id":"7"},{"_id":"19"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"status":"public","type":"book_chapter","doi":"10.5281/zenodo.8068414","date_updated":"2023-07-07T11:23:08Z","oa":"1","volume":412,"author":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"},{"last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb","first_name":"Gleb"}],"place":"Paderborn","page":"21-44","intvolume":"       412","citation":{"ama":"Haake C-J, Hehenkamp B, Polevoy G. The Market for Services: Incentives, Algorithms, Implementation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:21-44. doi:<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>","ieee":"C.-J. Haake, B. Hehenkamp, and G. Polevoy, “The Market for Services: Incentives, Algorithms, Implementation,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 21–44.","chicago":"Haake, Claus-Jochen, Burkhard Hehenkamp, and Gleb Polevoy. “The Market for Services: Incentives, Algorithms, Implementation.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:21–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068414\">https://doi.org/10.5281/zenodo.8068414</a>.","apa":"Haake, C.-J., Hehenkamp, B., &#38; Polevoy, G. (2023). The Market for Services: Incentives, Algorithms, Implementation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 21–44). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068414\">https://doi.org/10.5281/zenodo.8068414</a>","short":"C.-J. Haake, B. Hehenkamp, G. Polevoy, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 21–44.","bibtex":"@inbook{Haake_Hehenkamp_Polevoy_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={The Market for Services: Incentives, Algorithms, Implementation}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Hehenkamp, Burkhard and Polevoy, Gleb}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={21–44}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Haake, Claus-Jochen, et al. “The Market for Services: Incentives, Algorithms, Implementation.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 21–44, doi:<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>."},"has_accepted_license":"1"},{"publisher":"International Joint Conferences on Artificial Intelligence Organization","date_updated":"2022-11-08T17:34:36Z","author":[{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"last_name":"Dziubiński","full_name":"Dziubiński, Marcin","first_name":"Marcin"}],"date_created":"2022-11-08T16:53:31Z","title":"Fair, Individually Rational and Cheap Adjustment","conference":{"end_date":"2022-07-29","location":"Vienna","name":"THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE","start_date":"2022-07-23"},"doi":"10.24963/ijcai.2022/64","main_file_link":[{"url":"https://www.ijcai.org/proceedings/2022/64"}],"publication_status":"published","year":"2022","citation":{"bibtex":"@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational and Cheap Adjustment}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>}, booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt, Luc}, year={2022} }","mla":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","short":"G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022.","apa":"Polevoy, G., &#38; Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>","ama":"Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>","chicago":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” In <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>.","ieee":"G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,” in <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, Vienna, 2022, doi: <a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>."},"_id":"34040","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","keyword":["adjustment","strictly dominant","fairness","individually rational","transfer","tax","subsidy"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","type":"conference","editor":[{"first_name":"Luc","last_name":"De Raedt","full_name":"De Raedt, Luc"}],"abstract":[{"text":"<jats:p>Consider the practical goal of making a desired action profile played,\r\n\r\nwhen the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications include motivating people\r\n\r\nto choose the closest school, the closest subway station, or to coordinate\r\n\r\non a communication protocol or an investment strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly. The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we also prove that our adjustment minimises \r\n\r\nthe general transfer among all such adjustments, counting the total subsidising and taxation.</jats:p>","lang":"eng"}],"status":"public"},{"author":[{"full_name":"Koning, Ralph","last_name":"Koning","first_name":"Ralph"},{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"},{"first_name":"Lydia","full_name":"Meijer, Lydia","last_name":"Meijer"},{"first_name":"Cees","last_name":"de Laat","full_name":"de Laat, Cees"},{"first_name":"Paola","last_name":"Grosso","full_name":"Grosso, Paola"}],"date_updated":"2022-01-06T06:53:16Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors"}],"conference":{"name":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)"},"doi":"10.1109/CSCloud/EdgeCom.2019.000-9","publication_identifier":{"issn":["null"]},"citation":{"short":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–123.","bibtex":"@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, title={Approaches for Collaborative Security Defences in Multi Network Environments}, DOI={<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>}, booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)} }","mla":"Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.” <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 2019, pp. 113–23, doi:<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>.","apa":"Koning, R., Polevoy, G., Meijer, L., de Laat, C., &#38; Grosso, P. (2019). Approaches for Collaborative Security Defences in Multi Network Environments. In <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i> (pp. 113–123). <a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9</a>","chicago":"Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso. “Approaches for Collaborative Security Defences in Multi Network Environments.” In <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 113–23. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019. <a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9</a>.","ieee":"R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for Collaborative Security Defences in Multi Network Environments,” in <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>, 2019, pp. 113–123.","ama":"Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative Security Defences in Multi Network Environments. In: <i>2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)</i>. 2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:<a href=\"https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9\">10.1109/CSCloud/EdgeCom.2019.000-9</a>"},"page":"113-123","series_title":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17667","extern":"1","type":"conference","status":"public","date_created":"2020-08-06T15:23:23Z","title":"Approaches for Collaborative Security Defences in Multi Network Environments","quality_controlled":"1","year":"2019","language":[{"iso":"eng"}],"keyword":["computer network security","multinetwork environments","multidomain defensive action","task execution order","timing influence defense efficiency","distributed attacks","collaborative security defence approach","minimize propagation approach","minimize countermeasure approach","counteract everywhere approach","Conferences","Cloud computing","Computer crime","Edge computing","Security","Defense Approaches","Multi-Domain Defense","Collaborative Defense","Defense Algorithms","Computer Networks"],"publication":"2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)","abstract":[{"lang":"eng","text":"Resolving distributed attacks benefits from collaboration between networks. We present three approaches for the same multi-domain defensive action that can be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures, and 3) Minimize Propagation. First, we provide a formula to compute efficiency of a defense; then we use this formula to compute the efficiency of the approaches under various circumstances. Finally, we discuss how task execution order and timing influence defense efficiency. Our results show that the Minimize Propagation approach is the most efficient method when defending against the chosen attack."}]},{"type":"conference","publication":"Combinatorial Optimization and Applications","abstract":[{"text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.","lang":"eng"}],"editor":[{"last_name":"Kim","full_name":"Kim, Donghyun","first_name":"Donghyun"},{"full_name":"Uma, R. N.","last_name":"Uma","first_name":"R. N."},{"first_name":"Alexander","last_name":"Zelikovsky","full_name":"Zelikovsky, Alexander"}],"status":"public","_id":"17651","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"isbn":["978-3-030-04651-4"]},"year":"2018","place":"Cham","citation":{"ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. <i>Combinatorial Optimization and Applications</i>. Cham: Springer International Publishing; 2018:217-232.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in <i>Combinatorial Optimization and Applications</i>, 2018, pp. 217–232.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232.","mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &#38; A. Zelikovsky (Eds.), <i>Combinatorial Optimization and Applications</i> (pp. 217–232). Cham: Springer International Publishing."},"page":"217-232","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","author":[{"last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"full_name":"Trajanovski, Stojan","last_name":"Trajanovski","first_name":"Stojan"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"last_name":"de Laat","full_name":"de Laat, Cees","first_name":"Cees"}],"date_created":"2020-08-06T15:19:36Z","title":"Removing Undesirable Flows by Edge Deletion"},{"publication_identifier":{"issn":["0167-739X"]},"year":"2018","citation":{"ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” <i>Future Generation Computer Systems</i>, 2018.","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }","short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).","mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018, doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &#38; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>"},"date_updated":"2022-01-06T06:53:16Z","date_created":"2020-08-06T15:23:11Z","author":[{"full_name":"Koning, R.","last_name":"Koning","first_name":"R."},{"first_name":"B.","full_name":"de Graaff, B.","last_name":"de Graaff"},{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"Meijer","full_name":"Meijer, R.","first_name":"R."},{"first_name":"C.","last_name":"de Laat","full_name":"de Laat, C."},{"last_name":"Grosso","full_name":"Grosso, P.","first_name":"P."}],"title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","doi":"https://doi.org/10.1016/j.future.2018.08.011","type":"journal_article","publication":"Future Generation Computer Systems","abstract":[{"lang":"eng","text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions."}],"status":"public","_id":"17666","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"extern":"1","language":[{"iso":"eng"}]},{"_id":"17652","department":[{"_id":"63"},{"_id":"541"}],"series_title":"Lecture Notes in Computer Science","user_id":"83983","keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"extern":"1","language":[{"iso":"eng"}],"publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","type":"conference","status":"public","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","date_created":"2020-08-06T15:19:48Z","author":[{"first_name":"Gleb","id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy"},{"last_name":"Trajanovski","full_name":"Trajanovski, Stojan","first_name":"Stojan"},{"first_name":"Paola","last_name":"Grosso","full_name":"Grosso, Paola"},{"full_name":"de Laat, Cees","last_name":"de Laat","first_name":"Cees"}],"title":"Filtering Undesirable Flows in Networks","doi":"10.1007/978-3-319-71150-8_1","publication_identifier":{"isbn":["978-3-319-71150-8"]},"year":"2017","place":"Cham","page":"3-17","citation":{"chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 2017, pp. 3–17.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>}, 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} }","mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>.","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.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>"}},{"title":"Reciprocation Effort Games","author":[{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"first_name":"M.M.","full_name":"de Weerdt, M.M.","last_name":"de Weerdt"}],"date_created":"2020-08-06T15:20:09Z","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer","citation":{"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} }","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Reciprocation Effort Games. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","ama":"Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017."},"year":"2017","extern":"1","language":[{"iso":"eng"}],"keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"department":[{"_id":"63"},{"_id":"541"}],"series_title":"CCIS","user_id":"83983","_id":"17653","status":"public","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","type":"conference"},{"keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"language":[{"iso":"eng"}],"extern":"1","_id":"17654","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"CCIS","status":"public","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","type":"conference","title":"Competition between Cooperative Projects","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer","date_created":"2020-08-06T15:20:19Z","author":[{"full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"M.M.","full_name":"de Weerdt, M.M.","last_name":"de Weerdt"}],"year":"2017","citation":{"mla":"Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","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} }","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","ama":"Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","ieee":"G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017."}},{"extern":"1","language":[{"iso":"eng"}],"keyword":["agents","action","repeated reciprocation","fixed","floating","network","Nash equilibrium","social welfare","price of anarchy","price of stability","convex combination"],"series_title":"Frontiers in Artificial Intelligence and Applications","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17655","status":"public","type":"conference","publication":"Proceedings of the 2016 European Conference on Artificial Intelligence","doi":"10.3233/978-1-61499-672-9-417","title":"The Game of Reciprocation Habits","author":[{"last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"de Weerdt","full_name":"de Weerdt, M.M.","first_name":"M.M."},{"full_name":"Jonker, C.M.","last_name":"Jonker","first_name":"C.M."}],"date_created":"2020-08-06T15:20:30Z","volume":"Volume 285: ECAI 2016","date_updated":"2022-01-06T06:53:16Z","citation":{"ieee":"G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation Habits,” in <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, 2016, vol. Volume 285: ECAI 2016, pp. 417–425.","chicago":"Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation Habits.” In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>.","ama":"Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In: <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>. Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications. ; 2016:417-425. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>","mla":"Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i>, vol. Volume 285: ECAI 2016, 2016, pp. 417–25, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>.","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={<a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">10.3233/978-1-61499-672-9-417</a>}, 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} }","short":"G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European Conference on Artificial Intelligence, 2016, pp. 417–425.","apa":"Polevoy, G., de Weerdt, M. M., &#38; Jonker, C. M. (2016). The Game of Reciprocation Habits. In <i>Proceedings of the 2016 European Conference on Artificial Intelligence</i> (Vol. Volume 285: ECAI 2016, pp. 417–425). <a href=\"https://doi.org/10.3233/978-1-61499-672-9-417\">https://doi.org/10.3233/978-1-61499-672-9-417</a>"},"page":"417-425","year":"2016"},{"date_updated":"2022-01-06T06:53:16Z","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","author":[{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"Mathijs","last_name":"de Weerdt","full_name":"de Weerdt, Mathijs"},{"full_name":"Jonker, Catholijn","last_name":"Jonker","first_name":"Catholijn"}],"date_created":"2020-08-06T15:20:45Z","title":"The Convergence of Reciprocation","publication_identifier":{"isbn":["978-1-4503-4239-1"]},"year":"2016","place":"Richland, SC","page":"1431-1432","citation":{"apa":"Polevoy, G., de Weerdt, M., &#38; Jonker, C. (2016). The Convergence of Reciprocation. In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i> (pp. 1431–1432). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","mla":"Polevoy, Gleb, et al. “The Convergence of Reciprocation.” <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp. 1431–32.","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.","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} }","chicago":"Polevoy, Gleb, Mathijs de Weerdt, and Catholijn Jonker. “The Convergence of Reciprocation.” In <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 1431–32. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2016.","ieee":"G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,” in <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>, 2016, pp. 1431–1432.","ama":"Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: <i>Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems</i>. AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2016:1431-1432."},"_id":"17656","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"AAMAS '16","keyword":["agent's influence","behavior","convergence","perron-frobenius","reciprocal interaction","repeated reciprocation"],"language":[{"iso":"eng"}],"extern":"1","publication":"Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems","type":"conference","status":"public"},{"doi":"10.1109/TCC.2015.2487964","title":"Inter-Datacenter Scheduling of Large Data Flows","date_created":"2020-08-06T15:20:58Z","author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"}],"volume":"PP","date_updated":"2022-01-06T06:53:16Z","citation":{"ama":"Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions on</i>. 2015;PP(99):1-1. doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>","chicago":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i> PP, no. 99 (2015): 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>.","ieee":"R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,” <i>Cloud Computing, IEEE Transactions on</i>, vol. PP, no. 99, pp. 1–1, 2015.","mla":"Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.” <i>Cloud Computing, IEEE Transactions On</i>, vol. PP, no. 99, 2015, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>.","bibtex":"@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large Data Flows}, volume={PP}, DOI={<a href=\"https://doi.org/10.1109/TCC.2015.2487964\">10.1109/TCC.2015.2487964</a>}, number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R. and Polevoy, Gleb}, year={2015}, pages={1–1} }","short":"R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.","apa":"Cohen, R., &#38; Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data Flows. <i>Cloud Computing, IEEE Transactions On</i>, <i>PP</i>(99), 1–1. <a href=\"https://doi.org/10.1109/TCC.2015.2487964\">https://doi.org/10.1109/TCC.2015.2487964</a>"},"page":"1-1","year":"2015","issue":"99","publication_identifier":{"issn":["2168-7161"]},"extern":"1","language":[{"iso":"eng"}],"keyword":["Approximation algorithms","Approximation methods","Bandwidth","Cloud computing","Routing","Schedules","Scheduling"],"user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17657","status":"public","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."}],"type":"journal_article","publication":"Cloud Computing, IEEE Transactions on"},{"publication_identifier":{"issn":["0166-218X"]},"year":"2015","citation":{"bibtex":"@article{Bar-Yehuda_Polevoy_Rawitz_2015, title={Bandwidth allocation in cellular networks with multiple interferences}, volume={194}, DOI={<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>}, journal={Discrete Applied Mathematics }, publisher={Elsevier}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2015}, pages={23–36} }","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, Discrete Applied Mathematics  194 (2015) 23–36.","mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>Discrete Applied Mathematics </i>, vol. 194, Elsevier, 2015, pp. 23–36, doi:<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>.","apa":"Bar-Yehuda, R., Polevoy, G., &#38; Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. <i>Discrete Applied Mathematics </i>, <i>194</i>, 23–36. <a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. <i>Discrete Applied Mathematics </i>. 2015;194:23-36. doi:<a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>","ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” <i>Discrete Applied Mathematics </i>, vol. 194, pp. 23–36, 2015.","chicago":"Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>Discrete Applied Mathematics </i> 194 (2015): 23–36. <a href=\"http://dx.doi.org/10.1016/j.dam.2015.05.013\">http://dx.doi.org/10.1016/j.dam.2015.05.013</a>."},"page":"23 - 36","intvolume":"       194","date_updated":"2022-01-06T06:53:16Z","publisher":"Elsevier","date_created":"2020-08-06T15:21:15Z","author":[{"full_name":"Bar-Yehuda, Reuven","last_name":"Bar-Yehuda","first_name":"Reuven"},{"id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"Rawitz","full_name":"Rawitz, Dror","first_name":"Dror"}],"volume":194,"title":"Bandwidth allocation in cellular networks with multiple interferences","doi":"http://dx.doi.org/10.1016/j.dam.2015.05.013","type":"journal_article","publication":"Discrete Applied Mathematics ","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. "}],"status":"public","_id":"17658","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"keyword":["Local ratio"],"language":[{"iso":"eng"}],"extern":"1"},{"status":"public","publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","type":"conference","language":[{"iso":"eng"}],"extern":"1","keyword":["competition","equilibrium","market","models","shared effort games","simulation"],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"AAMAS '14","_id":"17659","page":"861-868","citation":{"ama":"Polevoy G, Trajanovski S, de Weerdt MM. Nash Equilibria in Shared Effort Games. In: <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:861-868.","ieee":"G. Polevoy, S. Trajanovski, and M. M. de Weerdt, “Nash Equilibria in Shared Effort Games,” in <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i>, 2014, pp. 861–868.","chicago":"Polevoy, Gleb, Stojan Trajanovski, and Mathijs M. de Weerdt. “Nash Equilibria in Shared Effort Games.” In <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, 861–68. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.","apa":"Polevoy, G., Trajanovski, S., &#38; de Weerdt, M. M. (2014). Nash Equilibria in Shared Effort Games. In <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i> (pp. 861–868). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","mla":"Polevoy, Gleb, et al. “Nash Equilibria in Shared Effort Games.” <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, 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.","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} }"},"place":"Richland, SC","year":"2014","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"title":"Nash Equilibria in Shared Effort Games","author":[{"last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"last_name":"Trajanovski","full_name":"Trajanovski, Stojan","first_name":"Stojan"},{"first_name":"Mathijs M.","last_name":"de Weerdt","full_name":"de Weerdt, Mathijs M."}],"date_created":"2020-08-06T15:21:26Z","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","date_updated":"2022-01-06T06:53:16Z"},{"department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","series_title":"AAMAS '14","_id":"17660","extern":"1","language":[{"iso":"eng"}],"keyword":["dynamics","emotion modeling","negotiation","network interaction","shared effort game"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","type":"conference","status":"public","date_created":"2020-08-06T15:21:35Z","author":[{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"},{"first_name":"Mathijs M.","last_name":"de Weerdt","full_name":"de Weerdt, Mathijs M."}],"publisher":"International Foundation for Autonomous Agents and Multiagent Systems","date_updated":"2022-01-06T06:53:16Z","title":"Improving Human Interaction in Crowdsensing","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"page":"1741-1742","citation":{"apa":"Polevoy, G., &#38; de Weerdt, M. M. (2014). Improving Human Interaction in Crowdsensing. In <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i> (pp. 1741–1742). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","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.","mla":"Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, International Foundation for Autonomous Agents and Multiagent Systems, 2014, pp. 1741–42.","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} }","ama":"Polevoy G, de Weerdt MM. Improving Human Interaction in Crowdsensing. In: <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1741-1742.","chicago":"Polevoy, Gleb, and Mathijs M. de Weerdt. “Improving Human Interaction in Crowdsensing.” In <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, 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 <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i>, 2014, pp. 1741–1742."},"year":"2014","place":"Richland, SC"},{"author":[{"full_name":"King, Thomas C.","last_name":"King","first_name":"Thomas C."},{"first_name":"Qingzhi","last_name":"Liu","full_name":"Liu, Qingzhi"},{"first_name":"Gleb","last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb"},{"last_name":"de Weerdt","full_name":"de Weerdt, Mathijs","first_name":"Mathijs"},{"full_name":"Dignum, Virginia","last_name":"Dignum","first_name":"Virginia"},{"last_name":"van Riemsdijk","full_name":"van Riemsdijk, M. Birna","first_name":"M. Birna"},{"first_name":"Martijn","full_name":"Warnier, Martijn","last_name":"Warnier"}],"date_created":"2020-08-06T15:21:45Z","date_updated":"2022-01-06T06:53:16Z","publisher":"International Foundation for Autonomous Agents and Multiagent Systems","title":"Request Driven Social Sensing","publication_identifier":{"isbn":["978-1-4503-2738-1"]},"page":"1651-1652","citation":{"mla":"King, Thomas C., et al. “Request Driven Social Sensing.” <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, 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.","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} }","apa":"King, T. C., Liu, Q., Polevoy, G., de Weerdt, M., Dignum, V., van Riemsdijk, M. B., &#38; Warnier, M. (2014). Request Driven Social Sensing. In <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i> (pp. 1651–1652). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","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 <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>, 1651–52. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, 2014.","ieee":"T. C. King <i>et al.</i>, “Request Driven Social Sensing,” in <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems</i>, 2014, pp. 1651–1652.","ama":"King TC, Liu Q, Polevoy G, et al. Request Driven Social Sensing. In: <i>Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems</i>. AAMAS ’14. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems; 2014:1651-1652."},"place":"Richland, SC","year":"2014","department":[{"_id":"63"},{"_id":"541"}],"series_title":"AAMAS '14","user_id":"83983","_id":"17661","extern":"1","language":[{"iso":"eng"}],"keyword":["crowd-sensing","crowdsourcing","data aggregation","game theory","norms","reciprocation","self interested agents","simulation"],"publication":"Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems","type":"conference","status":"public"},{"status":"public","type":"journal_article","extern":"1","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","_id":"17662","intvolume":"         2","page":"1:1-1:16","citation":{"bibtex":"@article{Polevoy_Smorodinsky_Tennenholtz_2014, title={Signaling Competition and Social Welfare}, volume={2}, DOI={<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>}, 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} }","mla":"Polevoy, Gleb, et al. “Signaling Competition and Social Welfare.” <i>ACM Trans. Econ. Comput.</i>, vol. 2, no. 1, ACM, 2014, pp. 1:1-1:16, doi:<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>.","short":"G. Polevoy, R. Smorodinsky, M. Tennenholtz, ACM Trans. Econ. Comput. 2 (2014) 1:1-1:16.","apa":"Polevoy, G., Smorodinsky, R., &#38; Tennenholtz, M. (2014). Signaling Competition and Social Welfare. <i>ACM Trans. Econ. Comput.</i>, <i>2</i>(1), 1:1-1:16. <a href=\"https://doi.org/10.1145/2560766\">https://doi.org/10.1145/2560766</a>","ama":"Polevoy G, Smorodinsky R, Tennenholtz M. Signaling Competition and Social Welfare. <i>ACM Trans Econ Comput</i>. 2014;2(1):1:1-1:16. doi:<a href=\"https://doi.org/10.1145/2560766\">10.1145/2560766</a>","ieee":"G. Polevoy, R. Smorodinsky, and M. Tennenholtz, “Signaling Competition and Social Welfare,” <i>ACM Trans. Econ. Comput.</i>, vol. 2, no. 1, pp. 1:1-1:16, 2014.","chicago":"Polevoy, Gleb, Rann Smorodinsky, and Moshe Tennenholtz. “Signaling Competition and Social Welfare.” <i>ACM Trans. Econ. Comput.</i> 2, no. 1 (2014): 1:1-1:16. <a href=\"https://doi.org/10.1145/2560766\">https://doi.org/10.1145/2560766</a>."},"publication_identifier":{"issn":["2167-8375"]},"doi":"10.1145/2560766","volume":2,"author":[{"first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy"},{"last_name":"Smorodinsky","full_name":"Smorodinsky, Rann","first_name":"Rann"},{"full_name":"Tennenholtz, Moshe","last_name":"Tennenholtz","first_name":"Moshe"}],"date_updated":"2022-01-06T06:53:16Z","publication":"ACM Trans. Econ. Comput.","language":[{"iso":"eng"}],"keyword":["Competition","efficiency","equilibrium","market","social welfare"],"year":"2014","issue":"1","title":"Signaling Competition and Social Welfare","date_created":"2020-08-06T15:21:55Z","publisher":"ACM"},{"extern":"1","language":[{"iso":"eng"}],"keyword":["Approximation algorithms","Approximation methods","Bandwidth","Logic gates","Radar","Vectors","Wireless sensor networks","Dependent flow scheduling","sensor networks"],"user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17663","status":"public","abstract":[{"text":"In this paper, we define and study a new problem, referred to as the Dependent Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the context of large-scale powerful (radar/camera) sensor networks, but we believe it has important applications on the admission of large flows in other networks as well. In order to optimize the selection of flows transmitted to the gateway, D-UFP takes into account possible dependencies between flows. We show that D-UFP is more difficult than NP-hard problems for which no good approximation is known. Then, we address two special cases of this problem: the case where all the sensors have a shared channel and the case where the sensors form a mesh and route to the gateway over a spanning tree.","lang":"eng"}],"type":"journal_article","publication":"Networking, IEEE/ACM Transactions on","doi":"10.1109/TNET.2012.2227792","title":"On the Admission of Dependent Flows in Powerful Sensor Networks","date_created":"2020-08-06T15:22:05Z","author":[{"first_name":"R.","last_name":"Cohen","full_name":"Cohen, R."},{"first_name":"I.","full_name":"Nudelman, I.","last_name":"Nudelman"},{"full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy","first_name":"Gleb"}],"volume":21,"date_updated":"2022-01-06T06:53:16Z","citation":{"apa":"Cohen, R., Nudelman, I., &#38; Polevoy, G. (2013). On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions On</i>, <i>21</i>(5), 1461–1471. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>","bibtex":"@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent Flows in Powerful Sensor Networks}, volume={21}, DOI={<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>}, number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R. and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }","mla":"Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i>, vol. 21, no. 5, 2013, pp. 1461–71, doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>.","short":"R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21 (2013) 1461–1471.","chicago":"Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Networking, IEEE/ACM Transactions On</i> 21, no. 5 (2013): 1461–71. <a href=\"https://doi.org/10.1109/TNET.2012.2227792\">https://doi.org/10.1109/TNET.2012.2227792</a>.","ieee":"R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” <i>Networking, IEEE/ACM Transactions on</i>, vol. 21, no. 5, pp. 1461–1471, 2013.","ama":"Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. <i>Networking, IEEE/ACM Transactions on</i>. 2013;21(5):1461-1471. doi:<a href=\"https://doi.org/10.1109/TNET.2012.2227792\">10.1109/TNET.2012.2227792</a>"},"intvolume":"        21","page":"1461-1471","year":"2013","issue":"5","publication_identifier":{"issn":["1063-6692"]}},{"title":"On the Admission of Dependent Flows in Powerful Sensor Networks","date_created":"2020-08-06T15:22:24Z","author":[{"first_name":"Reuven","full_name":"Cohen, Reuven","last_name":"Cohen"},{"full_name":"Nudelman, Ilia","last_name":"Nudelman","first_name":"Ilia"},{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"}],"date_updated":"2022-01-06T06:53:16Z","citation":{"short":"R. Cohen, I. Nudelman, G. Polevoy, in: Infocom’2012, Orlando, Florida, 2012.","bibtex":"@inproceedings{Cohen_Nudelman_Polevoy_2012, title={On the Admission of Dependent Flows in Powerful Sensor Networks}, booktitle={Infocom’2012, Orlando, Florida}, author={Cohen, Reuven and Nudelman, Ilia and Polevoy, Gleb}, year={2012} }","mla":"Cohen, Reuven, et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.” <i>Infocom’2012, Orlando, Florida</i>, 2012.","apa":"Cohen, R., Nudelman, I., &#38; Polevoy, G. (2012). On the Admission of Dependent Flows in Powerful Sensor Networks. In <i>Infocom’2012, Orlando, Florida</i>.","ama":"Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful Sensor Networks. In: <i>Infocom’2012, Orlando, Florida</i>. ; 2012.","chicago":"Cohen, Reuven, Ilia Nudelman, and Gleb Polevoy. “On the Admission of Dependent Flows in Powerful Sensor Networks.” In <i>Infocom’2012, Orlando, Florida</i>, 2012.","ieee":"R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows in Powerful Sensor Networks,” in <i>Infocom’2012, Orlando, Florida</i>, 2012."},"year":"2012","language":[{"iso":"eng"}],"extern":"1","department":[{"_id":"63"},{"_id":"541"}],"user_id":"83983","_id":"17664","status":"public","publication":"Infocom'2012, Orlando, Florida","type":"conference"},{"year":"2010","citation":{"ieee":"R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular networks with multiple interferences,” in <i>DIALM-PODC</i>, 2010, pp. 33–42.","chicago":"Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” In <i>DIALM-PODC</i>, 33–42, 2010.","ama":"Bar-Yehuda R, Polevoy G, Rawitz D. Bandwidth allocation in cellular networks with multiple interferences. In: <i>DIALM-PODC</i>. ; 2010:33-42.","mla":"Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.” <i>DIALM-PODC</i>, 2010, pp. 33–42.","short":"R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.","bibtex":"@inproceedings{Bar-Yehuda_Polevoy_Rawitz_2010, title={Bandwidth allocation in cellular networks with multiple interferences}, booktitle={DIALM-PODC}, author={Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}, year={2010}, pages={33–42} }","apa":"Bar-Yehuda, R., Polevoy, G., &#38; Rawitz, D. (2010). Bandwidth allocation in cellular networks with multiple interferences. In <i>DIALM-PODC</i> (pp. 33–42)."},"page":"33-42","date_updated":"2022-01-06T06:53:16Z","author":[{"first_name":"Reuven","full_name":"Bar-Yehuda, Reuven","last_name":"Bar-Yehuda"},{"last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983","first_name":"Gleb"},{"first_name":"Dror","last_name":"Rawitz","full_name":"Rawitz, Dror"}],"date_created":"2020-08-06T15:22:47Z","title":"Bandwidth allocation in cellular networks with multiple interferences","type":"conference","publication":"DIALM-PODC","status":"public","_id":"17665","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"language":[{"iso":"eng"}],"extern":"1"}]