This dissertation focuses on strategic behavior and database privacy. First, we look at strategic behavior as a tool for distributed computation. We blend the perspectives of game theory and mechanism design in proposals for distributed solutions to the classical set cover optimization problem. We endow agents with natural individual incentives, and we show that centrally broadcasting non-binding advice effectively guides the system to a near-optimal state while keeping the original incentive structure intact. We next turn to the database privacy setting, in which an analyst wishes to learn something from a database, but the individuals contributing the data want to protect their personal information. The notion of differential privacy al...
Many large databases of personal information currently exist in the hands of corporations, nonprofit...
A scheme that publishes aggregate information about sen-sitive data must resolve the trade-off betwe...
Abstract—We consider a problem where mutually untrusting curators possess portions of a vertically p...
We propose a simple model where individuals in a privacy-sensitive population decide whether or not ...
Empirical thesis.Bibliography: pages 55-62.1. Introduction -- 2. Literature review -- 3. Privacy pre...
Computing technologies today have made it much easier to gather personal data, ranging from GPS loca...
Recent growth in the size and scope of databases has resulted in more research into making productiv...
Recent growth in the size and scope of databases has resulted in more research into making productiv...
We propose a simple model where individuals in a privacy-sensitive population decide whether or not ...
Use of technology for data collection and analysis has seen an unprecedented growth in the last coup...
Rapid development in computing technology and the Internet has given rise to new challenges in large...
Abstract—In many cases, competing parties who have private data may collaboratively conduct privacy-...
In 1977 Dalenius articulated a desideratum for statistical databases: nothing about an individual sh...
133 pagesWith vast databases at their disposal, private tech companies can compete with public stati...
In Ghosh-Ligett 2013, we propose a simple model where individuals in a privacy-sensitive population ...
Many large databases of personal information currently exist in the hands of corporations, nonprofit...
A scheme that publishes aggregate information about sen-sitive data must resolve the trade-off betwe...
Abstract—We consider a problem where mutually untrusting curators possess portions of a vertically p...
We propose a simple model where individuals in a privacy-sensitive population decide whether or not ...
Empirical thesis.Bibliography: pages 55-62.1. Introduction -- 2. Literature review -- 3. Privacy pre...
Computing technologies today have made it much easier to gather personal data, ranging from GPS loca...
Recent growth in the size and scope of databases has resulted in more research into making productiv...
Recent growth in the size and scope of databases has resulted in more research into making productiv...
We propose a simple model where individuals in a privacy-sensitive population decide whether or not ...
Use of technology for data collection and analysis has seen an unprecedented growth in the last coup...
Rapid development in computing technology and the Internet has given rise to new challenges in large...
Abstract—In many cases, competing parties who have private data may collaboratively conduct privacy-...
In 1977 Dalenius articulated a desideratum for statistical databases: nothing about an individual sh...
133 pagesWith vast databases at their disposal, private tech companies can compete with public stati...
In Ghosh-Ligett 2013, we propose a simple model where individuals in a privacy-sensitive population ...
Many large databases of personal information currently exist in the hands of corporations, nonprofit...
A scheme that publishes aggregate information about sen-sitive data must resolve the trade-off betwe...
Abstract—We consider a problem where mutually untrusting curators possess portions of a vertically p...