Publications

Composable Byzantine Agreements with Reorder Attacks. In 7th Conference on Advances in Financial Technologies (AFT), Vol. 354, pp. 13:1-13:23, 2025.
Less-Excludable Mechanism for DAOs in Public Good Auctions. In IJTCS-FAW, pp. 207–221, 2025.
Bayesian Auctions with Efficient Queries. In Journal of Artificial Intelligence (AIJ), Vol. 303, 103630, 2022.
Maximal Information Propagation via Lotteries. In 17th Conference on Web and Internet Economics (WINE), pp. 486-503, 2021.
Small Profits and Quick Returns: An Incentive Mechanism Design for Crowdsourcing under Continuous Platform Competition. In IEEE Internet of Things Journal, Vol. 7, No. 1, pp. 349-362, 2020.
Towards a Verified Model of the Algorand Consensus Protocol in Coq. In 1st Workshop on Formal Methods for Blockchains (FMBC), 2019.
Non-Cooperative Rational Interactive Proofs. In 27th Annual European Symposium on Algorithms (ESA), pp. 29:1-29:16, 2019.
Maximin-Aware Allocations of Indivisible Goods. In 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 137–143, 2019. Extended abstract appeared at AAMAS, 2019.
Approximately Maximizing the Broker’s Profit in a Two-sided Market. In 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 151–157, 2019.
Algorand: A secure and efficient distributed ledger. In Theoretical Computer Science (TCS), Vol. 777, pp. 155-183, 2019.
Efficient Approximations for the Online Dispersion Problem. In SIAM Journal on Computing (SICOMP), Vol. 48, No. 2, pp. 373–416, 2019.
Reinforcement Learning based Schemes to Manage Client Activities in Large Distributed Control Systems. In Physical Review Accelerators and Beams (PRAB), Vol. 22, Iss. 1, Article 014601, 2019.
Information Elicitation for Bayesian Auctions. In 11th International Symposium on Algorithmic Game Theory (SAGT), pp. 43-55, 2018.
Efficient Rational Proofs with Strong Utility-Gap Guarantees. In 11th International Symposium on Algorithmic Game Theory (SAGT), pp. 150-162, 2018.
Bayesian Auctions with Efficient Queries. In International Colloquium on Automata, Languages and Programming (ICALP), 108:1-108:4, 2018.
A success-history based learning procedure to optimize server throughput in large distributed control systems. In 16th International Conference on Accelerator and Large Experimental Physics Control Systems (ICALEPCS), 2017.
Efficient Approximations for the Online Dispersion Problem. In 44th International Colloquium on Automata, Languages and Programming (ICALP), 11:1-11:15, 2017.
Provision-After-Wait with Common Preferences. In Transactions on Economics and Computation (TEAC), Vol. 5, Iss. 2, Article 12, 2017.
Leveraging Possibilistic Beliefs in Unrestricted Combinatorial Auctions. Special Issue on Epistemic Game Theory and Logic, Vol. 7, Iss. 32, 2016.
Rational Proofs with Multiple Provers. In 7th Innovations in Theoretical Computer Science (ITCS), pp. 237-248, 2016.
Auction Revenue in the General Spiteful-Utility Model. In 7th Innovations in Theoretical Computer Science (ITCS), pp. 201-211, 2016.
Optimal Provision-After-Wait in Healthcare. In Mathematics of Operations Research (MOR), Vol. 41, Iss. 1, pp. 352-376, 2016.
Budget Feasible Mechanisms for Dealers. In 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 113-122, 2016.
Provision-After-Wait with Common Preferences. In 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 278-286, 2016. Presented at the 26th International Conference on Game Theory, 2015.
Tight Revenue Bounds with Possibilistic Beliefs and Level-k Rationality. In Econometrica, Vol. 83, No. 4, pp. 1619-1639, 2015.
Mechanism Design with Possibilistic Beliefs. In Journal of Economic Theory (JET), invited to the special issue dedicated to the interface between Economics and Computer Science, Vol. 156, pp. 77-102, 2015.
Better Outcomes from More Rationality. In 6th Innovations in Theoretical Computer Science (ITCS), pp. 325-325, 2015.
Truthful Multi-unit Procurements with Budgets. In 10th Conference on Web and Internet Economics (WINE), pp. 89-105, 2014.
The Robustness of Zero-Determinant Strategies in Iterated Prisoner's Dilemma Games. In Journal of Theoretical Biology (JTB), Vol. 357, pp. 46–54, 2014.
Optimal Provision-After-Wait in Healthcare. In 5th Innovations in Theoretical Computer Science (ITCS), pp. 541-542, 2014.
The Order Independence of Iterated Dominance in Extensive Games. In Theoretical Economics (TE), Vol. 8, pp. 125-163, 2013.
Collusive Dominant-Strategy Truthfulness. In Journal of Economic Theory (JET), Vol. 147, Iss. 3, pp. 1300-1312, 2012.
Crowdsourced Bayesian Auctions. In 3rd Innovations in Theoretical Computer Science (ITCS), pp. 236-248, 2012.
Mechanism Design with Set-Theoretic Beliefs. In 52nd Foundations of Computer Science (FOCS), pp. 87-96, 2011.
Robustly Leveraging Collusion in Combinatorial Auctions. In 1st Innovations in Theoretical Computer Science (ITCS), pp. 81-93, 2010.
Robust Perfect Revenue from Perfectly Informed Players. In 1st Innovations in Theoretical Computer Science (ITCS), pp. 94-105, 2010.
A New Approach to Auctions and Resilient Mechanism Design. In 41st Symposium on Theory of Computing (STOC), pp. 503-512, 2009.
A New Framework to the Design and Analysis of Identity-Based Identification Schemes. In Theoretical Computer Science (TCS), Vol. 407, Iss. 1-3, pp. 370-388, 2008.
A More Natural Way to Construct Identity-Based Identification Schemes. In Applied Cryptography and Network Security (ACNS), pp. 307-322, 2007.
Malicious KGC Attack in Certificateless Cryptography. In 2nd Symposium on Information, Computer and Communications Security (ASIACCS), pp. 302-311, 2007.