Value of information gained from data mining in the context of information sharing

This paper uses a game-theoretic framework to suggest the fair value for information extracted via data mining and shared between two retail-market competitors. For mutual benefit, the two players each owning a privileged information set (a collection of data or database) may want to share or pool all or part of the information contained within their respective databases. Assume that each player is equipped with a data mining technique which extracts information from the data. We first model the information sharing as a cooperative game. Then, we use results from the cost sharing literature to provide information sharing methods when data can be quantified either as discrete or as continuous variables. In the latter case, we provide a means for obtaining decision rules for pricing shared information.

[1]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[2]  Hervé Moulin,et al.  ON ADDITIVE METHODS TO SHARE JOINT COSTS , 1995 .

[3]  Tomasz Imielinski,et al.  An Interval Classifier for Database Mining Applications , 1992, VLDB.

[4]  Yair Tauman,et al.  The Shapley value: The Aumann-Shapley prices: a survey , 1988 .

[5]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[6]  Arnold Reisman,et al.  On alternative strategies for doing research in the management and social sciences , 1988 .

[7]  Yair Tauman,et al.  Demand Compatible Equitable Cost Sharing Prices , 1982, Math. Oper. Res..

[8]  Eric J. Friedman,et al.  Three Methods to Share Joint Costs or Surplus , 1999 .

[9]  Yves Sprumont Coherent Cost-Sharing Rules , 2000, Games Econ. Behav..

[10]  L. S. Shapley,et al.  17. A Value for n-Person Games , 1953 .

[11]  A. Reisman,et al.  A meta review of game theory publications in the flagship US‐based OR/MS journals , 2001 .

[12]  Louis J. Billera,et al.  Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure , 1982, Math. Oper. Res..

[13]  Arnold Reisman Management Science Knowledge: Its Creation, Generalization, and Consolidation , 1992 .

[14]  Ramakrishnan Srikant,et al.  Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[15]  Dov Samet,et al.  The Determination of Marginal-Cost Prices Under a Set of Axioms , 1982 .

[16]  YunTong Wang,et al.  Simple random order methods to share costs , 2003, Int. J. Game Theory.

[17]  Yannis Bakos,et al.  Bundling and Competition on the Internet , 1999 .