Sciweavers

203 search results - page 4 / 41
» A New Derandomization of Auctions
Sort
View
EUMAS
2006
13 years 8 months ago
Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goods to sell, and for transformations of goods. One such transformation can be se...
Jesús Cerquides, Ulle Endriss, Andrea Giova...
COCO
2010
Springer
148views Algorithms» more  COCO 2010»
13 years 11 months ago
Derandomizing from Random Strings
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
ATAL
2006
Springer
13 years 11 months ago
Reducing costly information acquisition in auctions
Most research on auctions assumes that potential bidders have private information about their willingness to pay for the item being auctioned, and that they use this information s...
Kate Larson
ATAL
2006
Springer
13 years 11 months ago
Reducing price fluctuation in continuous double auctions through pricing policy and shout improvement
Auction mechanism design is a subfield of game theory dedicated to manipulating the rules of an auction so as to achieve specific goals. The complexity of the dynamics of auctions...
Jinzhong Niu, Kai Cai, Simon Parsons, Elizabeth Sk...
ATAL
2008
Springer
13 years 9 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