Learn More
In a seminal paper, Karp, Vazirani, and Vazirani show that a simple ranking algorithm achieves a competitive ratio of 1-1/e for the online bipartite matching problem in the standard adversarial model, where the ratio of 1-1/e is also shown to be optimal. Their result also implies that in the random arrivals model defined by Goel and Mehta, where the online(More)
For revenue and welfare maximization in single-dimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple in form, can perform surprisingly well compared to the optimal mechanisms. In this paper, we give a theoretical explanation of this fact, based on a connection to the notion of(More)
We design an expected polynomial-time, truthful-in-expectation, (1 − 1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are matroid rank sums (MRS), which encompass most concrete examples of submodular functions studied in this context, including coverage(More)
Vol. 4 (1:?) 2008, pp. 1–1–20 www.lmcs-online.org Submitted Jul. 25, 2007 Published Mar. ??, 2008 LOWER BOUNDS FOR COMPLEMENTATION OF ω -AUTOMATA VIA THE FULL AUTOMATA TECHNIQUE ∗ QIQI YAN Department of Computer S ien e and Engineering, Shanghai Jiao Tong University, 200240, Shanghai, P.R. China e-mail address: onta t qiqiyan. om Abstra t. In this paper, we(More)
We design an expected polynomial time, truthful in expectation, (1-1/e)-approximation mechanism for welfare maximization in a fundamental class of combinatorial auctions. Our results apply to bidders with valuations that are <i>matroid rank sums (MRS)</i>, which encompass most concrete examples of submodular functions studied in this context, including(More)
We consider profit maximizing (incentive compatible) mechanism design in general environments that include, e.g., position auctions (for selling advertisements on Internet search engines) and single-minded combinatorial auctions. We analyze optimal envy-free pricings in these settings, and give economic justification for using the optimal revenue of(More)
Most results in revenue-maximizing auction design hinge on "getting the price right" --- offering goods to bidders at a price low enough to encourage a sale, but high enough to garner non-trivial revenue. Getting the price right can be hard work, especially when the seller has little or no a priori information about bidders' valuations. A simple(More)
The existing literature on optimal auctions focuses on optimizing the <i>expected revenue</i> of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good mechanisms for <i>risk-averse</i> sellers. As is standard in the economics literature, we model the risk-aversion of a seller by endowing the seller with a monotone concave(More)