Results 1  10
of
229
A New Derandomization of Auctions
"... Abstract. Let A be a randomized, unlimited supply, unit demand, singleitem auction, which given a bidvector b ∈ [h] n, has expected profit E[P (b)]. Aggarwal et al. showed that given A, there exists a deterministic auction which given a bidvector b, guarantees a profit of E[P (b)]/4 − O(h). In th ..."
Abstract
 Add to MetaCart
Abstract. Let A be a randomized, unlimited supply, unit demand, singleitem auction, which given a bidvector b ∈ [h] n, has expected profit E[P (b)]. Aggarwal et al. showed that given A, there exists a deterministic auction which given a bidvector b, guarantees a profit of E[P (b)]/4 − O
Hats, auctions and derandomization
"... We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal determin ..."
Abstract
 Add to MetaCart
We investigate derandomizations of digital good randomized auctions. We propose a general derandomization method which can be used to show that for every random auction there exists a deterministic auction having asymptotically the same revenue. In addition, we construct an explicit optimal
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1231 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
ACADEMIC AWARDS
, 1996
"... Description: Worked on mechanism design problems, including derandomization of auctions and limitedsupply attribute auctions. ..."
Abstract
 Add to MetaCart
Description: Worked on mechanism design problems, including derandomization of auctions and limitedsupply attribute auctions.
Approximation algorithms for combinatorial auctions with complementfree bidders
 In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC
, 2005
"... We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in the number of items m and in the number of bidders n, even though the “input size ” is exponential in m. The first algori ..."
Abstract

Cited by 138 (27 self)
 Add to MetaCart
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in the number of items m and in the number of bidders n, even though the “input size ” is exponential in m. The first
Auctions with budget constraints
 In 9th Scandinavian Workshop on Algorithm Theory (SWAT
, 2004
"... Abstract. In a combinatorial auction k different items are sold to n bidders, where the objective of the seller is to maximize the revenue. The main difficulty to find an optimal allocation is due to the fact that the valuation function of each bidder for bundles of items is not necessarily an addit ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
Abstract. In a combinatorial auction k different items are sold to n bidders, where the objective of the seller is to maximize the revenue. The main difficulty to find an optimal allocation is due to the fact that the valuation function of each bidder for bundles of items is not necessarily
Optimal Auctions with Correlated Bidders are Easy
, 2011
"... We consider the problem of designing a revenuemaximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomized mechanism that runs in time polynomial in the size of the support. ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
We consider the problem of designing a revenuemaximizing auction for a single item, when the values of the bidders are drawn from a correlated distribution. We observe that there exists an algorithm that finds the optimal randomized mechanism that runs in time polynomial in the size of the support
Inapproximability for vcgbased combinatorial auctions
"... The existence of incentivecompatible, computationallyefficient mechanisms for combinatorial auctions with good approximation ratios is the paradigmatic problem in algorithmic mechanism design. It is believed that, in many cases, good approximations for combinatorial auctions may be unattainable due ..."
Abstract

Cited by 24 (8 self)
 Add to MetaCart
The existence of incentivecompatible, computationallyefficient mechanisms for combinatorial auctions with good approximation ratios is the paradigmatic problem in algorithmic mechanism design. It is believed that, in many cases, good approximations for combinatorial auctions may be unattainable
Results 1  10
of
229