We introduce a sealed bid auction of a single item in which the winner is chosen at random among the highest k bidders according to a fixed probability distribution, and the price for the chosen winner is the Vickrey-Clarke-Groves price. We call such an auction a cascade auction. Our analysis suggests that this type of auction may give higher revenues compared to second price auction in cases o...

We design a simple ascending Vickrey auction for the combinatorial allocation problem. We make use of a concept called universal competitive equilibrium (UCE) price to design our auction. Our auction searches for a UCE price, which (along with an efficient allocation) provides enough information to compute the Vickrey payments of buyers. Our auction maintains non-linear and non-anonymous prices...

We examine the factors affecting the bidding competition in the online auction environment in this study. We propose a conceptual model to explain how information, including the reputation records of sellers and product quality, affects the level of competition in an online bidding environment. To test our model, digital camera auction data have been collected from eBay and Yahoo! auction websi...

While online auctions continue to increase, so does the incidence of online auction fraud. To avoid discovery, fraudsters often disguise themselves as honest members by imitating normal trading behaviors. Therefore, maintaining vigilance is not sufficient to prevent fraud. Participants in online auctions need a more proactive approach to protect their profits, such as an early fraud detection s...

The auction{reduction algorithm is a strongly polynomial version of the auction method for the shortest path problem. In this paper we extend the auction{reduction algorithm to diierent types of shortest hyperpath problems in directed hypergraphs. The results of preliminary computational experiences show that the auction{reduction method is comparable to other known methods for speciic classes ...

Instead of the costly encryption algorithms traditionally employed in auction schemes, efficient Goldwasser-Micali encryption is used to design a new sealed-bid auction. Multiplicative homomorphism instead of the traditional additive homomorphism is exploited to achieve security and high efficiency in the auction. The new scheme is the currently known most efficient non-interactive sealed-bid a...

This paper presents an agent-based simulation approach to estimate the effects of auction parameters on the auction outcomes, and to find an optimal or, at least, close to an optimal infrastructure. In particular, this study intends to study how bidders’ personalities and bidding strategies with other auction parameters affect the closing prices in two auction mechanisms: English and Yankee auc...

We generalize the Vickrey auction to allow for reserve pricing in a multi-unit auction with interdependent values. In the Vickrey auction with reserve pricing, the seller determines the quantity to be made available as a function of the bidders’ reports of private information, and then efficiently allocates this quantity among the bidders. Truthful bidding is a dominant strategy with private va...

In July 2000 the FCC issued the rules to govern the upcoming 700MHz auction. The rules are a departure from the auction architectures previously used by the FCC. Rather than all bidding only on individual licenses, the auction participants will be able to bid on combinations or packages of licenses. Several combinatorial auction processes exist in the literature and testing demonstrates that su...