Sciweavers

ATAL
2003
Springer
14 years 5 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig
ATAL
2003
Springer
14 years 5 months ago
Miscomputing ratio: social cost of selfish computing
Auctions are useful mechanism for allocating items (goods, tasks, resources, etc.) in multiagent systems. The bulk of auction theory assumes that the bidders’ valuations for ite...
Kate Larson, Tuomas Sandholm
SIGECOM
2003
ACM
106views ECommerce» more  SIGECOM 2003»
14 years 5 months ago
Envy-free auctions for digital goods
We study auctions for a commodity in unlimited supply, e.g., a digital good. In particular we consider three desirable properties for auctions: • Competitive: the auction achiev...
Andrew V. Goldberg, Jason D. Hartline
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
14 years 5 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
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...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...
ATAL
2004
Springer
14 years 5 months ago
A Combinatorial Auction Protocol among Versatile Experts and Amateurs
Auctions have become an integral part of electronic commerce and a promising field for applying multi-agent technologies. Correctly judging the quality of auctioned items is ofte...
Takayuki Ito, Makoto Yokoo, Shigeo Matsubara
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
14 years 6 months ago
From optimal limited to unlimited supply auctions
We investigate the class of single-round, sealed-bid auctions for a set of identical items in unlimited supply. We adopt the worst-case competitive framework defined by [8, 4] th...
Jason D. Hartline, Robert McGrew
WECWIS
2005
IEEE
93views ECommerce» more  WECWIS 2005»
14 years 6 months ago
A Novel Auction Mechanism for Selling Time-Sensitive E-Services
Many e-services are time-sensitive as the users request them for a specific time period. Such services need to be repeatedly offered to keep them constantly utilized. This paper s...
Juong-Sik Lee, Boleslaw K. Szymanski
SIGECOM
2006
ACM
93views ECommerce» more  SIGECOM 2006»
14 years 6 months ago
The sequential auction problem on eBay: an empirical analysis and a solution
Bidders on eBay have no dominant bidding strategy when faced with multiple auctions each offering an item of interest. As seen through an analysis of 1,956 auctions on eBay for a...
Adam I. Juda, David C. Parkes
WECWIS
2006
IEEE
141views ECommerce» more  WECWIS 2006»
14 years 6 months ago
Iterative Combinatorial Auctions with Linear Prices: Results of Numerical Experiments
Iterative Combinatorial Auctions (ICA) have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation prob...
Alexander Pikovsky, Pasha Shabalin, Martin Bichler
HICSS
2006
IEEE
122views Biometrics» more  HICSS 2006»
14 years 6 months ago
Cooperation in Group-Buying Auctions
Cooperation among bidders in traditional auctions is generally forbidden because it is harmful to the interests of sellers. However, in a new type of online auction, the group-buy...
Jian Chen, Xilong Chen, Robert J. Kauffman, Xiping...