14 citations · 37 across the 12 of their papers we have counts for
12 papers
Safe Subgame Resolving for Extensive Form Correlated Equilibrium
Chun Kai Ling, Fei Fang
Correlated Equilibrium is a solution concept that is more general than Nash Equilibrium (NE) and can lead to outcomes with better social welfare. However, its natural extension to…
Function Approximation for Solving Stackelberg Equilibrium in Large Perfect Information Games
Chun Kai Ling, J. Zico Kolter, Fei Fang
Function approximation (FA) has been a critical component in solving large zero-sum games. Yet, little attention has been given towards FA in solving \textit{general-sum} extensive…
Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment
Steven Jecmen, Nihar B. Shah, Fei Fang +1
Many conferences rely on paper bidding as a key component of their reviewer assignment procedure. These bids are then taken into account when assigning reviewers to help ensure tha…
A Dataset on Malicious Paper Bidding in Peer Review
Steven Jecmen, Minji Yoon, Vincent Conitzer +2
In conference peer review, reviewers are often asked to provide "bids" on each submitted paper that express their interest in reviewing that paper. A paper assignment algorithm the…
PerfectDou: Dominating DouDizhu with Perfect Information Distillation
Guan Yang, Minghuan Liu, Weijun Hong +4
As a challenging multi-player card game, DouDizhu has recently drawn much attention for analyzing competition and collaboration in imperfect-information games. In this paper, we pr…
Robust Reinforcement Learning as a Stackelberg Game via Adaptively-Regularized Adversarial Training
Peide Huang, Mengdi Xu, Fei Fang +1
Robust Reinforcement Learning (RL) focuses on improving performances under model errors or adversarial attacks, which facilitates the real-life deployment of RL agents. Robust Adve…
Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing
Hoon Oh, Yanhan Tang, Zong Zhang +2
Unlike commercial ridesharing, non-commercial peer-to-peer (P2P) ridesharing has been subject to limited research -- although it can promote viable solutions in non-urban communiti…
Temporal Induced Self-Play for Stochastic Bayesian Games
Weizhe Chen, Zihan Zhou, Yi Wu +1
One practical requirement in solving dynamic games is to ensure that the players play well from any decision point onward. To satisfy this requirement, existing efforts focus on eq…
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design
Steven Jecmen, Hanrui Zhang, Ryan Liu +3
Many scientific conferences employ a two-phase paper review process, where some papers are assigned additional reviewers after the initial reviews are submitted. Many conferences a…
Discovering Diverse Multi-Agent Strategic Behavior via Reward Randomization
Zhenggang Tang, Chao Yu, Boyuan Chen +6
We propose a simple, general and effective technique, Reward Randomization for discovering diverse strategic policies in complex multi-agent games. Combining reward randomization a…
Deep Archimedean Copulas
Chun Kai Ling, Fei Fang, J. Zico Kolter
A central problem in machine learning and statistics is to model joint densities of random variables from data. Copulas are joint cumulative distribution functions with uniform mar…
Signal Instructed Coordination in Cooperative Multi-agent Reinforcement Learning
Liheng Chen, Hongyi Guo, Yali Du +7
In many real-world problems, a team of agents need to collaborate to maximize the common reward. Although existing works formulate this problem into a centralized learning with dec…