Spatial Privacy Pricing: The Interplay between Privacy, Utility and Price in Geo-Marketplaces

• URL: http://arxiv.org/abs/2008.11817v2
• Date: Fri, 4 Sep 2020 01:11:07 GMT
• Title: Spatial Privacy Pricing: The Interplay between Privacy, Utility and Price in Geo-Marketplaces
• Authors: Kien Nguyen, John Krumm, Cyrus Shahabi
• Abstract summary: Users concerned about privacy may want to charge more for data that pinpoints their location accurately, but may charge less for data that is more vague. A buyer would prefer to minimize data costs, but may have to spend more to get the necessary level of accuracy. We call this interplay between privacy, utility, and price emphspatial privacy pricing.
• Score: 14.466602643062142
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A geo-marketplace allows users to be paid for their location data. Users concerned about privacy may want to charge more for data that pinpoints their location accurately, but may charge less for data that is more vague. A buyer would prefer to minimize data costs, but may have to spend more to get the necessary level of accuracy. We call this interplay between privacy, utility, and price \emph{spatial privacy pricing}. We formalize the issues mathematically with an example problem of a buyer deciding whether or not to open a restaurant by purchasing location data to determine if the potential number of customers is sufficient to open. The problem is expressed as a sequential decision making problem, where the buyer first makes a series of decisions about which data to buy and concludes with a decision about opening the restaurant or not. We present two algorithms to solve this problem, including experiments that show they perform better than baselines.

Related papers

• Keeping a Secret Requires a Good Memory: Space Lower-Bounds for Private Algorithms [67.94856074923571]
  This paper introduces a novel proof technique based on a multi-player communication game.<n>We show that winning this communication game requires transmitting information proportional to the number of over-active users.<n>We show that this communication-theoretic technique generalizes to broad classes of problems, yielding lower bounds for private medians, quantiles, and max-select.
  arXiv  Detail & Related papers  (2026-02-12T17:49:07Z)
• How to Sell High-Dimensional Data Optimally [31.69704731506027]
  We consider an information pricing problem that involves a decision-making buyer and a monopolistic seller.<n>Since the buyer gains greater utility through better decisions resulting from more accurate assessments of the state, the seller can therefore promise the supplemental information at a price.<n>We propose an algorithm which, given only sampling access to the state space, provably generates a near-optimal menu with a number of samples independent of the state space.
  arXiv  Detail & Related papers  (2025-10-17T00:49:03Z)
• From "I have nothing to hide" to "It looks like stalking": Measuring Americans' Level of Comfort with Individual Mobility Features Extracted from Location Data [0.24999074238880484]
  Location data collection has become widespread with smart phones becoming ubiquitous. Data aggregators and data brokers offer access to individual location data. The FTC has also started to vigorously regulate consumer privacy for location data.
  arXiv  Detail & Related papers  (2025-02-08T20:34:18Z)
• An Instrumental Value for Data Production and its Application to Data Pricing [107.98697414652479]
  This paper develops an approach for capturing the instrumental value of data production processes. We show how they connect to classic notions of information design and signals in information economics.
  arXiv  Detail & Related papers  (2024-12-24T03:53:57Z)
• Where you go is who you are -- A study on machine learning based semantic privacy attacks [3.259843027596329]
  We present a systematic analysis of two attack scenarios, namely location categorization and user profiling. Experiments on the Foursquare dataset and tracking data demonstrate the potential for abuse of high-quality spatial information. Our findings point out the risks of ever-growing databases of tracking data and spatial context data.
  arXiv  Detail & Related papers  (2023-10-26T17:56:50Z)
• Protecting User Privacy in Online Settings via Supervised Learning [69.38374877559423]
  We design an intelligent approach to online privacy protection that leverages supervised learning. By detecting and blocking data collection that might infringe on a user's privacy, we can restore a degree of digital privacy to the user.
  arXiv  Detail & Related papers  (2023-04-06T05:20:16Z)
• A Survey of Data Pricing for Data Marketplaces [77.3189288320768]
  This paper attempts to comprehensively review the state-of-the-art on existing data pricing studies. Our key contribution lies in a new taxonomy of data pricing studies that unifies different attributes determining data prices.
  arXiv  Detail & Related papers  (2023-03-07T04:35:56Z)
• On Differential Privacy and Adaptive Data Analysis with Bounded Space [76.10334958368618]
  We study the space complexity of the two related fields of differential privacy and adaptive data analysis. We show that there exists a problem P that requires exponentially more space to be solved efficiently with differential privacy. The line of work on adaptive data analysis focuses on understanding the number of samples needed for answering a sequence of adaptive queries.
  arXiv  Detail & Related papers  (2023-02-11T14:45:31Z)
• The Fair Value of Data Under Heterogeneous Privacy Constraints in Federated Learning [26.53734856637336]
  This paper puts forth an idea for a textitfair amount to compensate users for their data at a given privacy level based on an axiomatic definition of fairness. We also formulate a heterogeneous federated learning problem for the platform with privacy level options for users.
  arXiv  Detail & Related papers  (2023-01-30T23:51:03Z)
• Smooth Anonymity for Sparse Graphs [69.1048938123063]
  differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity.
  arXiv  Detail & Related papers  (2022-07-13T17:09:25Z)
• Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms [9.599356978682108]
  We consider a platform's problem of collecting data from privacy sensitive users to estimate an underlying parameter of interest. We consider two popular differential privacy settings for providing privacy guarantees for the users: central and local. We pose the mechanism design problem as the optimal selection of an estimator and payments that will elicit truthful reporting of users' privacy sensitivities.
  arXiv  Detail & Related papers  (2022-01-10T00:27:43Z)
• Privacy Amplification via Shuffling for Linear Contextual Bandits [51.94904361874446]
  We study the contextual linear bandit problem with differential privacy (DP) We show that it is possible to achieve a privacy/utility trade-off between JDP and LDP by leveraging the shuffle model of privacy. Our result shows that it is possible to obtain a tradeoff between JDP and LDP by leveraging the shuffle model while preserving local privacy.
  arXiv  Detail & Related papers  (2021-12-11T15:23:28Z)
• Equity and Privacy: More Than Just a Tradeoff [10.545898004301323]
  Recent work has shown that privacy preserving data publishing can introduce different levels of utility across different population groups. Will marginal populations see disproportionately less utility from privacy technology? If there is an inequity how can we address it?
  arXiv  Detail & Related papers  (2021-11-08T17:39:32Z)
• Privacy-Preserving Dynamic Personalized Pricing with Demand Learning [25.40475405419857]
  We consider a dynamic pricing problem with an emphunknown demand function of posted price and personalized information. A third party agent might infer the personalized information and purchase decisions from changes from adversarial pricing system. We introduce a notion of emphanticipating $(preservingvarepsilon, delta)$-differential privacy that is tailored to dynamic pricing problem.
  arXiv  Detail & Related papers  (2020-09-27T18:32:34Z)
• PGLP: Customizable and Rigorous Location Privacy through Policy Graph [68.3736286350014]
  We propose a new location privacy notion called PGLP, which provides a rich interface to release private locations with customizable and rigorous privacy guarantee. Specifically, we formalize a user's location privacy requirements using a textitlocation policy graph, which is expressive and customizable. Third, we design a private location trace release framework that pipelines the detection of location exposure, policy graph repair, and private trajectory release with customizable and rigorous location privacy.
  arXiv  Detail & Related papers  (2020-05-04T04:25:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.