Pablo Azar

Orcid: 0000-0001-9156-2428

Affiliations:
  • Department of Computer Science, MIT


According to our database1, Pablo Azar authored at least 11 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Prior independent mechanisms via prophet inequalities with limited information.
Games Econ. Behav., 2019

2015
How to Incentivize Data-Driven Collaboration Among Competing Parties.
IACR Cryptol. ePrint Arch., 2015

2014
Super-efficient rational proofs.
PhD thesis, 2014

The Query Complexity of Scoring Rules.
ACM Trans. Economics and Comput., 2014

Prophet Inequalities with Limited Information.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Optimal and Efficient Parametric Auctions.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Super-efficient rational proofs.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Parametric digital auctions.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Rational proofs.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Crowdsourced Bayesian auctions.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Crowdsourced Bayesian Auctions - (Abstract).
Proceedings of the Auctions, Market Mechanisms, and Their Applications, 2011


  Loading...