Results 1  10
of
82
Competitive Generalized Auctions
, 2002
"... We describe mechanisms for auctions that are simultaneously truthful (alternately known as strategyproof or incentivecompatible) and guarantee high "net" profit. We make use of appropriate variants of competitive analysis of algorithms in designing and analyzing our mechanisms. Thus, we ..."
Abstract

Cited by 87 (19 self)
 Add to MetaCart
We describe mechanisms for auctions that are simultaneously truthful (alternately known as strategyproof or incentivecompatible) and guarantee high "net" profit. We make use of appropriate variants of competitive analysis of algorithms in designing and analyzing our mechanisms. Thus, we do not require any probabilistic assumptions on bids. We present
Multiunit auctions with budgetconstrained bidders
 In Proceedings of the 7th ACM Conference on Electronic Commerce
, 2005
"... We study a multiunit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense that, under standard assumptions, we prove that it is impossible to design a nontrivial truthful auction which allocates ..."
Abstract

Cited by 74 (10 self)
 Add to MetaCart
We study a multiunit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense that, under standard assumptions, we prove that it is impossible to design a nontrivial truthful auction which allocates all units, while we provide the design of an asymptotically revenuemaximizing truthful mechanism which may allocate only some of the units. Our asymptotic parameter is a budget dominance parameter which measures the size of the budget of a single agent relative to the maximum revenue. We discuss the relevance of these results for the design of Internet ad auctions.
Approximation Algorithms and Online Mechanisms for Item Pricing
, 2007
"... Abstract: We present approximation and online algorithms for problems of pricing a collection of items for sale so as to maximize the seller’s revenue in an unlimited supply setting. Our first result is an O(k)approximation algorithm for pricing items to singleminded bidders who each want at most ..."
Abstract

Cited by 60 (9 self)
 Add to MetaCart
