Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Fleischer, Lisa"'
Autor:
Fleischer, Lisa, Lyu, Yu-Han
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 used in which case they should be compensated. The analyst wishes to ge
Externí odkaz:
http://arxiv.org/abs/1204.4031
Autor:
Bhaskar, Umang, Fleischer, Lisa
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 to first solve the corresponding linear program, and then round the f
Externí odkaz:
http://arxiv.org/abs/1203.6695
Let $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \emph{cut condition} if for any cut in the graph,
Externí odkaz:
http://arxiv.org/abs/1203.4041
Autor:
Fleischer, Lisa, Wang, Zhenghui
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 $j$ has a length $l_{j}$ and each machine $i$ has a private speed $t_{i}$. The runni
Externí odkaz:
http://arxiv.org/abs/1107.2957
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, this paper considers a Fisher market repeated over an unbounded number
Externí odkaz:
http://arxiv.org/abs/1012.2124
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 where all flow exists simultaneously, and users care about either their
Externí odkaz:
http://arxiv.org/abs/1010.3034
Autor:
Svitkina, Zoya, Fleischer, Lisa
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load balancing or m
Externí odkaz:
http://arxiv.org/abs/0805.1071
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver. The algorithm employs a scaling scheme that uses a flow in th
Externí odkaz:
http://arxiv.org/abs/math/0004089
Publikováno v:
In Games and Economic Behavior July 2015 92:232-247
Publikováno v:
Mathematics of Operations Research, 2015 Aug 01. 40(3), 634-654.
Externí odkaz:
http://www.jstor.org/stable/24540968