Sciweavers

5 search results - page 1 / 1
» Incentive compatible open constraint optimization
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Incentive compatible open constraint optimization
Boi Faltings, Santiago Macho-Gonzalez
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 8 months ago
Multi-Unit Auctions: Beyond Roberts
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
Shahar Dobzinski, Noam Nisan
AAAI
2004
13 years 9 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
ATAL
2006
Springer
13 years 11 months ago
MDPOP: faithful distributed implementation of efficient social choice problems
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
Adrian Petcu, Boi Faltings, David C. Parkes