Saved in:
Bibliographic Details
Main Authors: Han, Qishen, Schoenebeck, Grant, Tao, Biaoshuai, Xia, Lirong
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2502.00260
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909471909871616
author Han, Qishen
Schoenebeck, Grant
Tao, Biaoshuai
Xia, Lirong
author_facet Han, Qishen
Schoenebeck, Grant
Tao, Biaoshuai
Xia, Lirong
contents 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 $k$-strong equilibrium and the Bayesian $k$-strong equilibrium, where no group of at most $k$ 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 $k$-strong equilibrium than in the ex-ante Bayesian $k$-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 $k$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2502_00260
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Strong Equilibria in Bayesian Games with Bounded Group Size
Han, Qishen
Schoenebeck, Grant
Tao, Biaoshuai
Xia, Lirong
Computer Science and Game Theory
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 $k$-strong equilibrium and the Bayesian $k$-strong equilibrium, where no group of at most $k$ 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 $k$-strong equilibrium than in the ex-ante Bayesian $k$-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 $k$ 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.
title Strong Equilibria in Bayesian Games with Bounded Group Size
topic Computer Science and Game Theory
url https://arxiv.org/abs/2502.00260