Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Finance
Reexamination Certificate
2006-10-11
2011-12-27
Kyle, Charles (Department: 3695)
Data processing: financial, business practice, management, or co
Automated electrical financial or business practice or...
Finance
C705S035000, C705S03600T
Reexamination Certificate
active
08086520
ABSTRACT:
A set of solutions satisfying a constraint for an auction winner-determination problem are computed by generating a graph of paths, wherein each path represents a solution to the auction winner-determination problem that satisfies the constraint.
REFERENCES:
patent: 6952682 (2005-10-01), Wellman
patent: 7305363 (2007-12-01), Sandholm et al.
patent: 7801769 (2010-09-01), Kelly et al.
patent: 2002/0065762 (2002-05-01), Lee et al.
patent: 2002/0152182 (2002-10-01), Kashima et al.
patent: 2003/0033236 (2003-02-01), Davenport et al.
patent: 2003/0225677 (2003-12-01), Sandholm et al.
patent: 2004/0024686 (2004-02-01), Sandholm et al.
patent: 2006/0020394 (2006-01-01), Dicke et al.
patent: 2007/0008927 (2007-01-01), Herz et al.
patent: 2007/0087756 (2007-04-01), Hoffberg
patent: 2007/0156575 (2007-07-01), Sandholm et al.
patent: 2008/0063141 (2008-03-01), Luan et al.
patent: 2008/0103852 (2008-05-01), Byde
Martin Bichler, Jayant Kalagnanam; “Configurable offers and winner determination in multi-attribute auctions”, IBM T.J. Watson Research Center, Available online Feb. 21, 2004.
Noam Nisan, Amir Ronen; “Algorithmic Mechanism Design”, Game and Economic Behavior, vol. 35, pp. 166-196, Published 2001.
Eugene L. Lawler, “A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem” Management Science, vol. 18, No. 7, Theory Series (Mar. 1972), pp. 401-405.
“Combinatorial Auctions”, Edited by Peter Cramton, Yoav Shoham and Richard Steinberg, MIT Press, Published Jan. 2006, Chapter 12.
Anderegg et al., “Ad hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents”, MobiCom'03, Sep. 14-19, 2003.
Chang Wook Ahn et al., “A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations” IEEE Transactions on Evolutionary Computation, vol. 6, No. 6, Dec. 2002.
“Combinatorial Auctions”, Jan. 2006, Mit Press, Chapters 12, 13, 14 and 23.
Ahuja, R. et al., “Network Flows”, 1993, p. 106-107, Prentice Hall, Upper Saddle River, NJ.
Andersson, A. et al., “Integer Programming for Combinatorial Auction Winner Determination”, Computing Science Dept. Information Technology, Uppsala Univ. downloaded Sep. 22, 2005.
Bender, E. et al., “Foundations of Applied Combinatorics”, 1991, p. 31-33, Addision-Wesley Publishing Company.
Eppstein, D., “Finding the k Shortest Paths”, Mar. 1997, Dept. of Information and Computer Science, Univ. of CA, Irvine, CA.
Feller, W., “An Introduction to Probability Theory and Its Applications”, 1970, p. 38-39, vol. 1, John Wiley & Sons, Third Edition.
Hadjiconstantinou, E. et al., “An Efficient Implementation of an Algorithm for Finding K Shortest Simple Paths”, Networks, 1999, vol. 34, Iss. 2, Abstract only.
Kellerer, H. et al., “Knapsack Problems”, 2004, p. 1-5, 20-26, Springer.
Kelly, T., “Generalized Knapsack Solvers for Multi-Unit Combinatorial Auctions: Analysis and Application to Computational Resource Allocation”, Feb. 2004, HP Laboratories.
Kelly, T. et al., “Relaxation Criteria for Iterated Traffic Simulations”, 1998, vol. 9, International Journal of Modern Physics C, World Scientific Publishing Company.
Kelly T., “Utility-Directed Allocation”, Jun. 2003, HPL-2003-115, HP Laboratories Palo Alto.
Perko, A., “Implementation of Algorithms for K Shortest Loopless Paths”, Networks, 1986, p. 149-160. vol. 16, John Wiley & Sons.
Byde Andrew
Kelly Terence
Donlon Ryan D.
Hewlett--Packard Development Company, L.P.
Kyle Charles
LandOfFree
Constraint satisfaction for solutions to an auction... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Constraint satisfaction for solutions to an auction..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint satisfaction for solutions to an auction... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4261685