Sciweavers

549 search results - page 1 / 110
» Computational Bundling for Auctions
Sort
View
WECWIS
2005
IEEE
153views ECommerce» more  WECWIS 2005»
15 years 3 months ago
A Framework for Computing the Outcome of Proxied Combinatorial Auctions
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
Jie Zhong, Peter R. Wurman
104
Voted
ATAL
2006
Springer
15 years 6 days ago
Evaluating bidding strategies for simultaneous auctions
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
Teddy Candale, Sandip Sen
82
Voted
AAAI
2000
14 years 11 months ago
Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment
Iterative auctions have many computational advantages over sealed-bid auctions, but can present new possibilities for strategic manipulation. We propose a two-stage technique to m...
David C. Parkes, Lyle H. Ungar
76
Voted
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 3 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
101
Voted
WINE
2007
Springer
151views Economy» more  WINE 2007»
15 years 4 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...