This is a preview. Log in through your library . Abstract A greedy algorithm solves a dual pair of linear programs where the primal variables are associated to the elements of a sublattice B of a ...
This is a preview. Log in through your library . Abstract In this paper, we revisit the auction design problem for multi-item auctions with budget constrained buyers by introducing a robust ...
where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback