602 search results - page 20 / 121 » Auctioning transformable goods |
148
click to vote
ICMAS
1998
15 years 5 months ago
1998
We present a decentralized, asynchronous market protocol for allocating and scheduling tasks among agents that contend for scarce resources, constrained by a hierarchical task dep...
140
click to vote
AMMA
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT: We examine an environment where goods and privately informed buyers arrive stochastically to a market. A seller in this setting faces a sequential allocation problem with...
108
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
141
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
129
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....