Please see my new
homepage for updated information
|
Albert Xin Jiang
email: jiang at cs dot ubc dot ca, albertjiang at gmail
|
I completed my Ph.D. under Professor Kevin Leyton-Brown,
at the Laboratory of Computational Intelligence (LCI), Department of Computer Science, University of British Columbia.
After working as a post-doc in Professor Milind Tambe's TEAMCORE group at USC,
I have joined Trinity University as an assistant professor in computer
science.
Please check my new
homepage for updated information.
In this page you can find information on my research interests, publications, and software projects.
For more information please see my Curriculum Vitae.
Some recent news:
I am broadly interested in computational problems arising in economics (especially game theory and mechanism design).
The topic of my PhD thesis is on the
theoretical and practical aspects of the computation of game-theoretic solution concepts such as Nash equilibrium, Stackelberg equilibrium and correlated equilibrium.
My approach can roughly be divided into two streams:
- 1. Development of compact representations of game-theoretic models.
- This is motivated by the observation that while the standard representation of games as multi-dimensional tables is impractical due to the curse of dimensionality,
most real-world games of interest have structured utility functions.
I am involved in the development and analysis of Action-Graph Games (AGGs), a fully-expressive modeling language for representing simultaneous-move games.
When utility functions exhibit commonly-encountered structure such as context-specific independence, anonymity and additivity,
AGGs can
represent such games compactly, i.e. using small numbers of bits.
For a detailed introduction of AGGs, please see our paper in Games and Economic Behavior (joint work with Kevin Leyton-Brown and Navin Bhat).
Recently, we have extended the AGG framework to represent games of incomplete information (joint with Kevin Leyton-Brown) and dynamic games
(joint with
Kevin Leyton-Brown and Avi
Pfeffer).
For more information on AGGs and extensions, see the
AGG Project website.
- 2. Design and analysis of efficient algorithms for computing Nash and correlated equilibria given a compactly represented game.
- A common subproblem is the computation of expected utility given an arbitrary mixed-strategy profile. For AGGs and their extensions, we provide efficient algorithms
for this, and leverage these algorithms to achieve exponential speedups of existing algorithms for finding sample Nash equilibria.
Software implementations are available at the AGG Project website.
I am also interested in the problem of computing pure-strategy Nash equilibria for graphical game representations including AGGs and graphical games.
When the associated graphs have bounded treewidth,
techniques based on tree decomposition and dynamic programming are often applicable,
while for classes of graphs with unbounded treewidth it is possible to prove hardness results.
I am also interested in the computation of correlated equilibria and Stackelberg equilibira.
For more details please see my list of publications.
Theses
- A.X. Jiang, Representing and Reasoning with Large Games, PhD Thesis, University of British Columbia, December 2011.
Winner of the CAIAC Doctoral Dissertation Award for the best doctoral thesis in AI completed at a
Canadian university in 2011, and the runner-up IFAAMAS-11 Victor Lesser Distinguished Dissertation Award.
pdf | official link
- A.X. Jiang, Computational Problems in Multiagent Systems,
MSc Thesis, University of British Columbia, 2006.
pdf
Journal Articles
-
F. Fang, A.X. Jiang, M. Tambe. Optimal Patrol Strategy for Protecting Moving Targets with Multiple Mobile Resources. Accepted with minor revisions to JAIR, 2013.
- A.X. Jiang, K. Leyton-Brown, Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games. Games and Economic Behavior, 2013.
Preprint
Official journal paper: DOI: 10.1016/j.geb.2013.02.002
-
A.X. Jiang, K. Leyton-Brown and N. Bhat,
Action-Graph Games, Games and Economic Behavior, Volume 71, Issue 1, January 2011, Pages 141-173.
An earlier draft is available as
University of British Columbia
Technical Report TR-2008-13.
Preprint: pdf
Official journal paper: DOI 10.1016/j.geb.2010.10.012
Website for Action-Graph Games software
-
A.X. Jiang and K. Leyton-Brown, Bidding Agents for Online Auction Environments with Hidden Bids.
Special Issue on Learning & Computational Game Theory,
Machine Learning, Volume 67, Numbers 1-2, May, 2007.
An eariler version was presented at Workshop on Game-Theoretic and Decision-Theoretic Agents (GTDT) at IJCAI 2005, Edinburgh, Scotland.
Preprint: pdf
Official journal paper
Refereed Conference Proceedings
- Rong Yang, Albert Xin Jiang, Milind Tambe, Fernando Ordonez.
Scaling-up Security Games with Boundedly Rational Adversaries: A Cutting-plane Approach. To appear in IJCAI, 2013.
- Leandro Soriano Marcolino, Albert Xin Jiang, Milind Tambe. Multi-agent Team Formation - Diversity Beats Strength?. To appear in IJCAI, 2013.
- (Alphabetical)
Albert Xin Jiang, Ariel Procaccia, Yundi Qian, Nisarg Shah, Milind Tambe.
Defender (Mis)coordination in Security Games. To appear in IJCAI, 2013.
-
Eric Shieh, Manish Jain, Albert Xin Jiang, Milind Tambe.
Efficiently Solving Joint Activity Based Security Games. To appear in IJCAI, 2013.
-
A.X. Jiang, Z. Yin, C. Zhang, S. Kraus, M. Tambe.
Game-theoretic Randomization for Security Patrolling with Dynamic Execution Uncertainty.
To appear in AAMAS, 2013. nominee of Best Paper Award
-
F. Fang, A.X. Jiang, M. Tambe.
Optimal Patrol Strategy for Protecting Moving Targets with Multiple Mobile Resources.
To appear in AAMAS, 2013.
-
Z. Yin, A.X. Jiang, M.P. Johnson, M. Tambe, C. Kiekintveld, K. Leyton-Brown, T. Sandholm, J.P. Sullivan. TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit
Systems. IAAI, 2012. Invited to AI Magazine.
-
R. Yang, F. Fang, A.X. Jiang, K. Rajagopal, M. Tambe, R. Maheswaran.
Designing Better Strategies against Human Adversaries in Network Security Games: Extended Abstract.
AAMAS, 2012 (short paper).
-
A.X. Jiang, K. Leyton-Brown, A General Framework for Computing Optimal Correlated Equilibria in Compact Games.
WINE, 2011.
arXiv link
Slides for talk at WINE.
-
J. Garg, A.X. Jiang, R. Mehta, Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses.
WINE, 2011 (short paper).
arXiv link for the full paper.
- A.X. Jiang, K. Leyton-Brown, Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games.
ACM-EC, 2011. Co-winner of Best Student Paper award. Short version appeared in SIGecom Exchanges, volume 10, number 1, pages 6-8, 2011.
Extended version (submitted to Games and Economic Behavior): pdf
Conference version: pdf | ps | arXiv link | slides for
talk at EC
Short version: pdf
Talk at Workshop on Innovations in Algorithmic Game Theory, Hebrew University, Jerusalem: slides | video
-
A.X. Jiang and K. Leyton-Brown,
Bayesian Action-Graph Games.
NIPS, 2010.
Paper: pdf
Poster presented at NIPS 2010: pdf | Slides for talk at INFORMS 2011: pdf
Supplementary material: Proofs
Software: AGG/BAGG Solver
-
C. Ryan,
A.X. Jiang and K. Leyton-Brown,
Computing pure strategy Nash equilibria in symmetric games with a fixed number of actions.
ACM-EC, 2010.
pdf
Supplementary reading: A Tutorial on Rational Generating Functions
Slides for talk at EC
-
A.X. Jiang and M. Safari,
Pure Nash Equilibria: Complete Characterization of Hard and Easy
Graphical Games.
AAMAS, 2010.
pdf | ArXiv Link
Slides for talk at AAMAS
-
A.X. Jiang, K. Leyton-Brown and A. Pfeffer,
Temporal Action-Graph Games: A New Representation for Dynamic
Games,
UAI, 2009.
ps | pdf
Slides for talk at UAI
-
A.X. Jiang and K. Leyton-Brown,
Computing Pure Nash Equilibria in Symmetric Action Graph Games,
AAAI, 2007.
Slides from presentation at
AAAI-2007
Update: the version published in the AAAI-07 proceedings contains
a bug;
please see Chapter 4 of my PhD thesis
for the corrected version of this result.
-
A.X. Jiang and K. Leyton-Brown,
A Polynomial-Time algorithm for Action-Graph Games,
AAAI, 2006.
pdf
Slides from presentation at AAAI-2006
- A.X. Jiang and M. Buro, First Experimental Results of ProbCut Applied to Chess, Proceedings of the Advances in Computer Games Conference 10, Graz 2003
ps | pdf
Software: Multi-ProbCut version of Crafty
Workshops and Posters
-
Albert Xin Jiang, Zhengyu Yin, Matthew P. Johnson, Christopher Kiekintveld, Kevin Leyton-Brown, Tuomas Sandholm, Milind Tambe,
Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems,
AAAI Spring Symposium on Game Theory for Security, Sustainability and Health, 2012.
-
David R.M. Thompson, Albert Xin Jiang, Kevin Leyton-Brown,
Game-Theoretic Analysis of Network Quality-of-Service Pricing,
Student Poster, BCNET, 2007.
-
A.X. Jiang, K. Leyton-Brown and N. de Freitas,
N-Body Games.
NIPS Workshop on Game Theory, Machine Learning and Reasoning under Uncertainty,
2005.
pdf
Technical Reports
Other
-
J. Wright, A.X. Jiang and K. Leyton-Brown,
Linear solvers for nonlinear games: using pivoting algorithms to find Nash equilibria in n-player games,
SIGecom Exchanges, volume 10, number 1, 2011.
pdf
-
AGG Project: software tools for Action-Graph Games, a general
framework for game-theoretic modeling and analysis.
-
Crafty-MPC: a modified version of the chess-playing program
Crafty that uses the Multi-ProbCut algorithm. See the paper for more details.
Misc. Links
Invalid Techniques of Proof