Sciweavers

602 search results - page 20 / 121
» Auctioning transformable goods
Sort
View
ICMAS
1998
14 years 11 months ago
A Market Protocol for Decentralized Task Allocation
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...
William E. Walsh, Michael P. Wellman
AMMA
2009
Springer
15 years 4 months ago
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
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...
Maher Said
ATAL
2010
Springer
14 years 10 months ago
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
This paper analyzes the worst-case efficiency ratio of falsename-proof combinatorial auction mechanisms. False-nameproofness generalizes strategy-proofness by assuming that a bidd...
Atsushi Iwasaki, Vincent Conitzer, Yoshifusa Omori...
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
15 years 2 months ago
Adaptive limited-supply online auctions
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 ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
ATAL
2009
Springer
15 years 4 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
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....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...