Differentially private task allocation algorithm under preference protection

HIGHLIGHTS

• who: Differentially Private Task Allocation and collaborators from the School of, Commerce and Logistics Management, Henan University of Economics and Law, Zhengzhou, Henan, China have published the Article: Differentially Private Task Allocation Algorithm Under Preference Protection, in the Journal: (JOURNAL)
• what: The authors propose a with preference protection referred to as SLEPT. To relieve the problem that perturbation may lead to that tasks will not be allocated the authors propose a two-phase preference collection mechanism called TPC. The authors propose a sequential updating mechanism TASU using the remaining privacy budget. To overcome these two . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.