22 search results - page 2 / 5 » acmicec 2003 |
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
Online auctions are increasingly being used as a medium to procure goods and services. As the number of auction sites increases, however, consumers will inevitably want to track a...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...