{"type":"ScholarlyArticle","title":"Complexity of Pure Equilibria in Bayesian Games","authors":[{"name":"Georg Gottlob","slug":"georg-gottlob","given":"Georg","family":"Gottlob","affiliation":""},{"name":"Gianluigi Greco","slug":"gianluigi-greco","given":"Gianluigi","family":"Greco","affiliation":""},{"name":"Toni Mancini","slug":"toni-mancini","given":"Toni","family":"Mancini","affiliation":""}],"abstract":"In this paper we make a comprehensive study of the complexity of the problem of deciding the existence of equilibria in strategic games with incomplete information, in case of pure strategies. In particular, we show that this is NP-complete in general Bayesian Games in Standard Normal Form, and that it becomes PP-hard (and, in fixed-precision scenarios, PP-complete), when the game is represented succinctly in General Normal Form. Suitable restrictions in case of graphical games that make the problem tractable are also discussed.","doi":null,"url":"https://ijcai.org/proceedings/2007/209","pdf":"https://ijcai.org/proceedings/2007/0209.pdf","markdown":"https://ijcai.org/proceedings/2007/209.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/209","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":209,"pages":{"first":1294,"last":1298},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}