Sciweavers

6 search results - page 1 / 2
» Characterizing Incentive Compatibility for Convex Valuations
Sort
View
SAGT
2009
Springer
177views Game Theory» more  SAGT 2009»
13 years 11 months ago
Characterizing Incentive Compatibility for Convex Valuations
We study implementability in dominant strategies of social choice functions when sets of types are multi-dimensional and convex, sets of outcomes are arbitrary, valuations for outc...
André Berger, Rudolf Müller, Seyed Hos...
SIGECOM
2000
ACM
175views ECommerce» more  SIGECOM 2000»
13 years 9 months ago
Competitive analysis of incentive compatible on-line auctions
This paper studies auctions in a setting where the di erent bidders arrive at di erent times and the auction mechanism is required to make decisions about each bid as it is receiv...
Ron Lavi, Noam Nisan
ATAL
2007
Springer
13 years 11 months ago
Online auctions for bidders with interdependent values
Interdependent values (IDV) is a valuation model allowing bidders in an auction to express their value for the item(s) to sell as a function of the other bidders’ information. W...
Florin Constantin, Takayuki Ito, David C. Parkes
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 2 months ago
On Optimal Single-Item Auctions
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently dis...
Christos H. Papadimitriou, George Pierrakos
AAAI
2004
13 years 6 months ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm