This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Coordination of Purchasing and Bidding Activities Across Markets

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Daniel D. Zeng
James C. Cox
Moshe Dror
Abstract

In both consumer purchasing and industrial procurement, combinatorial interdependencies among the items to be purchased are commonplace. E-commerce compounds the problem by providing more opportunities for switching suppliers at low costs, but also potentially eases the problem by enabling automated market decision-making systems, commonly referred to as trading agents, to make purchasing decisions in an integrated manner across markets. Most of the existing research related to trading agents assumes that there exists a combinatorial market mechanism in which buyers (or sellers) can bid (or sell) service or merchant bundles. Todayâ??s prevailing e-commerce practice, however, does not support this assumption in general and thus limits the practical applicability of these approaches. We are investigating a new approach to deal with the combinatorial interdependency challenges for online markets. This approach relies on existing commercial online market institutions such as posted-price markets and various online auctions that sell single items. It uses trading agents to coordinate a buyerâ??s purchasing and bidding activities across multiple online markets simultaneously to achieve the best overall procurement effectiveness. This paper presents two sets of models related to this approach. The first set of models formalizes optimal purchasing decisions across posted-price markets with fixed transaction costs. Flat shipping costs, a common e-tailing practice, are captured in these models. We observe that making optimal purchasing decisions in this context is NP-hard in the strong sense and suggest several efficient computational methods based on discrete location theory. The second set of models is concerned with the coordination of bidding activities across multiple online auctions. We study the underlying coordination problem for a collection of first or second-price sealed-bid auctions and derive the optimal coordination and bidding policies.

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.

File URL: http://excen.gsu.edu/workingpapers/GSU_EXCEN_WP_2006-04.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Experimental Economics Center, Andrew Young School of Policy Studies, Georgia State University in its series Experimental Economics Center Working Paper Series with number 2006-04.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 10
Date of creation:
Date of revision:
Handle: RePEc:exc:wpaper:2006-04

Contact details of provider:
Web page: http://excen.gsu.edu/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (J. Todd Swarthout).

Related research
Keywords:

Statistics
Access and download statistics

Did you know? IDEAS also indexes book chapters.

This page was last updated on 2009-12-5.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.