Computing Payoff Allocations in the Approximate Core of Linear Programming Games in a Privacy-Preserving Manner

Author(s):  
George Gilliam ◽  
Nelson A. Uhan
2010 ◽  
Vol 5 (1) ◽  
pp. 165-172 ◽  
Author(s):  
O. L. Mangasarian

Author(s):  
Yuan Hong ◽  
Jaideep Vaidya ◽  
Nicholas Rizzo ◽  
Qi Liu

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Lichen Zhang ◽  
Yingshu Li ◽  
Liang Wang ◽  
Junling Lu ◽  
Peng Li ◽  
...  

With the proliferation of smartphones and the usage of the smartphone apps, privacy preservation has become an important issue. The existing privacy preservation approaches for smartphones usually have less efficiency due to the absent consideration of the active defense policies and temporal correlations between contexts related to users. In this paper, through modeling the temporal correlations among contexts, we formalize the privacy preservation problem to an optimization problem and prove its correctness and the optimality through theoretical analysis. To further speed up the running time, we transform the original optimization problem to an approximate optimal problem, a linear programming problem. By resolving the linear programming problem, an efficient context-aware privacy preserving algorithm (CAPP) is designed, which adopts active defense policy and decides how to release the current context of a user to maximize the level of quality of service (QoS) of context-aware apps with privacy preservation. The conducted extensive simulations on real dataset demonstrate the improved performance of CAPP over other traditional approaches.


Sign in / Sign up

Export Citation Format

Share Document