549 search results - page 9 / 110 » Computational Bundling for Auctions |
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
ACMICEC
2003
ACM
15 years 5 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...
68
Voted
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
106
click to vote
CONCUR
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a compositional trace-based model for probabilistic systems. The behavior of a system with probabilistic choice is a stochasticprocess, namely, a probability d...
109
click to vote
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...