586 search results - page 18 / 118 » Algorithms for Multi-product Pricing |
WWW
2002
ACM
14 years 8 months ago
2002
ACM
This paper presents an approach to develop bidding agents that participate in multiple alternative auctions, with the goal of obtaining an item at the lowest price. The approach c...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
SIGECOM
2009
ACM
14 years 2 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
CCO
2001
Springer
14 years 6 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
OL
2010
13 years 6 months ago
2010
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...