Zobrazeno 1 - 10
of 281
pro vyhledávání: '"Makoto Yokoo"'
Publikováno v:
PLoS ONE, Vol 19, Iss 2, p e0289965 (2024)
We identify a new class of distributional constraints defined as a union of symmetric M-convex sets, which can represent a wide range of real-life constraints in two-sided matching settings. Since M-convexity is not closed under union, a union of sym
Externí odkaz:
https://doaj.org/article/9e66652e633f407183ea486f7f5f2bc1
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:12308-12316
Two-sided matching is an important research area that has had a major impact on the design of real-world matching markets. One consistent feature in many of the real-world applications is that they impose new feasibility constraints that lead to rese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7a9189ae2a468e2753307fcbe38cf2c
https://doi.org/10.1609/aaai.v36i11.21495
https://doi.org/10.1609/aaai.v36i11.21495
Publikováno v:
Journal of Artificial Intelligence Research. 74:179-225
The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool for modeling multi-agent coordination problems. To solve DCOPs in a dynamic environment, Dynamic DCOPs (D-DCOPs) have been proposed to model the inherent dynamism p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::427842ee27f9de3473ef5ed724dc10ef
https://doi.org/10.1613/jair.1.13499
https://doi.org/10.1613/jair.1.13499
Publikováno v:
Constraints. 27:99-115
A Clique Partitioning Problem (CPP) finds an optimal partition of a given edge-weighted undirected graph, such that the sum of the weights is maximized. This general graph problem has a wide range of real-world applications, including correlation clu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9dc58ceaf696062b852bf229d3cf587
https://doi.org/10.1007/s10601-022-09326-z
https://doi.org/10.1007/s10601-022-09326-z
Publikováno v:
PRIMA 2022: Principles and Practice of Multi-Agent Systems ISBN: 9783031212024
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e6525be34b68a76e7e522bbe27f4a7f
https://doi.org/10.1007/978-3-031-21203-1_9
https://doi.org/10.1007/978-3-031-21203-1_9
Publikováno v:
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.
A new paradigm of mechanism design, called mechanism design over social networks, investigates agents’ incentives to diffuse the information of mechanisms to their followers over social networks. In this paper we consider it for two-sided matching,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f4b92503283c3f583fa8a4167698b68
https://doi.org/10.24963/ijcai.2022/27
https://doi.org/10.24963/ijcai.2022/27
Publikováno v:
Artificial Intelligence. 316:103855
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87b9c06249e5a3468f965a9f2f39132a
https://doi.org/10.1016/j.artint.2023.103855
https://doi.org/10.1016/j.artint.2023.103855
Publikováno v:
Autonomous Agents and Multi-Agent Systems. 36
In many real-life scenarios, a group of agents needs to agree on a common action, e.g., on a location for a public facility, while there is some consistency between their preferences, e.g., all preferences are derived from a common metric space. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::849b816405b2c848f99cc6f75e06c601
https://doi.org/10.1007/s10458-021-09535-5
https://doi.org/10.1007/s10458-021-09535-5
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31a58d77a1bd6651e29625a47f0d481a
https://doi.org/10.2139/ssrn.4116234
https://doi.org/10.2139/ssrn.4116234
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031208614
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f188b5c2bdd7c76a260dc433d8c5d057
https://doi.org/10.1007/978-3-031-20862-1_2
https://doi.org/10.1007/978-3-031-20862-1_2