<h1>Wierman, Adam</h1>
<h2>Working Paper from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Barman, Siddharth and Bhaskar, Umang, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160321-140122265">The Complexity of Nash Equilibria as Revealed by Data</a>; <a href="https://doi.org/10.48550/arXiv.1311.2655">10.48550/arXiv.1311.2655</a></li>
<li>Echenique, Federico and Wierman, Adam (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170727-110237088">Finding a Walrasian equilibrium is easy for a fixed number of agents</a>; <a href="https://doi.org/10.7907/wwxc6-hbb24">10.7907/wwxc6-hbb24</a></li>
<li>Echenique, Federico and Golovin, Daniel, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100928-150942227">A Revealed Preference Approach to Computational Complexity in Economics</a>; <a href="https://doi.org/10.7907/cm0gg-20z31">10.7907/cm0gg-20z31</a></li>
</ul>