Strong Equilibria in Bayesian Games with Bounded Group Size

We study the group strategic behaviors in Bayesian games. Equilibria in previous work do not consider group strategic behaviors with bounded sizes and are too "strong" to exist in many scenarios. We propose the ex-ante Bayesian 𝑘-strong equilibrium and the Bayesian 𝑘-strong equilibrium, where no group of at most 𝑘 agents can benefit from deviation. The two solution concepts differ in how agents calculate their utilities when contemplating whether a deviation is beneficial. Intuitively, agents are more conservative in the Bayesian 𝑘-strong equilibrium than in the ex-ante Bayesian 𝑘-strong equilibrium. With our solution concepts, we study collusion in the peer prediction mechanisms, as a representative of the Bayesian games with group strategic behaviors. We characterize the thresholds of the group size 𝑘 so that truthful reporting in the peer prediction mechanism is an equilibrium for each solution concept, respectively. Our solution concepts can serve as criteria to evaluate the robustness of a peer prediction mechanism against collusion. Besides the peer prediction problem, we also discuss two other potential applications of our new solution concepts, voting and Blotto games, where introducing bounded group sizes provides more fine-grained insights into the behavior of strategic agents. CCS Concepts • Theory of computation → Solution concepts in game theory; Algorithmic mechanism design; Algorithmic game theory.