Sciweavers

17 search results - page 3 / 4
» Optimal Starting Price in Online Auctions
Sort
View
INFOCOM
2011
IEEE
12 years 10 months ago
To preempt or not: Tackling bid and time-based cheating in online spectrum auctions
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
Lara B. Deek, Xia Zhou, Kevin C. Almeroth, Haitao ...
WWW
2008
ACM
14 years 7 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
JETAI
2007
141views more  JETAI 2007»
13 years 6 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
MATES
2010
Springer
13 years 5 months ago
Impact of Competition on Quality of Service in Demand Responsive Transit
Abstract. Demand responsive transportation has the potential to provide efficient public door-to-door transport with a high quality. In currently implemented systems in the Netherl...
Ferdi Grootenboers, Mathijs de Weerdt, Mahdi Zarga...
JACM
2006
134views more  JACM 2006»
13 years 6 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich