Efficient algorithms are developed to compute optimal audit policies in multi-agent principal-agent games where agents adversarially select equilibria to minimize the principal's utility.
Learning strategy-aware linear classifiers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimally Auditing Adversarial Agents
Efficient algorithms are developed to compute optimal audit policies in multi-agent principal-agent games where agents adversarially select equilibria to minimize the principal's utility.