{"type":"ScholarlyArticle","title":"Multipotential Games","authors":[{"name":"Dov Monderer","slug":"dov-monderer","given":"Dov","family":"Monderer","affiliation":""}],"abstract":"We introduce and analyze q-potential games and q-congestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a game is a q-potential game if and only if it is (up to an isomorphism) a q-congestion game. As a corollary, we derive the result that every game in strategic form is a q-congestion game for some q. It is further shown that every q-congestion game is isomorphic to a q-network game, where the network environment is defined by a directed graph with one origin and one destination. Finally we discuss our main agenda: The issue of representing q-congestion games with non-negative cost functions by congestion models with non-negative and monotonic facility cost functions. We provide some initial results in this regard.","doi":null,"url":"https://ijcai.org/proceedings/2007/229","pdf":"https://ijcai.org/proceedings/2007/0229.pdf","markdown":"https://ijcai.org/proceedings/2007/229.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/229","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":229,"pages":{"first":1422,"last":1426},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}