Author List: Greenwald, Amy; Kannan, Karthik; Krishnan, Ramayya;
Information Systems Research, 2010, Volume 21, Issue 1, Page 15-36.
Each market session in a reverse electronic marketplace features a procurer and many suppliers. An important attribute of a market session chosen by the procurer is its information revelation policy. The revelation policy determines the information (such as the number of competitors, the winning bids, etc.) that will be revealed to participating suppliers at the conclusion of each market session. Suppliers participating in multiple market sessions use strategic bidding and fake their own cost structure to obtain information revealed at the end of each market session. The information helps to reduce two types of uncertainties encountered in future market sessions, namely, their opponents' cost structure and an estimate of the number of their competitors. Whereas the first type of uncertainty is present in physical and e-marketplaces, the second type of uncertainty naturally arises in IT-enabled marketplaces. Through their effect on the uncertainty faced by suppliers, information revelation policies influence the bidding behavior of suppliers which, in turn, determines the expected price paid by the procurer. Therefore, the choice of information revelation policy has important consequences for the procurer. This paper develops a partially observable Markov decision process model of supplier bidding behavior and uses a multiagent e-marketplace simulation to analyze the effect that two commonly used information revelation policies—complete information policy and incomplete information policy—have on the expected price paid by the procurer. We find that the expected price under the complete information policy is lower than that under the incomplete information policy. The integration of ideas from the multiagents literature, the machinelearning literature, and the economics literature to develop a method to evaluate information revelation policies in e-marketplaces is a novel feature of this paper.
Keywords: auctions; game theory simulation; information revelation; MDP
Algorithm:

List of Topics

#241 0.321 information stage stages venture policies ewom paper crowdfunding second influence revelation funding cost important investigation ventures session studied electronic multiple
#260 0.147 policy movie demand features region effort second threshold release paid number regions analyze period respect availability released lower effect results
#91 0.107 auctions auction bidding bidders bid combinatorial bids online bidder strategies sequential prices design price using outcomes behavior theoretical computational efficiency
#242 0.091 market competition competitive network markets firms products competing competitor differentiation advantage competitors presence dominant structure share using incumbent make important
#0 0.090 information types different type sources analysis develop used behavior specific conditions consider improve using alternative understanding data available main target
#202 0.075 online uncertainty reputation sellers buyers seller marketplaces markets marketplace buyer price signaling auctions market premiums ebay transaction reverse literature comments
#44 0.054 approach analysis application approaches new used paper methodology simulation traditional techniques systems process based using proposed method present provides various