---
_id: '45878'
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
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. On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz
Nixdorf Institut, Universität Paderborn; 2023:21-44. doi:10.5281/zenodo.8068414'
apa: 'Haake, C.-J., Hehenkamp, B., & Polevoy, G. (2023). The Market for Services:
Incentives, Algorithms, Implementation. 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 (Vol. 412, pp. 21–44). Heinz
Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068414'
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={10.5281/zenodo.8068414},
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} }'
chicago: 'Haake, Claus-Jochen, Burkhard Hehenkamp, and Gleb Polevoy. “The Market
for Services: Incentives, Algorithms, Implementation.” In On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets, 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. https://doi.org/10.5281/zenodo.8068414.'
ieee: 'C.-J. Haake, B. Hehenkamp, and G. Polevoy, “The Market for Services: Incentives,
Algorithms, Implementation,” in On-The-Fly Computing -- Individualized IT-services
in dynamic markets, 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.'
mla: 'Haake, Claus-Jochen, et al. “The Market for Services: Incentives, Algorithms,
Implementation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut,
Universität Paderborn, 2023, pp. 21–44, doi:10.5281/zenodo.8068414.'
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.'
date_created: 2023-07-07T07:02:44Z
date_updated: 2023-07-07T11:23:08Z
ddc:
- '004'
department:
- _id: '7'
- _id: '19'
doi: 10.5281/zenodo.8068414
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T06:59:23Z
date_updated: 2023-07-07T11:23:07Z
file_id: '45879'
file_name: A3-Chapter-SFB-Buch-Final.pdf
file_size: 1116173
relation: main_file
file_date_updated: 2023-07-07T11:23:07Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 21-44
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
grant_number: '160364472'
name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
(Subproject A3)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'The Market for Services: Incentives, Algorithms, Implementation'
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '34040'
abstract:
- lang: eng
text: "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."
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Marcin
full_name: Dziubiński, Marcin
last_name: Dziubiński
citation:
ama: 'Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment.
In: De Raedt L, ed. Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence. International Joint Conferences on Artificial
Intelligence Organization; 2022. doi:10.24963/ijcai.2022/64'
apa: Polevoy, G., & Dziubiński, M. (2022). Fair, Individually Rational and Cheap
Adjustment. In L. De Raedt (Ed.), Proceedings of the Thirty-First International
Joint Conference on Artificial Intelligence. International Joint Conferences
on Artificial Intelligence Organization. https://doi.org/10.24963/ijcai.2022/64
bibtex: '@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational
and Cheap Adjustment}, DOI={10.24963/ijcai.2022/64},
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} }'
chicago: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and
Cheap Adjustment.” In Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt. International Joint Conferences
on Artificial Intelligence Organization, 2022. https://doi.org/10.24963/ijcai.2022/64.
ieee: 'G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,”
in Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence, Vienna, 2022, doi: 10.24963/ijcai.2022/64.'
mla: Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap
Adjustment.” Proceedings of the Thirty-First International Joint Conference
on Artificial Intelligence, edited by Luc De Raedt, International Joint Conferences
on Artificial Intelligence Organization, 2022, doi:10.24963/ijcai.2022/64.
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.'
conference:
end_date: 2022-07-29
location: Vienna
name: THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
start_date: 2022-07-23
date_created: 2022-11-08T16:53:31Z
date_updated: 2022-11-08T17:34:36Z
department:
- _id: '63'
- _id: '541'
doi: 10.24963/ijcai.2022/64
editor:
- first_name: Luc
full_name: De Raedt, Luc
last_name: De Raedt
keyword:
- adjustment
- strictly dominant
- fairness
- individually rational
- transfer
- tax
- subsidy
language:
- iso: eng
main_file_link:
- url: https://www.ijcai.org/proceedings/2022/64
publication: Proceedings of the Thirty-First International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: International Joint Conferences on Artificial Intelligence Organization
status: public
title: Fair, Individually Rational and Cheap Adjustment
type: conference
user_id: '83983'
year: '2022'
...
---
_id: '17667'
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.'
author:
- first_name: Ralph
full_name: Koning, Ralph
last_name: Koning
- 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
full_name: de Laat, Cees
last_name: de Laat
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
citation:
ama: 'Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative
Security Defences in Multi Network Environments. 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 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:10.1109/CSCloud/EdgeCom.2019.000-9'
apa: Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019).
Approaches for Collaborative Security Defences in Multi Network Environments.
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) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9
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={10.1109/CSCloud/EdgeCom.2019.000-9},
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)}
}'
chicago: Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso.
“Approaches for Collaborative Security Defences in Multi Network Environments.”
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), 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. https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9.
ieee: R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for
Collaborative Security Defences in Multi Network Environments,” 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.
mla: Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi
Network Environments.” 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–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
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.'
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)
date_created: 2020-08-06T15:23:23Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/CSCloud/EdgeCom.2019.000-9
extern: '1'
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
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors
page: 113-123
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)
publication_identifier:
issn:
- 'null'
quality_controlled: '1'
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)
status: public
title: Approaches for Collaborative Security Defences in Multi Network Environments
type: conference
user_id: '83983'
year: '2019'
...
---
_id: '17651'
abstract:
- lang: eng
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.'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows
by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. Combinatorial Optimization
and Applications. Cham: Springer International Publishing; 2018:217-232.'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2018). Removing
Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, & A. Zelikovsky
(Eds.), Combinatorial Optimization and Applications (pp. 217–232). Cham:
Springer International Publishing.'
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}
}'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing
Undesirable Flows by Edge Deletion.” In Combinatorial Optimization and Applications,
edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer
International Publishing, 2018.'
ieee: G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable
Flows by Edge Deletion,” in Combinatorial Optimization and Applications,
2018, pp. 217–232.
mla: Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” Combinatorial
Optimization and Applications, edited by Donghyun Kim et al., Springer International
Publishing, 2018, pp. 217–32.
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.'
date_created: 2020-08-06T15:19:36Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Donghyun
full_name: Kim, Donghyun
last_name: Kim
- first_name: R. N.
full_name: Uma, R. N.
last_name: Uma
- first_name: Alexander
full_name: Zelikovsky, Alexander
last_name: Zelikovsky
extern: '1'
keyword:
- flow
- Red-Blue Set Cover
- Positive-Negative Partial Set Cover
- approximation
- tree
- MAX SNP-hard
- root
- leaf
- dynamic programming
- FPT
language:
- iso: eng
page: 217-232
place: Cham
publication: Combinatorial Optimization and Applications
publication_identifier:
isbn:
- 978-3-030-04651-4
publisher: Springer International Publishing
status: public
title: Removing Undesirable Flows by Edge Deletion
type: conference
user_id: '83983'
year: '2018'
...
---
_id: '17666'
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.'
author:
- first_name: R.
full_name: Koning, R.
last_name: Koning
- first_name: B.
full_name: de Graaff, B.
last_name: de Graaff
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: R.
full_name: Meijer, R.
last_name: Meijer
- first_name: C.
full_name: de Laat, C.
last_name: de Laat
- first_name: P.
full_name: Grosso, P.
last_name: Grosso
citation:
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.
Future Generation Computer Systems. 2018. doi:https://doi.org/10.1016/j.future.2018.08.011
apa: Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., & Grosso,
P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer
infrastructures. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2018.08.011
bibtex: '@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring
the efficiency of SDN mitigations against attacks on computer infrastructures},
DOI={https://doi.org/10.1016/j.future.2018.08.011},
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}
}'
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.”
Future Generation Computer Systems, 2018. https://doi.org/10.1016/j.future.2018.08.011.
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,”
Future Generation Computer Systems, 2018.
mla: Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks
on Computer Infrastructures.” Future Generation Computer Systems, 2018,
doi:https://doi.org/10.1016/j.future.2018.08.011.
short: R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future
Generation Computer Systems (2018).
date_created: 2020-08-06T15:23:11Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: https://doi.org/10.1016/j.future.2018.08.011
extern: '1'
keyword:
- Software defined networks
- Network function virtualization
- Cyber attacks
- Cyber security
- Defense efficiency
- Overlay networks
language:
- iso: eng
publication: Future Generation Computer Systems
publication_identifier:
issn:
- 0167-739X
status: public
title: Measuring the efficiency of SDN mitigations against attacks on computer infrastructures
type: journal_article
user_id: '83983'
year: '2018'
...
---
_id: '17652'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Stojan
full_name: Trajanovski, Stojan
last_name: Trajanovski
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
citation:
ama: 'Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows
in Networks. In: Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I. Lecture Notes in Computer Science. Cham: Springer International Publishing;
2017:3-17. doi:10.1007/978-3-319-71150-8_1'
apa: 'Polevoy, G., Trajanovski, S., Grosso, P., & de Laat, C. (2017). Filtering
Undesirable Flows in Networks. In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-71150-8_1'
bibtex: '@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture
Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={10.1007/978-3-319-71150-8_1},
booktitle={Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer
International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso,
Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering
Undesirable Flows in Networks.” In Combinatorial Optimization and Applications:
11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017,
Proceedings, Part I, 3–17. Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2017. https://doi.org/10.1007/978-3-319-71150-8_1.'
ieee: 'G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable
Flows in Networks,” in Combinatorial Optimization and Applications: 11th International
Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part
I, 2017, pp. 3–17.'
mla: 'Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” Combinatorial
Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai,
China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
2017, pp. 3–17, doi:10.1007/978-3-319-71150-8_1.'
short: 'G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization
and Applications: 11th International Conference, COCOA 2017, Shanghai, China,
December 16-18, 2017, Proceedings, Part I, Springer International Publishing,
Cham, 2017, pp. 3–17.'
date_created: 2020-08-06T15:19:48Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-319-71150-8_1
extern: '1'
keyword:
- flow
- filter
- MMSA
- set cover
- approximation
- local ratio algorithm
language:
- iso: eng
page: 3-17
place: Cham
publication: 'Combinatorial Optimization and Applications: 11th International Conference,
COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I'
publication_identifier:
isbn:
- 978-3-319-71150-8
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Filtering Undesirable Flows in Networks
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17653'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: Proceedings of
the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer; 2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Reciprocation Effort Games. In
Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation
Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial
Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.},
year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer,
2017.
ieee: G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in Proceedings
of the 29th Benelux Conference on Artificial Intelligence, 2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” Proceedings
of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:09Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- interaction
- reciprocation
- contribute
- shared effort
- curbing
- convergence
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Reciprocation Effort Games
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17654'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
citation:
ama: 'Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: Proceedings
of the 29th Benelux Conference on Artificial Intelligence. CCIS. Springer;
2017.'
apa: Polevoy, G., & de Weerdt, M. M. (2017). Competition between Cooperative
Projects. In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
Springer.
bibtex: '@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition
between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference
on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de
Weerdt, M.M.}, year={2017}, collection={CCIS} }'
chicago: Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.”
In Proceedings of the 29th Benelux Conference on Artificial Intelligence.
CCIS. Springer, 2017.
ieee: G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,”
in Proceedings of the 29th Benelux Conference on Artificial Intelligence,
2017.
mla: Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.”
Proceedings of the 29th Benelux Conference on Artificial Intelligence,
Springer, 2017.
short: 'G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference
on Artificial Intelligence, Springer, 2017.'
date_created: 2020-08-06T15:20:19Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agents
- projects
- contribute
- shared effort game
- competition
- quota
- threshold
- Nash equilibrium
- social welfare
- efficiency
- price of anarchy
- price of stability
language:
- iso: eng
publication: Proceedings of the 29th Benelux Conference on Artificial Intelligence
publisher: Springer
series_title: CCIS
status: public
title: Competition between Cooperative Projects
type: conference
user_id: '83983'
year: '2017'
...
---
_id: '17655'
author:
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: M.M.
full_name: de Weerdt, M.M.
last_name: de Weerdt
- first_name: C.M.
full_name: Jonker, C.M.
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt MM, Jonker CM. The Game of Reciprocation Habits. In:
Proceedings of the 2016 European Conference on Artificial Intelligence.
Vol Volume 285: ECAI 2016. Frontiers in Artificial Intelligence and Applications.
; 2016:417-425. doi:10.3233/978-1-61499-672-9-417'
apa: 'Polevoy, G., de Weerdt, M. M., & Jonker, C. M. (2016). The Game of Reciprocation
Habits. In Proceedings of the 2016 European Conference on Artificial Intelligence
(Vol. Volume 285: ECAI 2016, pp. 417–425). https://doi.org/10.3233/978-1-61499-672-9-417'
bibtex: '@inproceedings{Polevoy_de Weerdt_Jonker_2016, series={Frontiers in Artificial
Intelligence and Applications}, title={The Game of Reciprocation Habits}, volume={Volume
285: ECAI 2016}, DOI={10.3233/978-1-61499-672-9-417},
booktitle={Proceedings of the 2016 European Conference on Artificial Intelligence},
author={Polevoy, Gleb and de Weerdt, M.M. and Jonker, C.M.}, year={2016}, pages={417–425},
collection={Frontiers in Artificial Intelligence and Applications} }'
chicago: 'Polevoy, Gleb, M.M. de Weerdt, and C.M. Jonker. “The Game of Reciprocation
Habits.” In Proceedings of the 2016 European Conference on Artificial Intelligence,
Volume 285: ECAI 2016:417–25. Frontiers in Artificial Intelligence and Applications,
2016. https://doi.org/10.3233/978-1-61499-672-9-417.'
ieee: 'G. Polevoy, M. M. de Weerdt, and C. M. Jonker, “The Game of Reciprocation
Habits,” in Proceedings of the 2016 European Conference on Artificial Intelligence,
2016, vol. Volume 285: ECAI 2016, pp. 417–425.'
mla: 'Polevoy, Gleb, et al. “The Game of Reciprocation Habits.” Proceedings of
the 2016 European Conference on Artificial Intelligence, vol. Volume 285:
ECAI 2016, 2016, pp. 417–25, doi:10.3233/978-1-61499-672-9-417.'
short: 'G. Polevoy, M.M. de Weerdt, C.M. Jonker, in: Proceedings of the 2016 European
Conference on Artificial Intelligence, 2016, pp. 417–425.'
date_created: 2020-08-06T15:20:30Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.3233/978-1-61499-672-9-417
extern: '1'
keyword:
- agents
- action
- repeated reciprocation
- fixed
- floating
- network
- Nash equilibrium
- social welfare
- price of anarchy
- price of stability
- convex combination
language:
- iso: eng
page: 417-425
publication: Proceedings of the 2016 European Conference on Artificial Intelligence
series_title: Frontiers in Artificial Intelligence and Applications
status: public
title: The Game of Reciprocation Habits
type: conference
user_id: '83983'
volume: 'Volume 285: ECAI 2016'
year: '2016'
...
---
_id: '17656'
author:
- 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: Catholijn
full_name: Jonker, Catholijn
last_name: Jonker
citation:
ama: 'Polevoy G, de Weerdt M, Jonker C. The Convergence of Reciprocation. In: Proceedings
of the 2016 International Conference on Autonomous Agents and Multiagent Systems.
AAMAS ’16. Richland, SC: International Foundation for Autonomous Agents and Multiagent
Systems; 2016:1431-1432.'
apa: 'Polevoy, G., de Weerdt, M., & Jonker, C. (2016). The Convergence of Reciprocation.
In Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems (pp. 1431–1432). Richland, SC: International Foundation
for Autonomous Agents and Multiagent Systems.'
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 Proceedings of the 2016 International Conference on Autonomous
Agents and Multiagent Systems, 1431–32. AAMAS ’16. Richland, SC: International
Foundation for Autonomous Agents and Multiagent Systems, 2016.'
ieee: G. Polevoy, M. de Weerdt, and C. Jonker, “The Convergence of Reciprocation,”
in Proceedings of the 2016 International Conference on Autonomous Agents and
Multiagent Systems, 2016, pp. 1431–1432.
mla: Polevoy, Gleb, et al. “The Convergence of Reciprocation.” Proceedings of
the 2016 International Conference on Autonomous Agents and Multiagent Systems,
International Foundation for Autonomous Agents and Multiagent Systems, 2016, pp.
1431–32.
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.'
date_created: 2020-08-06T15:20:45Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
keyword:
- agent's influence
- behavior
- convergence
- perron-frobenius
- reciprocal interaction
- repeated reciprocation
language:
- iso: eng
page: 1431-1432
place: Richland, SC
publication: Proceedings of the 2016 International Conference on Autonomous Agents
and Multiagent Systems
publication_identifier:
isbn:
- 978-1-4503-4239-1
publisher: International Foundation for Autonomous Agents and Multiagent Systems
series_title: AAMAS '16
status: public
title: The Convergence of Reciprocation
type: conference
user_id: '83983'
year: '2016'
...
---
_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: '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'
...
---
_id: '17663'
abstract:
- lang: eng
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.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '17664'
author:
- first_name: Reuven
full_name: Cohen, Reuven
last_name: Cohen
- first_name: Ilia
full_name: Nudelman, Ilia
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: 'Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. In: Infocom’2012, Orlando, Florida. ; 2012.'
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2012). On the Admission of Dependent
Flows in Powerful Sensor Networks. In Infocom’2012, Orlando, Florida.
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}
}'
chicago: Cohen, Reuven, Ilia Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” In Infocom’2012, Orlando, Florida,
2012.
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” in Infocom’2012, Orlando, Florida, 2012.
mla: Cohen, Reuven, et al. “On the Admission of Dependent Flows in Powerful Sensor
Networks.” Infocom’2012, Orlando, Florida, 2012.
short: 'R. Cohen, I. Nudelman, G. Polevoy, in: Infocom’2012, Orlando, Florida, 2012.'
date_created: 2020-08-06T15:22:24Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
language:
- iso: eng
publication: Infocom'2012, Orlando, Florida
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: conference
user_id: '83983'
year: '2012'
...
---
_id: '17665'
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. In: DIALM-PODC. ; 2010:33-42.'
apa: Bar-Yehuda, R., Polevoy, G., & Rawitz, D. (2010). Bandwidth allocation
in cellular networks with multiple interferences. In DIALM-PODC (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} }'
chicago: Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation
in Cellular Networks with Multiple Interferences.” In DIALM-PODC, 33–42,
2010.
ieee: R. Bar-Yehuda, G. Polevoy, and D. Rawitz, “Bandwidth allocation in cellular
networks with multiple interferences,” in DIALM-PODC, 2010, pp. 33–42.
mla: Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with
Multiple Interferences.” DIALM-PODC, 2010, pp. 33–42.
short: 'R. Bar-Yehuda, G. Polevoy, D. Rawitz, in: DIALM-PODC, 2010, pp. 33–42.'
date_created: 2020-08-06T15:22:47Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
extern: '1'
language:
- iso: eng
page: 33-42
publication: DIALM-PODC
status: public
title: Bandwidth allocation in cellular networks with multiple interferences
type: conference
user_id: '83983'
year: '2010'
...