Results 1  10
of
976
Algorithmic mechanism design
 Games and Economic Behavior
, 1999
"... We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agen ..."
Abstract

Cited by 662 (23 self)
 Add to MetaCart
We consider algorithmic problems in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own selfinterest. As such participants, termed agents, are capable of manipulating the algorithm, the algorithm designer should ensure in advance that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools do not suffice. Journal of Economic Literature
Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords
 AMERICAN ECONOMIC REVIEW
, 2007
"... We investigate the “generalized secondprice” (GSP) auction, a new mechanism used by search engines to sell online advertising. Although GSP looks similar to the VickreyClarkeGroves (VCG) mechanism, its properties are very different. Unlike the VCG mechanism, GSP generally does not have an equilib ..."
Abstract

Cited by 555 (18 self)
 Add to MetaCart
(Show Context)
We investigate the “generalized secondprice” (GSP) auction, a new mechanism used by search engines to sell online advertising. Although GSP looks similar to the VickreyClarkeGroves (VCG) mechanism, its properties are very different. Unlike the VCG mechanism, GSP generally does not have an equilibrium in dominant strategies, and truthtelling is not an equilibrium of GSP. To analyze the properties of GSP, we describe the generalized English auction that corresponds to GSP and show that it has a unique equilibrium. This is an ex post equilibrium, with the same payoffs to all players as the dominant strategy equilibrium of VCG.
Sharing the Cost of Multicast Transmissions
, 2001
"... We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link o ..."
Abstract

Cited by 284 (16 self)
 Add to MetaCart
(Show Context)
We investigate costsharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. We prove that the former has a natural algorithm that uses only two messages per link of the multicast tree, while we give evidence that the latter requires a quadratic total number of messages. We also show that the welfare value achieved by an optimal multicast tree is NPhard to approximate within any constant factor, even for boundeddegree networks. The lowerbound proof for the Shapley value uses a novel algebraic technique for bounding from below the number of messages exchanged in a distributed computation; this technique may prove useful in other contexts as well.
An efficient ascendingbid auction for multiple objects
 AMERICAN ECONOMIC REVIEW
, 1997
"... In multipleobject environments where individual bidders may demand more than one object, standard methods of auction generally result in allocative inefficiency. This paper proposes a new ascendingbid method for auctioning homogeneous goods, such as Treasury bills or communications spectrum. The a ..."
Abstract

Cited by 283 (31 self)
 Add to MetaCart
In multipleobject environments where individual bidders may demand more than one object, standard methods of auction generally result in allocative inefficiency. This paper proposes a new ascendingbid method for auctioning homogeneous goods, such as Treasury bills or communications spectrum. The auctioneer announces a current price, bidders report back the quantity demanded at that price, and the auctioneer raises the price. Objects are awarded to bidders at the current price whenever they are “clinched,” and the process continues until the market clears. With pure private values, the proposed (dynamic) auction yields the same outcome as the (sealedbid) Vickrey auction, but may be simpler for bidders to understand and has the advantage of assuring the privacy of the upper portions of bidders ’ demand curves. With interdependent values, the proposed auction may still yield efficiency, whereas the Vickrey auction fails due to a problem which could be described as the “Generalized Winner’s Curse.”
Distributed Algorithmic Mechanism Design: Recent Results and Future Directions
, 2002
"... Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet’s decentralized nature, in which distributed computation and autono ..."
Abstract

Cited by 283 (24 self)
 Add to MetaCart
(Show Context)
Distributed Algorithmic Mechanism Design (DAMD) combines theoretical computer science’s traditional focus on computational tractability with its more recent interest in incentive compatibility and distributed computing. The Internet’s decentralized nature, in which distributed computation and autonomous agents prevail, makes DAMD a very natural approach for many Internet problems. This paper first outlines the basics of DAMD and then reviews previous DAMD results on multicast cost sharing and interdomain routing. The remainder of the paper describes several promising research directions and poses some specific open problems.
Bidding and Allocation in Combinatorial Auctions
 IN ACM CONFERENCE ON ELECTRONIC COMMERCE
, 2000
"... When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial", and the exponential number of possible combinations results in computational intractability o ..."
Abstract

Cited by 275 (11 self)
 Add to MetaCart
(Show Context)
When an auction of multiple items is performed, it is often desirable to allow bids on combinations of items, as opposed to only on single items. Such an auction is often called "combinatorial", and the exponential number of possible combinations results in computational intractability of many aspects regarding such an auction. This paper considers two of these aspects: the bidding language and the allocation algorithm. First we consider which kinds of bids on combinations are allowed and how, i.e. in what language, they are specified. The basic tradeoff is the expressibility of the language versus its simplicity. We consider and formalize several bidding languages and compare their strengths. We prove exponential separations between the expressive power of different languages, and show that one language, "ORbids with phantom items", can polynomially simulate the others. We then consider the problem of determining the best allocation  a problem known to be computationally intractable. We suggest an approach based on Linear Programming (LP) and motivate it. We prove that the LP approach finds an optimal allocation if and only if prices can be attached to single items in the auction. We pinpoint several classes of auctions where this is the case, and suggest greedy and branchandbound heuristics based on LP for other cases.
Putting Auction Theory to Work: The Simultaneous Ascending Auction
 Journal of Political Economy
