STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Using association rules for product assortment decisions: a case study
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Microeconomic View of Data Mining
Data Mining and Knowledge Discovery
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Profit Mining: From Patterns to Actions
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Proceedings of the 17th International Conference on Data Engineering
Efficient Progressive Skyline Computation
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
The R-tree: An Improved R*-tree with Materialized Data for Supporting Range Queries on OLAP-Data
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
ItCompress: An Iterative Semantic Compression Algorithm
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Go Green: Recycle and Reuse Frequent Patterns
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A microeconomic data mining problem: customer-oriented catalog segmentation
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Maximal vector computation in large data sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Skyline Queries Against Mobile Lightweight Devices in MANETs
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Refreshing the sky: the compressed skycube with efficient support for frequent updates
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Finding k-dominant skylines in high dimensional space
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On Efficient Processing of Subspace Skyline Queries on High Dimensional Data
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
Efficient Skyline and Top-k Retrieval in Subspaces
IEEE Transactions on Knowledge and Data Engineering
Shooting stars in the sky: an online algorithm for skyline queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient computation of reverse skyline queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On dominating your neighborhood profitably
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parallelizing skyline queries for scalable distribution
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Proceedings of the VLDB Endowment
Understanding the meaning of a shifted sky: a general framework on extending skyline query
The VLDB Journal — The International Journal on Very Large Data Bases
Call to order: a hierarchical browsing approach to eliciting users' preference
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Efficient and domain-invariant competitor mining
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding influential products on social domination game
Proceedings of the 21st ACM international conference on Information and knowledge management
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Monochromatic and bichromatic mutual skyline queries
Expert Systems with Applications: An International Journal
A new utility-emphasized analysis for stock trading rules
Intelligent Data Analysis
Hi-index | 0.00 |
Game theory is a powerful tool for analyzing the competitions among manufacturers in a market. In this article, we present a study on combining game theory and data mining by introducing the concept of domination game analysis. We present a multidimensional market model, where every dimension represents one attribute of a commodity. Every product or customer is represented by a point in the multidimensional space, and a product is said to “dominate” a customer if all of its attributes can satisfy the requirements of the customer. The expected market share of a product is measured by the expected number of the buyers in the customers, all of which are equally likely to buy any product dominating him. A Nash equilibrium is a configuration of the products achieving stable expected market shares for all products. We prove that Nash equilibrium in such a model can be computed in polynomial time if every manufacturer tries to modify its product in a round robin manner. To further improve the efficiency of the computation, we also design two algorithms for the manufacturers to efficiently find their best response to other products in the market.