Michael Soltys, Craig Wilson. On the Complexity of Computing Winning Strategies for Finite Poset Games. Theory Comput. Syst., 48(3):680-692, 2011. [doi]
@article{SoltysW11,
title = {On the Complexity of Computing Winning Strategies for Finite Poset Games},
author = {Michael Soltys and Craig Wilson},
year = {2011},
doi = {10.1007/s00224-010-9254-y},
url = {http://dx.doi.org/10.1007/s00224-010-9254-y},
researchr = {https://researchr.org/publication/SoltysW11},
cites = {0},
citedby = {0},
journal = {Theory Comput. Syst.},
volume = {48},
number = {3},
pages = {680-692},
}