Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Abstract
In this paper we provide a logical framework for two-person finite games in strategic form, and use it to design a computer program for discovering some classes of games that have unique pure Nash equilibrium payoffs. The classes of games that we consider are those that can be expressed by a conjunction of two binary clauses, and our program re-discovered Kats and Thisseʼs class of weakly unilaterally competitive two-person games, and came up with several other classes of games that have unique pure Nash equilibrium payoffs. It also came up with new classes of strict games that have unique pure Nash equilibria, where a game is strict if for both player different profiles have different payoffs.
Cite
Text
Kosala et al. "Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference." International Joint Conference on Artificial Intelligence, 2003. doi:10.1016/j.artint.2011.07.001Markdown
[Kosala et al. "Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/kosala2003ijcai-information/) doi:10.1016/j.artint.2011.07.001BibTeX
@inproceedings{kosala2003ijcai-information,
title = {{Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference}},
author = {Kosala, Raymond and Bruynooghe, Maurice and Van den Bussche, Jan and Blockeel, Hendrik},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {403-408},
doi = {10.1016/j.artint.2011.07.001},
url = {https://mlanthology.org/ijcai/2003/kosala2003ijcai-information/}
}