Workload factoring with the cloud: A game-theoretic perspective

Nahir, Amir; Orda, Ariel; Raz, Danny

doi:10.1109/infcom.2012.6195654

Cited by 13 publications

(13 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the same way, m−n < 2, hence |n−m| ≤ 1, which completes the proof for 2). In conclusion, we find out to have limited number of possibilities to be checked n = m; n = m − 1 or n = m + 1 , from which the system of (15) and (16) boils down to significantly simplified one in one variable.…”

Section: B Proofs Of the Propositions And Corollaries In A Bipartitementioning

confidence: 92%

“…Game theoretical studies for network problems have been conducted, in routing [13], [14], network flow [15], workload on the cloud [16] or optimal network design [17], [18], employing standard game-theoretic concepts [19], [20] such as pure Nash or mixed equilibrium. The Price of Anarchy (PoA) [21], [20] is often used as an equilibrium performance evaluation metric.…”

Section: Related Workmentioning

confidence: 99%

“…Now, A = 10 −1 and B = 10 −4 . The system of equations(15) and(16) will give 6 solutions: (n * , m * ) = {(1, 10),(2,5),(3,3), (5, 2), (10, 1)}. Five of these solutions are pairs of numbers that are neither equal nor consecutive integers.Proposition 9: S(n, m) is a function of two variables.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Decentralized Protection Strategies Against SIS Epidemics in Networks

Trajanovski

Hayel

Altman

et al. 2015

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

Defining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a SIS epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework and find pure, mixed equilibria, and the Price of Anarchy (PoA) in several network topologies. Further, we propose both a decentralized algorithm and an iterative procedure to compute a pure equilibrium in the general case of a multiple communities network. Finally, we evaluate the algorithms and give numerical illustrations of all our results.

show abstract

Section: B Proofs Of the Propositions And Corollaries In A Bipartitementioning

confidence: 92%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Decentralized Protection Strategies Against SIS Epidemics in Networks

Trajanovski

Hayel

Altman

et al. 2015

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

“…Game theoretical studies for networks problems have been conducted, in routing [9], [10], network flow [11], workload on the cloud [12] or optimal network design [13], employing standard game-theoretic concepts [14], [15] such as pure Nash or mixed equilibrium. The Price of Anarchy (PoA) [16], [15] is often used as an equilibrium performance evaluation metric.…”

Section: Introductionmentioning

confidence: 99%

Complete game-theoretic characterization of SIS epidemics protection strategies

Hayel

Trajanovski

Altman

et al. 2014

53rd IEEE Conference on Decision and Control

View full text Add to dashboard Cite

Defining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a Susceptible Infected Susceptible (SIS) epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework. Based on this model, we find pure and mixed equilibria, and evaluate the performance of the equilibria by finding the Price of Anarchy (PoA) in several network topologies. Finally, we give numerical illustrations of our results.

show abstract

“…Moreover, the resources in a horizontal federation are dedicated to processing internal requests, while in a vertical federation, the resources of a primary cloud are shared by different external requests. Therefore, the performance (i.e., processing time) of the requests in a primary cloud depends on the number of external requests outsourced by other entities [29]. While horizontal federations may still experience resource shortage or redundance, vertical federation is a perfect complement.…”

Section: Vertical and Horizontal Cloud Federationmentioning

confidence: 99%

Large scale strategic decision making in multi-agent systems

Chen¹

View full text Add to dashboard Cite

With the rapid development over the recent years, artificial intelligence (AI) technologies (e.g., machine learning, data mining and multi-agent systems) are becoming more and more popular among large companies and governments. In both academy and industry, there exist vast research opportunities in the interdisciplinary areas of AI and traditional research (e.g., game theory, resource allocation, operations research and transportation). This thesis is targeted at engineering solutions methodologies across the range of possible multi-agent system requirements. The range coverage was achieved v years. I thank Prof. Guoqiang Hu for his advice on the high level structure of the thesis.I would express my gratitude to Prof. Zinovi Rabinovich for his insightful and very detailed comments. His comments helped a lot in improving the quality of the thesis.

show abstract

Workload factoring with the cloud: A game-theoretic perspective

Cited by 13 publications

References 12 publications

Decentralized Protection Strategies Against SIS Epidemics in Networks

Decentralized Protection Strategies Against SIS Epidemics in Networks

Complete game-theoretic characterization of SIS epidemics protection strategies

Large scale strategic decision making in multi-agent systems

Contact Info

Product

Resources

About