We investigate a commodity trading problem in a flow network with arbitrary topology where sinks combine commodities into bundles in order to generate profits. Our focus is the profit maximization problem for the trading network under both central and distributed control. We compute solutions for the central control problem using an integer linear program while we compute solutions for the distributed case by implementing the nodes in the network as software-agents that exchange messages in order to establish profitable trades. We report on computational results using both methods and demonstrate that there is a connection between agent profits and a centrality measure developed for the problem. We also demonstrate that with our current agent strategy, there is a trade-off between the agents acting too quickly before enough information is available and waiting too long and thus giving each agent too much information and thus too much power over the outcome.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 194 (2009) Issue (Month): 3 (May) Pages: 888-900 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF