199 search results - page 3 / 40 » Auctions with Untrustworthy Bidders |
90
Voted
STOC
2005
ACM
15 years 11 months ago
2005
ACM
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 ...
111
click to vote
FC
2003
Springer
15 years 4 months ago
2003
Springer
Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a com...
99
Voted
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
In a dynamic market, being able to update one’s value based on information available to other bidders currently in the market can be critical to having profitable transactions. ...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
166
click to vote
Publication
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...