We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
We design algorithms for computing approximately revenue-maximizing sequential postedpricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copi...
Singular Value Decomposition (SVD), together with the Expectation-Maximization (EM) procedure, can be used to find a low-dimension model that maximizes the loglikelihood of obser...
Sheng Zhang, Weihong Wang, James Ford, Fillia Make...
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...