Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents. Echenique, F. & Wierman, A. In Proceedings of the 13th ACM Conference on Electronic Commerce, of EC '12, pages 495–495, New York, NY, USA, 2012. ACM.
Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents [link]Paper  doi  bibtex   
@inproceedings{Echenique:2012:FWE:2229012.2229049,
 author = {Echenique, Federico and Wierman, Adam},
 title = {Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents},
 booktitle = {Proceedings of the 13th ACM Conference on Electronic Commerce},
 series = {EC '12},
 year = {2012},
 isbn = {978-1-4503-1415-2},
 location = {Valencia, Spain},
 pages = {495--495},
 numpages = {1},
 url = {http://doi.acm.org/10.1145/2229012.2229049},
 doi = {10.1145/2229012.2229049},
 acmid = {2229049},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {computational complexity, fisher equilibria, walrasian equilibria},
}
Downloads: 0