69 citations · 80 across the 8 of their papers we have counts for
8 papers
Approximately Optimal Auctions for Selling Privacy when Costs are Correlated with Data
Lisa Fleischer, Yu-Han Lyu
We consider a scenario in which a database stores sensitive data of users and an analyst wants to estimate statistics of the data. The users may suffer a cost when their data are u…
Online Mixed Packing and Covering
Umang Bhaskar, Lisa Fleischer
In many problems, the inputs arrive over time, and must be dealt with irrevocably when they arrive. Such problems are online problems. A common method of solving online problems is…
When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks
Amit Chakrabarti, Lisa Fleischer, Christophe Weibel
Let be a supply graph and a demand graph defined on the same set of vertices. An assignment of capacities to the edges of and demands to the edges of is…
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
Lisa Fleischer, Zhenghui Wang
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job has a leng…
Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses
Richard Cole, Lisa Fleischer, Ashish Rastogi
This paper shows that in suitable markets, even with out-of-equilibrium trade allowed, a simple price update rule leads to rapid convergence toward the equilibrium. In particular,…
A Stackelberg Strategy for Routing Flow over Time
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow wh…