REVIEW 1 cited by
Computing Best-Response Strategies in Infinite Games of Incomplete Information
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We describe an algorithm for computing best response strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents' types and actions, conditional on linear comparisons of agents' actions. We show that this class includes many well-known games including a variety of auctions and a novel allocation game. In some cases, the best-response algorithm can be iterated to compute Bayes-Nash equilibria. We demonstrate the efficiency of our approach on existing and new games.
Forward citations
Cited by 1 Pith paper
-
Best Response Convergence for Zero-sum Stochastic Dynamic Games with Partial and Asymmetric Information
Best response dynamics in partially observed zero-sum linear quadratic games converge numerically after a few iterations, and low-order belief feedback strategies approximate the Nash equilibrium.
Discussion (0). Continue with ORCID to comment.