, 2000
"... I review the uses of economic theory in the initial design and later improvement of the ‘‘simultaneous ascending auction,’ ’ which was developed initially for the sale of radio spectrum licenses in the United States. I analyze some capabilities and limitations of the auction, the roles of various de ..."
Abstract

Cited by 271 (21 self)
 Add to MetaCart
I review the uses of economic theory in the initial design and later improvement of the ‘‘simultaneous ascending auction,’ ’ which was developed initially for the sale of radio spectrum licenses in the United States. I analyze some capabilities and limitations of the auction, the roles of various detailed rules, the possibilities for introducing combinatorial bidding, and some considerations in adapting the auction for sales in which revenue, rather than efficiency, is the primary goal. I.
A BGPbased Mechanism for LowestCost Routing
, 2002
"... The routing of traffic between... this paper, we address the problem of interdomain routing from a mechanismdesign point of view. The application of mechanismdesign principles to the study of routing is the subject of earlier work by Nisan and Ronen [15] and Hershberger and Suri [11]. In this pape ..."
Abstract

Cited by 268 (16 self)
 Add to MetaCart
(Show Context)
The routing of traffic between... this paper, we address the problem of interdomain routing from a mechanismdesign point of view. The application of mechanismdesign principles to the study of routing is the subject of earlier work by Nisan and Ronen [15] and Hershberger and Suri [11]. In this paper, we formulate and solve a version of the routingmechanism design problem that is different from the previously studied version in three ways that make it more accurately reflective of realworld interdomain routing: (1) we treat the nodes as strategic agents, rather than the links; (2) our mechanism computes lowestcost routes for all sourcedestination pairs and payments for transit nodes on all of the routes (rather than computing routes and payments for only one sourcedestination pair at a time, as is done in [15,11]); (3) we show how to compute our mechanism with a distributed algorithm that is a straightforward extension to BGP and causes only modest increases in routingtable size and convergence time (in contrast with the centralized algorithms used in [15,11]). This approach of using an existing protocol as a substrate for distributed computation may prove useful in future development of Internet algorithms generally, not only for routing or pricing problems. Our design and analysis of a strategyproof, BGPbased routing mechanism provides a new, promising direction in distributed algorithmic mechanism design, which has heretofore been focused mainly on multicast cost sharing.
Ad hocVCG: A truthful and costefficient routing protocol for mobile ad hoc networks with selfish agents
, 2003
"... We introduce a gametheoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hocVCG, a reactive r ..."
Abstract

Cited by 234 (8 self)
 Add to MetaCart
We introduce a gametheoretic setting for routing in a mobile ad hoc network that consists of greedy, selfish agents who accept payments for forwarding data for other agents if the payments cover their individual costs incurred by forwarding data. In this setting, we propose Ad hocVCG, a reactive routing protocol that achieves the design objectives of truthfulness (i.e., it is in the agents ’ best interest to reveal their true costs for forwarding data) and costefficiency (i.e., it guarantees that routing is done along the most costefficient path) in a gametheoretic sense by paying to the intermediate nodes a premium over their actual costs for forwarding data packets. We show that the total overpayment (i.e., the sum of all premiums paid) is relatively small by giving a theoretical upper bound and by providing experimental evidence. Our routing protocol implements a variation of the wellknown mechanism by Vickrey, Clarke, and Groves in a mobile network setting. Finally, we analyze a very natural routing protocol that is an adaptation of the Packet Purse Model [8] with auctions in our setting and show that, unfortunately, it does not achieve costefficiency or truthfulness
Truthful Mechanisms for OneParameter Agents
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract

Cited by 232 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s secret data is the cost she incurs per unit load. We give an exact characterization for the algorithms that can be used to design truthful mechanisms for such load balancing problems using appropriate side payments. We use our characterization to design polynomial time truthful mechanisms for several problems in combinatorial optimization to which the celebrated VCG mechanism does not apply. For scheduling related parallel machines (QjjCmax), we give a 3approximation mechanism based on randomized rounding of the optimal fractional solution. This problem is NPcomplete, and the standard approximation algorithms (greedy loadbalancing or the PTAS) cannot be used in truthful mechanisms. We show our mechanism to be frugal, in that the total payment needed is only a logarithmic factor more than the actual costs incurred by the machines, unless one machine dominates the total processing power. We also give truthful mechanisms for maximum flow, Qjj P Cj (scheduling related machines to minimize the sum of completion times), optimizing an affine function over a fixed set, and special cases of uncapacitated facility location. In addition, for Qjj P wjCj (minimizing the weighted sum of completion times), we prove a lower bound of 2 p 3 for the best approximation ratio achievable by a truthful mechanism.