36 citations · 111 across the 22 of their papers we have counts for
25 papers
Almost free algebras: from the word problem to elimination of quantifiers
Yifan Jia, Heer Tern Koh, Bakh Khoussainov
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term eq…
Automatic constraint satisfaction problem
Andrei Bulatov, Xiaoyang Gong, Bakh Khoussainov +1
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of…
Two new algorithms for solving Müller games and their applications
Zihui Liang, Bakh Khoussainov, Mingyu Xiao
Müller games form a well-established class of games for model checking and verification. These games are played on directed graphs where Player 0 and Player 1 play by…
Connectivity in the presence of an opponent
Zihui Liang, Bakh Khoussainov, Toru Takisaka +1
The paper introduces two player connectivity games played on finite bipartite graphs. Algorithms that solve these connectivity games can be used as subroutines for solving Müller g…
Learning Density-Based Correlated Equilibria for Markov Games
Libo Zhang, Yang Chen, Toru Takisaka +3
Correlated Equilibrium (CE) is a well-established solution concept that captures coordination among agents and enjoys good algorithmic properties. In real-world multi-agent systems…
Differentially Private Diffusion Auction: The Single-unit Case
Fengjuan Jia, Mengxiao Zhang, Jiamou Liu +1
Diffusion auction refers to an emerging paradigm of online marketplace where an auctioneer utilises a social network to attract potential buyers. Diffusion auction poses significan…