Abstract: We present approximation and online algorithms for problems of pricing a collection of items for sale so as to maximize the seller’s revenue in an unlimited supply setting. Our first result is an O(k)approximation algorithm for pricing items to singleminded bidders who each want at most k items. This improves over work of Briest and Krysta (2006) who achieve an O(k2) bound. For the case k = 2, where we obtain a 4approximation, this can be viewed as the following graph vertex pricing problem: given a (multi) graph G with valuations wi j on the edges, find prices pi ≥ 0 for the vertices to maximize {(i, j):wi j≥pi+p j} (pi + p j). We also improve the approximation of Guruswami et al. (2005) for the “highway problem” in which all desired subsets are intervals on a line, from O(logm+ logn) to O(logn), where m is the number of bidders and n is the number of items. Our approximation algorithms can
Worstcase optimal redistribution of VCG payments
 In Proceedings of the ACM Conference on Electronic Commerce (EC
, 2007
"... For allocation problems with one or more items, the wellknown VickreyClarkeGroves (VCG) mechanism is efficient, strategyproof, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents ’ payments will sum to more than ..."
Abstract

Cited by 48 (15 self)
 Add to MetaCart
For allocation problems with one or more items, the wellknown VickreyClarkeGroves (VCG) mechanism is efficient, strategyproof, individually rational, and does not incur a deficit. However, the VCG mechanism is not (strongly) budget balanced: generally, the agents ’ payments will sum to more than 0. If there is an auctioneer who is selling the items, this may be desirable, because the surplus payment corresponds to revenue for the auctioneer. However, if the items do not have an owner and the agents are merely interested in allocating the items efficiently among themselves, any surplus payment is undesirable, because it will have to flow out of the system of agents. In 2006, Cavallo [3] proposed a mechanism that redistributes some of the VCG payment back to the agents, while maintaining efficiency, strategyproofness, individual rationality, and the
Simple versus Optimal Mechanisms
"... The monopolist’s theory of optimal singleitem auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optimal auction is Vickrey with a reserve price. The second is from Bulow and Klemperer [1]: it is better to recruit one more bid ..."
Abstract

Cited by 46 (15 self)
 Add to MetaCart
The monopolist’s theory of optimal singleitem auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optimal auction is Vickrey with a reserve price. The second is from Bulow and Klemperer [1]: it is better to recruit one more bidder and run the Vickrey auction than to run the optimal auction. These results hold for singleitem auctions under the assumption that the agents ’ valuations are independently and identically drawn from a distribution that satisfies a natural (and prevalent) regularity condition. These fundamental guarantees for the Vickrey auction fail to hold in general singleparameter agent mechanism design problems. We give precise (and weak) conditions under which approximate analogs of these two results hold, thereby demonstrating that simple mechanisms remain almost optimal in quite general singleparameter agent settings.
Approximation and Collusion in Multicast Cost Sharing
, 2004
"... in Proceedings of the 3rd ACM Conference on Electronic Commerce, Tampa FL, October 2001. This work was supported by the DoD University Research Initiative (URI) program administered by the Oce of Naval Research under Grant N000140110795. ..."
Abstract

Cited by 43 (4 self)
 Add to MetaCart
in Proceedings of the 3rd ACM Conference on Electronic Commerce, Tampa FL, October 2001. This work was supported by the DoD University Research Initiative (URI) program administered by the Oce of Naval Research under Grant N000140110795.
Optimal mechanism design and money burning
 STOC ’08
, 2008
"... Mechanism design is now a standard tool in computer science for aligning the incentives of selfinterested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application domains of mechanism design (such as auctions) and those arising ..."
Abstract

Cited by 41 (12 self)
 Add to MetaCart
Mechanism design is now a standard tool in computer science for aligning the incentives of selfinterested agents with the objectives of a system designer. There is, however, a fundamental disconnect between the traditional application domains of mechanism design (such as auctions) and those arising in computer science (such as networks): while monetary transfers (i.e., payments) are essential for most of the known positive results in mechanism design, they are undesirable or even technologically infeasible in many computer systems. Classical impossibility results imply that the reach of mechanisms without transfers is severely limited. Computer systems typically do have the ability to reduce service quality—routing systems can drop or delay traffic, scheduling protocols can delay the release of jobs, and computational payment schemes can require computational payments from users (e.g., in spamfighting systems). Service degradation is tantamount to requiring that users burn money, and such “payments ” can be used to influence the preferences of the agents at a cost of degrading the social surplus. We develop a framework for the design and analysis of moneyburning mechanisms to maximize the residual surplus— the total value of the chosen outcome minus the payments required. Our primary contributions are the following. • We define a general template for priorfree optimal mechanism design that explicitly connects Bayesian optimal mechanism design, the dominant paradigm in economics, with worstcase analysis. In particular, we establish a general and principled way to identify appropriate performance benchmarks in priorfree mechanism design. • For general singleparameter agent settings, we char
Multiunit auctions with budget limits
 In Proc. of the 49th Annual Symposium on Foundations of Computer Science (FOCS
, 2008
"... We study multiunit auctions where the bidders have a budget constraint, a situation very common in practice that has received very little attention in the auction theory literature. Our main result is an impossibility: there are no incentivecompatible auctions that always produce a Paretooptimal ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
We study multiunit auctions where the bidders have a budget constraint, a situation very common in practice that has received very little attention in the auction theory literature. Our main result is an impossibility: there are no incentivecompatible auctions that always produce a Paretooptimal allocation. We also obtain some surprising positive results for certain special cases. 1
Robust game theory
, 2006
"... We present a distributionfree model of incompleteinformation games, both with and without private information, in which the players use a robust optimization approach to contend with payoff uncertainty. Our “robust game” model relaxes the assumptions of Harsanyi’s Bayesian game model, and provides ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
We present a distributionfree model of incompleteinformation games, both with and without private information, in which the players use a robust optimization approach to contend with payoff uncertainty. Our “robust game” model relaxes the assumptions of Harsanyi’s Bayesian game model, and provides an alternative distributionfree equilibrium concept, which we call “robustoptimization equilibrium, ” to that of the ex post equilibrium. We prove that the robustoptimization equilibria of an incompleteinformation game subsume the ex post equilibria of the game and are, unlike the latter, guaranteed to exist when the game is finite and has bounded payoff uncertainty set. For arbitrary robust finite games with bounded polyhedral payoff uncertainty sets, we show that we can compute a robustoptimization equilibrium by methods analogous to those for identifying a Nash equilibrium of a finite game with complete information. In addition, we present computational results.
Truthful and Competitive Double Auctions
, 2002
"... In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder's utility value for the item is private to them and we focus on truthful mechanisms, ones were the bidders' op ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
In this paper we consider the problem of designing a mechanism for double auctions where bidders each bid to buy or sell one unit of a single commodity. We assume that each bidder's utility value for the item is private to them and we focus on truthful mechanisms, ones were the bidders' optimal strategy is to bid their true utility. The profit of the auctioneer is the difference between the total payments from buyers and total to the sellers. We aim to maximize this profit. We extend the competitive analysis framework of basic auctions [9] and give an upper bound on the profit of any truthful double auction. We then reduce the competitive double auction problem to basic auctions by showing that any competitive basic auction can be converted into a competitive double auction with a competitive ratio of twice that of the basic auction.