Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Bang-Jensen, Gregory Gutin (2002)
Digraphs - theory, algorithms and applications
P.R. Wurman, W.E. Walsh, M.P. Wellman (1998)
Flexible double auctions for electronic commerceDecision Support Systems, 24
W. Jevons (1965)
Theory of Political Economy
G. Gutin (1993)
Finding a Longest Path in a Complete Multipartite DigraphSIAM J. Discret. Math., 6
J. Kalagnanam, Andrew Davenport, Ho Lee (2001)
Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible DemandElectronic Commerce Research, 1
S. Vries, R. Vohra (2003)
Combinatorial Auctions: A SurveyINFORMS J. Comput., 15
Hong Wang (2000)
On the maximal number of vertices covered by disjoint cyclesAustralas. J Comb., 21
Robert Jones (1976)
The Origin and Development of Media of ExchangeJournal of Political Economy, 84
Shouyong Shi (2001)
Bargains, Barter, and Money☆Review of Economic Dynamics, 4
Hong Wang (1999)
On the maximum number of independent cycles in a graphDiscret. Math., 205
R. Ahuja, T. Magnanti, J. Orlin (1993)
Network Flows: Theory, Algorithms, and Applications
C. Little, Hong Wang (1995)
Vertex disjoint cycles in a directed graphAustralas. J Comb., 12
Peter Wurman, W. Walsh, Michael Wellman (1998)
Flexible double auctions for electronic commerce: theory and implementationDecis. Support Syst., 24
Shuji Shinohara, Y. Gunji (2001)
Emergence and collapse of money through reciprocityAppl. Math. Comput., 117
We define a problem called “used car salesman problem” in which sale, purchase and barter bids can be simultaneously put forward for trading cars. A sale or a purchase bid is expressed in terms of a single car and a sale or purchase price that is required for the car. A barter bid, on the other hand, can be augmented by a differential money amount that is offered or required in addition to the cars that are to be traded. Restrictions are also allowed to be placed on sale and purchase bids. A minimum cost circulation network flow algorithm is presented which produces a solution that maximizes the profit made by the used car salesman.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 30, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.