Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1611.03841

Designing Security-Aware Incentives for Computation Offloading via Device-to-Device Communication

Jie Xu·Lixing Chen·Kun Liu·Cong Shen
View original source ↗Read source document ↗Export metadata ↓

Abstract

Computation offloading via device-to-device (D2D) communication, or D2D offloading, has recently been proposed to enhance mobile computing performance by exploiting spare computing resources of nearby user devices. The success of D2D offloading relies on user participation in collaborative service provisioning, which incurs extra costs to users providing the service, thus mandating an incentive mechanism that can compensate for these costs. Although incentive mechanism design has been intensively studied in the literature, this paper considers a much more challenging yet less investigated problem in which selfish users are also facing interdependent security risks, such as infectious proximity-based attacks. Security cost is significantly different in nature from conventional service provisioning costs such as energy consumption, since security risks often depend on the collective behavior of all users. To this end, we build a novel mathematical framework by leveraging the combined power of game theory and epidemic theory to investigate the interplay between user incentives and interdependent security risks in D2D offloading, thereby enabling the design of security-aware incentive mechanisms. Our analysis discovers an interesting "less is more" phenomenon: although giving users more incentives promotes more participation, it may harm the network operator's utility. This is because too much participation may foster persistent security risks and as a result, the effective participation level does not improve. Our model and analysis shed new insights on the optimization of D2D offloading networks in the presence of interdependent security risks. Extensive simulations are carried out to verify our analytical conclusions.

Explore related subjects

cs.GTcs.NI

Keep this discovery

BibTeXRIS

Jie Xu, Lixing Chen, Kun Liu, Cong Shen. 2016-11-11. Designing Security-Aware Incentives for Computation Offloading via Device-to-Device Communication. https://arxiv.org/abs/1611.03841

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