41 search results - page 5 / 9 » Economic dynamics of agents in multiple auctions |
ATAL
2010
Springer
13 years 8 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...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
ATAL
2009
Springer
14 years 2 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....
SIGECOM
2004
ACM
14 years 29 days 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 ...
AMEC
2003
Springer
14 years 23 days ago
2003
Springer
Digital information economies require information goods producers to learn how to position themselves within a potentially vast product space. Further, the topography of this spac...