Towards Sharp Inapproximability For Any 2-CSP

Per Austrin

Mathematical ProgrammingComputational Complexity TheoryEngineeringSurvivable SystemSemi-infinite Optimization +15

Practical privacy

Avrim Blum, Cynthia Dwork, Frank McSherry, +1

Privacy ProtectionEngineeringInformation SecurityComputational ComplexityData Science +15

Proceedings 35th Annual Symposium on Foundations of Computer Science

Programming Language TheoryComputational Complexity TheoryEngineeringAutomated ReasoningFormal Methods +3

Budget Feasible Mechanisms

Yaron Singer

Mathematical ProgrammingEngineeringGame TheoryMarket Equilibrium ComputationMarket Design +18

How reuse influences productivity in object-oriented systems

Victor R. Basili, Lionel Briand, Walcélio L. Melo

Communications of the ACM

Universally utility-maximizing privacy mechanisms

Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan

Privacy ProtectionEngineeringInformation SecurityPrivate Mechanism MuData Science +18

Hide and Seek: Costly Consumer Privacy in a Market with Repeat Purchases

Vincent Conitzer, Curtis R. Taylor, Liad Wagman

Marketing Science

Independent Third PartyConsumer ResearchInformation PrivacyMarket DesignConsumer Privacy +18

Optimal mechanism design and money burning

Jason D. Hartline, Tim Roughgarden

Mathematical ProgrammingOptimal Mechanism DesignEngineeringGame TheoryResidual Surplus +16

On the approximability of budget feasible mechanisms

Ning Chen, Nick Gravin, Pinyan Lu

arXiv (Cornell University)

Mathematical ProgrammingEngineeringComputational ComplexityMonotone Submodular FunctionsDiscrete Optimization +15

Truthful mechanisms for agents that value privacy

Yiling Chen, Stephen Chong, Ian A. Kash, +2

Privacy ProtectionEngineeringInformation SecurityGame TheoryCommunication +21