Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Finding a longest path in a complete multipartite digraph
SIAM Journal on Discrete Mathematics
Flexible double auctions for electionic commerce: theory and implementation
Decision Support Systems - Special issue on economics of electronic commerce
On the maximum number of independent cycles in a graph
Discrete Mathematics
Emergence and collapse of money through reciprocity
Applied Mathematics and Computation
Electronic Commerce Research
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Resource bartering in data grids
Scientific Programming
A direct barter model for course add/drop process
Discrete Applied Mathematics
Multi-unit differential auction-barter model for electronic marketplaces
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
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.