|
|
|
|
|
|
|
|
|
|
Welcome
to Jing Chen¡¯s Homepage! |
|||
|
|
|
Jing
is Chief Scientist and Head of Theory Research at Algorand Inc. Her research interests include
game theory, mechanism design, distributed ledgers, smart contracts, and
algorithms. She is an affiliated faculty in the Computer Science Department at Stony Brook University. She is also
affiliated with the Economics
Department and the Center for Game
Theory in Economics. Before joining Algorand, she was an assistant professor
in Computer Science at Stony Brook. She received the NSF CAREER Award in
2016. Jing
received her Bachelor¡¯s and Master¡¯s degrees in
Computer Science from Tsinghua University, and her PhD in Computer Science
from MIT. Her Master¡¯s advisor was Professor Dongsheng
Wang and her PhD¡¯s advisor was Professor Silvio Micali. She was a postdoc fellow in the School of Mathematics at the Institute for Advanced Study. |
|
||
|
|
|
|
|
||
|
|
|||||
Contact:
jingchen at cs dot stonybrook dot
edu
Students:
Bo Li, PhD 2019. Assistant Professor, Hong Kong
Polytechnic University.
Shikha Singh, PhD 2018, co-advised with Michael Bender.
Assistant Professor, Williams College.
Hau Chan, PhD 2015, co-advised with Luis Ortiz and Leman Akoglu. Assistant Professor, University of
Nebraska-Lincoln.
Gowtham Srinivasan, Master 2016. Samsung Research America.
Saksham Chand, Master 2015. Apple Inc.
Selected
Professional Services:
Associate Editor, ACM Transactions on Economics
and Computation (TEAC), 2021-present.
Standing Committee, CSIAM Activity Group on
Financial Technology and Algorithms, 2021-present
Chair/Co-Chair:
¡¤
Game Theory in
Blockchain Track, 3rd International Joint Conference on Theoretical Computer
Science (IJTCS), 2022;
¡¤
Workshop on Distributed
Ledger and Economics, 32nd International Conference on Game Theory, 2021;
¡¤
Game Theory in
Blockchain Track, 2nd International Joint Conference on Theoretical Computer
Science (IJTCS), 2021;
¡¤
Workshop on Game Theory
in Blockchain, 16th Conference on Web and Internet Economics (WINE), 2020;
¡¤
Track on Blockchains,
1st International Joint Conference on Theoretical Computer Science (IJTCS), 2020;
¡¤
Workshop on Game Theory
in Blockchain, 11th International Symposium on Algorithmic Game Theory (SAGT),
2018.
Advisory Board, IEEE Conference on Blockchain
Research & Applications for Innovative Networks and Services (BRAINS),
2020-present.
Co-Editor, SIAM Journal on Computing (SICOMP),
special issue on STOC 2016.
Program Committee:
¡¤
4th International
Workshop on Formal Methods for Blockchains (FMBC), 2022;
¡¤
4th Distributed Ledger
Technology Workshop (DLT), 2022;
¡¤
26th International
Conference on Financial Cryptography and Data Security (FC), 2022;
¡¤
14th International
Symposium on Algorithmic Game Theory (SAGT), 2021;
¡¤
3rd International
Conference on Blockchain Economics, Security and Protocols, 2021;
¡¤
16th Conference on Web
and Internet Economics (WINE), 2020;
¡¤
11th International
Symposium on Algorithmic Game Theory (SAGT), 2018;
¡¤
9th Innovations in Theoretical
Computer Science (ITCS), 2018;
¡¤
13th Latin American
Theoretical Informatics Symposium (LATIN), 2018;
¡¤
13th Conference on Web
and Internet Economics (WINE), 2017;
¡¤
16th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS, senior PC), 2017;
¡¤
48th Annual Symposium
on the Theory of Computing (STOC), 2016;
¡¤
14th, 15th, 17th, 18th
ACM Conference on Electronic Commerce (EC), 2013, 2014, 2016, 2017.
Local Organizer:
¡¤
Workshop on Stopping
Time Problems in Game Theory, Economics and Finance, 29th International
Conference on Game Theory, 2018.
¡¤
Workshop on Adaptive
Learning: Theory, Data, and Applications, 28th International Conference on Game
Theory, 2017.
¡¤
Workshop on Complex
Auctions and Practice, 27th International Conference on Game Theory, 2016.
Faculty advisor, Women in Computer Science (WiCS) at Stony Brook (an official ACM-W chapter),
2015-2018.
Faculty advisor, Graduate Women in Science and
Engineering (GWISE), Stony Brook University, 2017-2018.
Faculty representative of Stony Brook Computer
Science Department at National Center for Women & Information Technology
(NCWIT), 2015-2018.
Directing Committee, CS Honors Program, Stony
Brook University, 2016-2018.
Courses:
CSE548/AMS542
Analysis of Algorithms, Spring 2018
CSE
385 Analysis of Algorithms: Honors, Fall 2017
CSE548/AMS542
Analysis of Algorithms, Spring 2017
CSE540
Theory of Computation, Fall 2016
CSE540 Theory of Computation, Fall 2015
CSE547/AMS547 Discrete Mathematics, Spring 2015
CSE540 Theory of
Computation, Fall 2014
CSE691/ECO606
Computational Game Theory, Spring 2014
CSE540 Theory of
Computation, Fall 2013
|
|
Papers:
Journals
1.
Bayesian
Auctions with Efficient Queries
J. Chen, B. Li, Y. Li, and P.
Lu
Journal of Artificial
Intelligence (AIJ), Vol. 303, Article
103630, February 2022.
D. Baek,
J. Chen, B. J. Choi
IEEE Internet of Things
Journal, Vol. 7, Iss.
1, pp. 349 ¨C 362, 2020.
3.
Algorand:
A secure and efficient distributed ledger
J. Chen and S. Micali
Theoretical Computer
Science (TCS), Vol. 777, pp. 155-183, 2019.
4.
Efficient
Approximations for the Online Dispersion Problem
J. Chen, B. Li, and Y. Li
SIAM Journal on
Computing (SICOMP), Vol. 48, No. 2, pp.
373¨C416, 2019.
Y. Gao, J. Chen, T. Robertazzi, and K. A. Brown
Physical Review
Accelerators and Beams (PRAB),
Vol. 22, Iss. 1, Article 014601, 2019.
6.
Provision-After-Wait
with Common Preferences
H. Chan, J. Chen, and G.
Srinivasan
Transactions on Economics and Computation (TEAC), Vol. 5, Iss. 2, Article 12,
2017.
7.
Leveraging
Possibilistic Beliefs in Unrestricted Combinatorial Auctions
J. Chen and S. Micali
Games, Special Issue on
Epistemic Game Theory and Logic, Vol. 7, Iss. 32,
2016.
8.
Optimal
Provision-After-Wait in Healthcare
M. Braverman, J. Chen, and S.
Kannan
Mathematics of Operations Research (MOR), Vol. 41, No. 1, pp. 352 - 376, 2016.
9.
Tight
Revenue Bounds with Possibilistic Beliefs and Level-k Rationality (with the Supplement
available here)
J. Chen, S. Micali,
and R. Pass
Econometrica,
Vol. 83, No. 4, pp. 1619-1639, 2015.
10.
Mechanism
Design with Possibilistic Beliefs
J. Chen and S. Micali
Journal
of Economic Theory (JET), Vol. 156, pp. 77-102,
2015.
11.
The
Robustness of Zero-Determinant Strategies in Iterated Prisoner's Dilemma Games
J. Chen and A. Zinger
Journal
of Theoretical Biology (JTB),
Vol. 357, pp. 46-54, 2014.
12.
The
Order Independence of Iterated Dominance in Extensive Games
J. Chen and S. Micali
Theoretical
Economics (TE), Vol. 8, pp. 125-163, 2013.
13.
Collusive
Dominant-Strategy Truthfulness
J. Chen and S. Micali
Journal of Economic Theory (JET), Vol. 147, Iss. 3, pp.
1300-1312, 2012.
14.
A
New Framework to the Design and Analysis of Identity-Based Identification
Schemes
G. Yang, J. Chen, D. Wong, X.
Deng, and D. Wang
Theoretical Computer Science (TCS), Vol. 407, Iss. 1-3, pp.
370-388, 2008.
15.
A Buffer Management Policy in IA-64 Large-Scale Video
Streaming Servers (in Chinese)
H. Yu, J. Chen, Y. Li, and W.
Zheng
J. Computer Research and Development, Vol. 43, Iss. 4, pp. 729-737,
2006.
16.
High Performance Architecture for Elliptic Curve Scalar
Multiplication Based on FPGA (in Chinese)
J. Chen, J. Jiang, D. Wong, X.
Deng, and D. Wang
J. Computer Research and Development, Vol. 45, Iss. 11, pp.
1947-1954, 2008.
Refereed Conferences
17. Maximal
Information Propagation via Lotteries
J.
Chen and B. Li
17th Conference on Web and Internet Economics (WINE), 2021.
18. Non-Cooperative
Rational Interactive Proofs
J.
Chen, S. McCauley and Shikha Singh
27th Annual European Symposium on Algorithms (ESA), pp. 29:1-29:16, 2019.
19. Towards
a Verified Model of the Algorand Consensus Protocol in Coq
M.
A. Alturki, J. Chen, V. Luchangco,
B. Moore, K. Palmskog, L. Peña and G. Roşu
1st Workshop on Formal Methods for Blockchains (FMBC), 2019.
20. Maximin-Aware
Allocations of Indivisible Goods
H.
Chan, J. Chen, B. Li and X. Wu
28th International Joint Conference on Artificial Intelligence (IJCAI), 2019. Extended abstract at
AAMAS 2019.
21. Approximately
Maximizing the Broker¡¯s Profit in a Two-sided Market
J.
Chen, B. Li and Y. Li
28th International Joint Conference on Artificial Intelligence (IJCAI), 2019.
22. Information
Elicitation for Bayesian Auctions
J. Chen,
B. Li, and Y. Li
11th International Symposium on Algorithmic Game Theory (SAGT), pp. 43-55, 2018.
23. Efficient
Rational Proofs with Strong Utility-Gap Guarantees
J.
Chen, S. McCauley, and S. Singh
11th International Symposium on Algorithmic Game Theory (SAGT), pp. 150-162, 2018.
24. Bayesian
Auctions with Efficient Queries
J.
Chen, B. Li, Y. Li and P. Lu
International Colloquium on Automata, Languages and Programming (ICALP), 108:1-108:4, 2018.
Y.
Gao, J. Chen, T. Robertazzi, and K. A. Brown
16th International Conference on Accelerator and Large Experimental
Physics Control Systems (ICALEPCS), 2017.
26. Efficient
Approximations for the Online Dispersion Problem
J. Chen, B. Li, and Y. Li
International Colloquium on Automata, Languages and
Programming (ICALP), pp. 11:1-11:15, 2017.
27. Provision-After-Wait
with Common Preferences
H. Chan and J. Chen
15th International
Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 278-286, 2016.
28. Budget
Feasible Mechanisms for Dealers
H. Chan and J. Chen
15th
International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 113-121, 2016.
29.
Rational Proofs
with Multiple Provers
J. Chen, S. McCauley, and S.
Singh
7th Innovations in Theoretical Computer Science (ITCS), pp. 237-248, 2016.
Presented at the 26th
International Conference on Game Theory, 2015.
30.
Auction
Revenue in the General Spiteful-Utility Model
J. Chen and S. Micali
7th Innovations in Theoretical Computer Science (ITCS), pp. 201-211, 2016.
Presented at the 11th World
Congress of the Econometric Society (ESWC), 2015.
31.
Better Outcomes
from More Rationality
J. Chen, S. Micali,
and R. Pass
6th
Innovations in Theoretical Computer Science (ITCS), pp. 325-325, 2015.
32.
Truthful
Multi-unit Procurements with Budgets
H. Chan and J. Chen
10th
Conference on Web and Internet Economics (WINE), pp. 89-105, 2014.
33.
Optimal
Provision-After-Wait in Healthcare
M. Braverman, J. Chen, and S. Kannan
Innovations
in Theoretical Computer Science (ITCS),
pp. 541-542, 2014.
34.
Crowdsourced
Bayesian Auctions
P. Azar, J. Chen, and S. Micali
Innovations in Theoretical Computer Science (ITCS), pp. 236-248, 2012.
35.
Mechanism
Design with Set-Theoretic Beliefs
J. Chen and S. Micali
Symposium on Foundations of Computer Science (FOCS), pp. 87-96, 2011.
36.
Robust
Perfect Revenue from Perfectly Informed Players
J. Chen, A. Hassidim, and S. Micali
Innovations in Theoretical Computer Science (ITCS), pp. 94-105, 2010.
37.
Robustly
Leveraging Collusion in Combinatorial Auctions
J. Chen, S. Micali, and P. Valiant
Innovations in Theoretical Computer Science (ITCS), pp. 81-93, 2010.
38.
A
New Approach to Auctions and Resilient Mechanism Design
J. Chen and S. Micali
Symposium on Theory of Computing (STOC), pp. 503-512, 2009.
39.
A
More Natural Way to Construct Identity-Based Identification Schemes
G. Yang, J. Chen, D. Wong, X.
Deng, and D. Wang
Applied Cryptography and Network Security (ACNS), pp. 307-322, 2007.
40.
Malicious
KGC Attack in Certificateless Cryptography
M. H. Au, J. Chen, J. K. Liu,
Y. Mu, D. Wong, and G. Yang
ACM Symposium on Information, Computer and Communications
Security (ASIACCS), pp. 302-311, 2007.
Technical Reports
S. Micali,
N. Choucri, J. Chen, and C. Williams
MIT Political Science Department Research Paper No. 2013-30, 2013.
P. Azar, J. Chen, and S. Micali
Brazilian Workshop of the Game Theory Society (São Paulo), poster, 2010.
43.
Short
Multi-Prover Quantum Proofs for SAT without Entangled Measurements
J. Chen and A. Drucker
arXiv:1011.0716v2,
2010.
|
|