diff options
| author | Stratis Ioannidis <stratis@stratis-Latitude-E6320.(none)> | 2012-11-05 09:13:20 -0800 |
|---|---|---|
| committer | Stratis Ioannidis <stratis@stratis-Latitude-E6320.(none)> | 2012-11-05 09:13:20 -0800 |
| commit | d4d9933432e1f15f9839d0e0ca14ff0f8656b814 (patch) | |
| tree | 37c7d4b7bf0d1febed847a5ff26eaa3aa4fd4778 /main.tex | |
| parent | c94a36daa447f4c7821fad729b80622f59083625 (diff) | |
| parent | b3c19ae2cbbdeec29f1c383b319119b0672e14f8 (diff) | |
| download | recommendation-d4d9933432e1f15f9839d0e0ca14ff0f8656b814.tar.gz | |
Merge branch 'master' of ssh://palosgit01/git/data_value
Diffstat (limited to 'main.tex')
| -rw-r--r-- | main.tex | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -87,7 +87,7 @@ problems, Chen et al.~\cite{chen} %for \textsc{Knapsack} and Singer propose comparing $V(i^*)$ to %$OPT(R_{\mathcal{N}\setminus\{i\}}, B)$, where $R$ denotes the optimal value of a \emph{fractional relaxation} of the function $V$ over the set -$\mathcal{N}$. A fuction $R:[0, 1]^{n}\to\reals_+$ defined on the hypercube $[0, 1]^{n}$ is a fractional relaxation of $V$ +$\mathcal{N}$. A function $R:[0, 1]^{n}\to\reals_+$ defined on the hypercube $[0, 1]^{n}$ is a fractional relaxation of $V$ over the set $\mathcal{N}$ if %(a) $R$ is a function defined on the hypercube $[0, 1]^{n}$ and (b) $R(\id_S) = V(S)$ for all $S\subseteq\mathcal{N}$, where $\id_S$ denotes the indicator vector of $S$. The optimization program @@ -184,7 +184,7 @@ characterization from Singer \cite{singer-mechanisms} gives a formula to We can now state our main result: \begin{theorem}\label{thm:main} - The allocation described in Algorithm~\ref{mechanism}, along with threshold payments, is truthful, individiually rational + The allocation described in Algorithm~\ref{mechanism}, along with threshold payments, is truthful, individually rational and budget feasible. Furthermore, for any $\varepsilon>0$, the mechanism has complexity $O\left(\text{poly}(n, d, \log\log \varepsilon^{-1})\right)$ and returns a set $S^*$ such that: @@ -199,7 +199,7 @@ We can now state our main result: Note that this implies we construct a poly-time mechanism with accuracy arbitrarily close to 19.68, by taking $\varepsilon = \ldots$\stratis{fix me}. In addition, we prove the following lower bound. \begin{theorem}\label{thm:lowerbound} -There is no $2$-approximate, truthful, budget feasible, individionally rational mechanism for EDP. +There is no $2$-approximate, truthful, budget feasible, individually rational mechanism for EDP. \end{theorem} %\stratis{move the proof as appropriate} \begin{proof} |
