no code implementations • 26 Oct 2023 • Takehide Soh, Tomoya Tanjo, Yoshio Okamoto, Takehiro Ito
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2023.
no code implementations • 4 Aug 2022 • Takehide Soh, Yoshio Okamoto, Takehiro Ito
This paper collects all descriptions of solvers and ISR instances submitted to CoRe Challenge 2022.
no code implementations • 6 Jul 2022 • Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
We consider the problem of reforming an envy-free matching when each agent is assigned a single item.
no code implementations • 20 Nov 2020 • Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki
While such restrictions on the structure of constraint graphs do not seem to limit the expressiveness of NCL, the building blocks of the constraint graphs cannot be limited without losing expressiveness: We consider as parameters the number of weight-one edges and the number of weight-two edges of a constraint graph, as well as the number of \textsc{and}\xspace or \textsc{or}\xspace vertices of an \textsc{and/or}\xspace constraint graph.
Data Structures and Algorithms
