Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
Journal of Algorithms
Finding all minimal unsatisfiable subsets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Ideal Evaluation from Coevolution
Evolutionary Computation
DECA: dimension extracting coevolutionary algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
How many dimensions in co-optimization
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
A two-player game given in the normal form of payoff matrix may be alternatively viewed as a list of the outcomes of binary interactions between two sets of entities, solutions and tests. The internal structure of such interactions may be characterized by an appropriately constructed coordinate system, which spatially arranges the solutions with respect to coordinates identified with tests, while preserving their mutual relations as given by the matrix. Of particular interest are coordinate systems of minimal size that give rise to the notion of dimension of a game. Following [1], we investigate such coordinate systems and relate their features to properties of partially ordered sets (posets), mostly to poset width and poset dimension. We propose an exact algorithm for constructing a minimal correct coordinate system and prove its correctness. In the experimental part, we compare the exact algorithm to the heuristics proposed in [1] on a sample of random payoff matrices of different sizes to demonstrate that the heuristics heavily overestimates the size of the minimal coordinate system. Finally, we show how the game dimension relate to the a priori dimension of a game.