Sciweavers

199 search results - page 14 / 40
» Auctions with Untrustworthy Bidders
Sort
View
ATAL
2008
Springer
15 years 1 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
HICSS
2003
IEEE
85views Biometrics» more  HICSS 2003»
15 years 4 months ago
Designs for Ramp-Constrained Day-Ahead Auctions
— Some electric power markets allow bidders to specify constraints on ramp rates for increasing or decreasing power production. We show in a small example that a bidder could use...
Shmuel S. Oren, Andrew M. Ross
FOCS
2008
IEEE
15 years 5 months ago
Multi-unit Auctions with Budget Limits
We study multi-unit auctions where the bidders have a budget constraint, a situation very common in practice that has received relatively little attention in the auction theory li...
Shahar Dobzinski, Ron Lavi, Noam Nisan
FC
2003
Springer
101views Cryptology» more  FC 2003»
15 years 4 months ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
72
Voted
DEXAW
2002
IEEE
80views Database» more  DEXAW 2002»
15 years 4 months ago
Private Auctions with Multiple Rounds and Multiple Items
For selling spectrum licenses economists have designed new auction types proceeding over several rounds and offering several licenses simultaneously. Communication between bidders...
Ahmad-Reza Sadeghi, Matthias Schunter, Sandra Stei...