arXiv (OAI Expanded)
open access
The Price of Privacy For Approximating Max-CSP
We study approximation algorithms for Maximum Constraint Satisfaction Problems (Max-CSPs) under differential privacy (DP) where the constraints are considered sensitive data. Information-theoretically, we aim to classify the best approximation ratios possible for a given privacy budget $\varepsilon$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Personalised versus Posted Pricing from Samples#1064725
- Privacy-Preserving Detection of Rare Disease-Associated Cell Subsets via Secure Multi-Party Computation#471178
- Between Privacy and Utility: On Differential Privacy in Theory and Practice#699355
- EXTENSIONS TO THE THEORY OF MARKETS AND PRIVACY: MECHANICS OF PRICING INFORMATION#933267
- Gatekeepers and the endogenous design of consumer preferences under personalized pricing#468377
Record · ID 1109784
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive