{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:32:40Z","timestamp":1742949160657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501457"},{"type":"electronic","value":"9783030501464"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50146-4_21","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T17:04:54Z","timestamp":1591376694000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ordinal Graph-Based Games"],"prefix":"10.1007","author":[{"given":"Arij","family":"Azzabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nahla","family":"Ben Amor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00e9l\u00e8ne","family":"Fargier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9gis","family":"Sabbadin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ben Amor, N., Fargier, H., Sabbadin, R.: Equilibria in ordinal games: a framework based on possibility theory. In: International Joint Conferences on Artificial Intelligence (IJCAI 2017), pp. 105\u2013111 (2017)","DOI":"10.24963\/ijcai.2017\/16"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Chapman, A.C., Farinelli, A., de Cote, E.M., Rogers, A., Jennings, N.R.: A distributed algorithm for optimising over pure strategy Nash equilibria. In: Association for the Advancement of Artificial Intelligence (AAAI 2010), pp. 749\u2013755 (2010)","DOI":"10.1609\/aaai.v24i1.7610"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1026476425031","volume":"107","author":"JB Cruz","year":"2000","unstructured":"Cruz, J.B., Simaan, M.A.: Ordinal games and generalized Nash and Stackelberg solutions. J. Optim. Theory Appl. 107, 205\u2013222 (2000). https:\/\/doi.org\/10.1023\/A:1026476425031","journal-title":"J. Optim. Theory Appl."},{"key":"21_CR4","series-title":"CISM International Centre for Mechanical Sciences","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-211-38167-8_6","volume-title":"Decision Theory and Multi-Agent Planning","author":"D Dubois","year":"2006","unstructured":"Dubois, D., Prade, H.: Possibility theory and its applications: a retrospective and prospective view. In: Della Riccia, G., Dubois, D., Kruse, R., Lenz, H.-J. (eds.) Decision Theory and Multi-Agent Planning. CICMS, vol. 482, pp. 89\u2013109. Springer, Vienna (2006). https:\/\/doi.org\/10.1007\/3-211-38167-8_6"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S0377-2217(99)00473-7","volume":"128","author":"D Dubois","year":"2001","unstructured":"Dubois, D., Prade, H., Sabbadin, R.: Decision-theoretic foundations of qualitative possibility theory. Eur. J. Oper. Res. 128, 459\u2013478 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1613\/jair.1683","volume":"24","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., Scarcello, F.: Pure Nash equilibria: hard and easy games. J. Artif. Intell. Res. 24, 357\u2013406 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-007-0064-2","volume":"6","author":"M Grabisch","year":"2008","unstructured":"Grabisch, M., Labreuche, C.: A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid. Q. J. Oper. Res. 6, 1\u201344 (2008). https:\/\/doi.org\/10.1007\/s10288-007-0064-2","journal-title":"Q. J. Oper. Res."},{"key":"21_CR8","unstructured":"Hosni, H., Marchioni, E.: Possibilistic randomisation in strategic-form games. Int. J. Approx. Reas. (IJAR 2019) 114, 204\u2013225 (2019)"},{"key":"21_CR9","unstructured":"Jussien, N., Rochart, G., Lorca, X.: Choco: an open source Java constraint programming library (2008)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Kearns, M.: Algorithmic game theory, chap. 7. In: Graphical Games, pp. 159\u2013180. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.009"},{"key":"21_CR11","unstructured":"Kearns, M., Littman, M.L., Singh, S.: Graphical models for game theory. In: Uncertainty in Artificial Intelligence (UAI 2001), pp. 253\u2013260 (2001)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(91)90015-H","volume":"10","author":"DA Miller","year":"1991","unstructured":"Miller, D.A., Zucker, S.W.: Copositive-plus Lemke algorithm solves polymatrix games. Oper. Res. Lett. 10, 285\u2013290 (1991)","journal-title":"Oper. Res. Lett."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295 (1951)","DOI":"10.2307\/1969529"},{"key":"21_CR14","unstructured":"Nudelman, E., Wortman, J., Shoham, Y., Leyton-Brown, K.: Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms. In: International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), pp. 880\u2013887 (2004)"},{"key":"21_CR15","unstructured":"Ortiz, L.E., Kearns, M.: Nash propagation for loopy graphical games. In: Advances in Neural Information Processing Systems, pp. 817\u2013824 (2003)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1379759.1379762","volume":"55","author":"CH Papadimitriou","year":"2008","unstructured":"Papadimitriou, C.H., Roughgarden, T.: Computing correlated equilibria in multi-player games. J. ACM 55, 14\u201346 (2008)","journal-title":"J. ACM"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Simon, S., Wojtczak, D.: Constrained pure Nash equilibria in polymatrix games. In: Association for the Advancement of Artificial Intelligence (AAAI 2017), pp. 691\u2013697 (2017)","DOI":"10.1609\/aaai.v31i1.10599"},{"key":"21_CR18","unstructured":"Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior (1948)"},{"key":"21_CR19","unstructured":"Wahbi, M., Brown, K.N.: A distributed asynchronous solver for Nash equilibria in hypergraphical games. In: European Conference on Artificial Intelligence (ECAI 2016), pp. 1291\u20131299 (2016)"},{"key":"21_CR20","first-page":"381","volume":"8","author":"EB Yanovskaya","year":"1968","unstructured":"Yanovskaya, E.B.: Equilibrium points in polymatrix games. Litovskii Matematicheskii Sbornik 8, 381\u2013384 (1968)","journal-title":"Litovskii Matematicheskii Sbornik"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50146-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T21:03:20Z","timestamp":1666818200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50146-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501457","9783030501464"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50146-4_21","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"213","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The IPMU 2020 was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}