Demo Data from EDBT 2026 / reviewers in the wild / expert
Rong Yang 0001
dblp:53/4040-1
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0001-8837-0089ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Algorithmic game theory and mechanism design · 85% Mathematical optimization · 15% | |
| Artificial intelligence
3 papers |
Multi-agent systems · 100% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
bounded rationality |
0.3 | 2 | 2013 | Analyzing the Effectiveness of Adversary Modeling in Security Games · AAAI 2013 Improving Resource Allocation Strategy against Human Adversaries in Security Games · IJCAI 2011 |
Algorithmic game theory and mechanism design › security games
stackelberg security games |
0.3 | 2 | 2013 | Analyzing the Effectiveness of Adversary Modeling in Security Games · AAAI 2013 Improving Resource Allocation Strategy against Human Adversaries in Security Games · IJCAI 2011 |
Knowledge, reasoning and agents › Multi-agent systems
security games |
0.2 | 1 | 2013 | Improving resource allocation strategies against human adversaries in security games: An extended study · Artif. Intell. 2013 |
Algorithmic game theory and mechanism design › security games
adversary modeling |
0.2 | 1 | 2013 | Analyzing the Effectiveness of Adversary Modeling in Security Games · AAAI 2013 |
Mathematical optimization › integer programming
cutting planes |
0.2 | 1 | 2013 | Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach · IJCAI 2013 |
Algorithmic game theory and mechanism design
security games |
0.2 | 1 | 2013 | Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach · IJCAI 2013 |
Knowledge, reasoning and agents › Multi-agent systems › security games
stackelberg security games |
0.1 | 1 | 2012 | PROTECT: An Application of Computational Game Theory for the Security of the Ports of the United States · AAAI 2012 |
Knowledge, reasoning and agents › Multi-agent systems
bounded rationality |
0.0 | 1 | 2013 | Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach · IJCAI 2013 |
Methods — techniques the papers use, named apart from their topics
game theory · 0.3bounded rationality · 0.3subjective utility function · 0.2robust optimization · 0.2human behavior model · 0.2cutting-plane · 0.2cutting planes · 0.2stackelberg game model · 0.1quantal response model · 0.1quantal-response equilibrium · 0.1prospect theory · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Analyzing the Effectiveness of Adversary Modeling in Security GamesabstractRecent deployments of Stackelberg security games (SSG) have led to two competing approaches to handle boundedly rational human adversaries: (1) integrating models of human (adversary) decision-making into the game-theoretic algorithms, and (2) applying robust optimization techniques that avoid adversary modeling. A recent algorithm (MATCH) based on the second approach was shown to outperform the leading modeling-based algorithm even in the presence of significant amount of data. Is there then any value in using human behavior models in solving SSGs? Through extensive experiments with 547 human subjects playing 11102 games in total, we emphatically answer the question in the affirmative, while providing the following key contributions: (i) we show that our algorithm, SU-BRQR, based on a novel integration of human behavior model with the subjective utility function, significantly outperforms both MATCH and its improvements; (ii) we are the first to present experimental results with security intelligence experts, and find that even though the experts are more rational than the Amazon Turk workers, SU-BRQR still outperforms an approach assuming perfect rationality (and to a more limited extent MATCH); (iii) we show the advantage of SU-BRQR in a new, large game setting and demonstrate that sufficient data enables it to improve its performance over MATCH. Thanh Hong Nguyen, Rong Yang 0001, Amos Azaria, Sarit Kraus, Milind Tambe |
AAAI | 2 |
| 2013 | Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach
Rong Yang 0001, Albert Xin Jiang, Milind Tambe, Fernando Ordóñez |
IJCAI | 1 |
| 2013 | Improving resource allocation strategies against human adversaries in security games: An extended study
Rong Yang 0001, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe, Richard John |
Artif. Intell. | 1 |
| 2012 | PROTECT: An Application of Computational Game Theory for the Security of the Ports of the United StatesabstractBuilding upon previous security applications of computational game theory, this paper presents PROTECT, a game-theoretic system deployed by the United States Coast Guard (USCG) in the port of Boston for scheduling their patrols. USCG has termed the deployment of PROTECT in Boston a success, and efforts are underway to test it in the port of New York, with the potential for nationwide deployment. PROTECT is premised on an attacker-defender Stackelberg game model and offers five key innovations. First, this system is a departure from the assumption of perfect adversary rationality noted in previous work, relying instead on a quantal response (QR) model of the adversary's behavior - to the best of our knowledge, this is the first real-world deployment of the QR model. Second, to improve PROTECT's efficiency, we generate a compact representation of the defender's strategy space, exploiting equivalence and dominance. Third, we show how to practically model a real maritime patrolling problem as a Stackelberg game. Fourth, our experimental results illustrate that PROTECT's QR model more robustly handles real-world uncertainties than a perfect rationality model. Finally, in evaluating PROTECT, this paper provides real-world data: (i) comparison of human-generated vs PROTECT security schedules, and (ii) results from an Adversarial Perspective Team's (human mock attackers) analysis. Eric Anyung Shieh, Bo An 0001, Rong Yang 0001, Milind Tambe, Craig Baldwin, Joseph DiRenzo, Ben Maule, Garrett Meyer |
AAAI | 3 |
| 2011 | Improving Resource Allocation Strategy against Human Adversaries in Security GamesabstractRecent real-world deployments of Stackelberg se-curity games make it critical that we address hu-man adversaries ’ bounded rationality in comput-ing optimal strategies. To that end, this paper provides three key contributions: (i) new efficient algorithms for computing optimal strategic solu-tions using Prospect Theory and Quantal Response Equilibrium; (ii) the most comprehensive experi-ment to date studying the effectiveness of different models against human subjects for security games; and (iii) new techniques for generating representa-tive payoff structures for behavioral experiments in generic classes of games. Our results with human subjects show that our new techniques outperform the leading contender for modeling human behav-ior in security games. 1 Rong Yang 0001, Christopher Kiekintveld, Fernando Ordóñez, Milind Tambe, Richard John |
IJCAI | 1 |