activity
20022026
most citedComplexity Results about Nash Equilibria

218 citations · 1k across the 50 of their papers we have counts for

collaborators

57 papers

cs.GT2026

Open problem: Computing Bayes-Nash equilibrium in simple security games

Vincent Conitzer

This is an open problem originally posed during the program "Economics and Computation" held in the Fall 2015 semester at the Simons Institute for the Theory of Computing. It asks…

cs.GT2026

Open problem: Computing the optimal deterministic budget-balanced mechanism

Vincent Conitzer

This is an open problem originally posed during the program "Economics and Computation" held in the Fall 2015 semester at the Simons Institute for the Theory of Computing. It asks…

cs.GT2024

Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation

Hanrui Zhang, Yu Cheng, Vincent Conitzer

We study equilibrium computation with extensive-form correlation in two-player turn-taking stochastic games. Our main results are two-fold: (1) We give an algorithm for computing a…

cs.HC2023

Testing for Reviewer Anchoring in Peer Review: A Randomized Controlled Trial

Ryan Liu, Steven Jecmen, Vincent Conitzer +2

Peer review frequently follows a process where reviewers first provide initial reviews, authors respond to these reviews, then reviewers update their reviews based on the authors'…

cs.AI2023★ 2 cited

A Theory of Bounded Inductive Rationality

Caspar Oesterheld, Abram Demski, Vincent Conitzer

The dominant theories of rational choice assume logical omniscience. That is, they assume that when facing a decision problem, an agent can perform all relevant computations and de…

cs.GT2023

Computing Optimal Equilibria and Mechanisms via Learning in Zero-Sum Extensive-Form Games

Brian Hu Zhang, Gabriele Farina, Ioannis Anagnostides +7

We introduce a new approach for computing optimal equilibria via learning in games. It applies to extensive-form settings with any number of players, including mechanism design, in…