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]](https://bibbase.org/img/filetypes/link.svg "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
{"_id":"8Qxn3urvCmvGhXKpT","bibbaseid":"echenique-wierman-findingawalrasianequilibriumiseasyforafixednumberofagents-2012","downloads":0,"creationDate":"2016-02-19T18:50:00.661Z","title":"Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents","author_short":["Echenique, F.","Wierman, A."],"year":2012,"bibtype":"inproceedings","biburl":"https://eml.berkeley.edu/~fechenique/published/mypapers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Echenique"],"firstnames":["Federico"],"suffixes":[]},{"propositions":[],"lastnames":["Wierman"],"firstnames":["Adam"],"suffixes":[]}],"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","bibtex":"@inproceedings{Echenique:2012:FWE:2229012.2229049,\n author = {Echenique, Federico and Wierman, Adam},\n title = {Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents},\n booktitle = {Proceedings of the 13th ACM Conference on Electronic Commerce},\n series = {EC '12},\n year = {2012},\n isbn = {978-1-4503-1415-2},\n location = {Valencia, Spain},\n pages = {495--495},\n numpages = {1},\n url = {http://doi.acm.org/10.1145/2229012.2229049},\n doi = {10.1145/2229012.2229049},\n acmid = {2229049},\n publisher = {ACM},\n address = {New York, NY, USA},\n keywords = {computational complexity, fisher equilibria, walrasian equilibria},\n} \n\n","author_short":["Echenique, F.","Wierman, A."],"key":"Echenique:2012:FWE:2229012.2229049","id":"Echenique:2012:FWE:2229012.2229049","bibbaseid":"echenique-wierman-findingawalrasianequilibriumiseasyforafixednumberofagents-2012","role":"author","urls":{"Paper":"http://doi.acm.org/10.1145/2229012.2229049"},"keyword":["computational complexity","fisher equilibria","walrasian equilibria"],"metadata":{"authorlinks":{"echenique, f":"https://eml.berkeley.edu/~fechenique/published/bibbase.html"}},"downloads":0},"search_terms":["finding","walrasian","equilibrium","easy","fixed","number","agents","echenique","wierman"],"keywords":["computational complexity","fisher equilibria","walrasian equilibria"],"authorIDs":["i39LhdHN5E3rfDEaM"],"dataSources":["QvSpo9DvXshxLJYpA","NesumKLbtRXQcLeeG"]}