@inbook{45878, author = {{Haake, Claus-Jochen and Hehenkamp, Burkhard and Polevoy, Gleb}}, booktitle = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}}, editor = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}}, pages = {{21--44}}, publisher = {{Heinz Nixdorf Institut, Universität Paderborn}}, title = {{{The Market for Services: Incentives, Algorithms, Implementation}}}, doi = {{10.5281/zenodo.8068414}}, volume = {{412}}, year = {{2023}}, } @inproceedings{34040, abstract = {{Consider the practical goal of making a desired action profile played, when the planner can only change the payoffs, bound by stringent constraints. Applications include motivating people to choose the closest school, the closest subway station, or to coordinate on a communication protocol or an investment strategy. Employing subsidies and tolls, we adjust the game so that choosing this predefined action profile becomes strictly dominant. Inspired mainly by the work of Monderer and Tennenholtz, where the promised subsidies do not materialise in the not played profiles, we provide a fair and individually rational game adjustment, such that the total outside investments sum up to zero at any profile, thereby facilitating easy and frequent usage of our adjustment without bearing costs, even if some players behave unexpectedly. The resultant action profile itself needs no adjustment. Importantly, we also prove that our adjustment minimises the general transfer among all such adjustments, counting the total subsidising and taxation.}}, author = {{Polevoy, Gleb and Dziubiński, Marcin}}, booktitle = {{Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}}, editor = {{De Raedt, Luc}}, keywords = {{adjustment, strictly dominant, fairness, individually rational, transfer, tax, subsidy}}, location = {{Vienna}}, publisher = {{International Joint Conferences on Artificial Intelligence Organization}}, title = {{{Fair, Individually Rational and Cheap Adjustment}}}, doi = {{10.24963/ijcai.2022/64}}, year = {{2022}}, } @inproceedings{17667, abstract = {{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.}}, author = {{Koning, Ralph and Polevoy, Gleb and Meijer, Lydia and de Laat, Cees and Grosso, Paola}}, 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)}}, issn = {{null}}, keywords = {{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}}, pages = {{113--123}}, title = {{{Approaches for Collaborative Security Defences in Multi Network Environments}}}, doi = {{10.1109/CSCloud/EdgeCom.2019.000-9}}, year = {{2019}}, } @inproceedings{17651, abstract = {{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.}}, author = {{Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}}, booktitle = {{Combinatorial Optimization and Applications}}, editor = {{Kim, Donghyun and Uma, R. N. and Zelikovsky, Alexander}}, isbn = {{978-3-030-04651-4}}, keywords = {{flow, Red-Blue Set Cover, Positive-Negative Partial Set Cover, approximation, tree, MAX SNP-hard, root, leaf, dynamic programming, FPT}}, pages = {{217--232}}, publisher = {{Springer International Publishing}}, title = {{{Removing Undesirable Flows by Edge Deletion}}}, year = {{2018}}, } @article{17666, abstract = {{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.}}, author = {{Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}}, issn = {{0167-739X}}, journal = {{Future Generation Computer Systems}}, keywords = {{Software defined networks, Network function virtualization, Cyber attacks, Cyber security, Defense efficiency, Overlay networks}}, title = {{{Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}}}, doi = {{https://doi.org/10.1016/j.future.2018.08.011}}, year = {{2018}}, } @inproceedings{17652, author = {{Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}}, booktitle = {{Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}}, isbn = {{978-3-319-71150-8}}, keywords = {{flow, filter, MMSA, set cover, approximation, local ratio algorithm}}, pages = {{3--17}}, publisher = {{Springer International Publishing}}, title = {{{Filtering Undesirable Flows in Networks}}}, doi = {{10.1007/978-3-319-71150-8_1}}, year = {{2017}}, } @inproceedings{17653, author = {{Polevoy, Gleb and de Weerdt, M.M.}}, booktitle = {{Proceedings of the 29th Benelux Conference on Artificial Intelligence}}, keywords = {{interaction, reciprocation, contribute, shared effort, curbing, convergence, threshold, Nash equilibrium, social welfare, efficiency, price of anarchy, price of stability}}, publisher = {{Springer}}, title = {{{Reciprocation Effort Games}}}, year = {{2017}}, } @inproceedings{17654, author = {{Polevoy, Gleb and de Weerdt, M.M.}}, booktitle = {{Proceedings of the 29th Benelux Conference on Artificial Intelligence}}, keywords = {{agents, projects, contribute, shared effort game, competition, quota, threshold, Nash equilibrium, social welfare, efficiency, price of anarchy, price of stability}}, publisher = {{Springer}}, title = {{{Competition between Cooperative Projects}}}, year = {{2017}}, } @inproceedings{17655, author = {{Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}}, booktitle = {{Proceedings of the 2016 European Conference on Artificial Intelligence}}, keywords = {{agents, action, repeated reciprocation, fixed, floating, network, Nash equilibrium, social welfare, price of anarchy, price of stability, convex combination}}, pages = {{417--425}}, title = {{{The Game of Reciprocation Habits}}}, doi = {{10.3233/978-1-61499-672-9-417}}, volume = {{Volume 285: ECAI 2016}}, year = {{2016}}, } @inproceedings{17656, author = {{Polevoy, Gleb and de Weerdt, Mathijs and Jonker, Catholijn}}, booktitle = {{Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems}}, isbn = {{978-1-4503-4239-1}}, keywords = {{agent's influence, behavior, convergence, perron-frobenius, reciprocal interaction, repeated reciprocation}}, pages = {{1431--1432}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{The Convergence of Reciprocation}}}, year = {{2016}}, } @article{17657, abstract = {{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 = {{Cohen, R. and Polevoy, Gleb}}, issn = {{2168-7161}}, journal = {{Cloud Computing, IEEE Transactions on}}, keywords = {{Approximation algorithms, Approximation methods, Bandwidth, Cloud computing, Routing, Schedules, Scheduling}}, number = {{99}}, pages = {{1--1}}, title = {{{Inter-Datacenter Scheduling of Large Data Flows}}}, doi = {{10.1109/TCC.2015.2487964}}, volume = {{PP}}, year = {{2015}}, } @article{17658, abstract = {{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 = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, issn = {{0166-218X}}, journal = {{Discrete Applied Mathematics }}, keywords = {{Local ratio}}, pages = {{23 -- 36}}, publisher = {{Elsevier}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, doi = {{http://dx.doi.org/10.1016/j.dam.2015.05.013}}, volume = {{194}}, year = {{2015}}, } @inproceedings{17659, author = {{Polevoy, Gleb and Trajanovski, Stojan and de Weerdt, Mathijs M.}}, booktitle = {{Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}}, isbn = {{978-1-4503-2738-1}}, keywords = {{competition, equilibrium, market, models, shared effort games, simulation}}, pages = {{861--868}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{Nash Equilibria in Shared Effort Games}}}, year = {{2014}}, } @inproceedings{17660, author = {{Polevoy, Gleb and de Weerdt, Mathijs M.}}, booktitle = {{Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}}, isbn = {{978-1-4503-2738-1}}, keywords = {{dynamics, emotion modeling, negotiation, network interaction, shared effort game}}, pages = {{1741--1742}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{Improving Human Interaction in Crowdsensing}}}, year = {{2014}}, } @inproceedings{17661, 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}}, booktitle = {{Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems}}, isbn = {{978-1-4503-2738-1}}, keywords = {{crowd-sensing, crowdsourcing, data aggregation, game theory, norms, reciprocation, self interested agents, simulation}}, pages = {{1651--1652}}, publisher = {{International Foundation for Autonomous Agents and Multiagent Systems}}, title = {{{Request Driven Social Sensing}}}, year = {{2014}}, } @article{17662, author = {{Polevoy, Gleb and Smorodinsky, Rann and Tennenholtz, Moshe}}, issn = {{2167-8375}}, journal = {{ACM Trans. Econ. Comput.}}, keywords = {{Competition, efficiency, equilibrium, market, social welfare}}, number = {{1}}, pages = {{1:1--1:16}}, publisher = {{ACM}}, title = {{{Signaling Competition and Social Welfare}}}, doi = {{10.1145/2560766}}, volume = {{2}}, year = {{2014}}, } @article{17663, abstract = {{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.}}, author = {{Cohen, R. and Nudelman, I. and Polevoy, Gleb}}, issn = {{1063-6692}}, journal = {{Networking, IEEE/ACM Transactions on}}, keywords = {{Approximation algorithms, Approximation methods, Bandwidth, Logic gates, Radar, Vectors, Wireless sensor networks, Dependent flow scheduling, sensor networks}}, number = {{5}}, pages = {{1461--1471}}, title = {{{On the Admission of Dependent Flows in Powerful Sensor Networks}}}, doi = {{10.1109/TNET.2012.2227792}}, volume = {{21}}, year = {{2013}}, } @inproceedings{17664, author = {{Cohen, Reuven and Nudelman, Ilia and Polevoy, Gleb}}, booktitle = {{Infocom'2012, Orlando, Florida}}, title = {{{On the Admission of Dependent Flows in Powerful Sensor Networks}}}, year = {{2012}}, } @inproceedings{17665, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, booktitle = {{DIALM-PODC}}, pages = {{33--42}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, year = {{2010}}, }