{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:14Z","timestamp":1750306754252,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>We review recent research on frugality of mechanisms for the procurement of a spanning network. Frugality here is defined as the ratio of the maximum price that can be charged to the buyer in some equilibrium to the true minimal cost. Previous negative results are qualified under natural restrictions in costs.<\/jats:p>","DOI":"10.1145\/2509013.2509021","type":"journal-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T15:14:00Z","timestamp":1375370040000},"page":"49-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Back to original frugality"],"prefix":"10.1145","volume":"12","author":[{"given":"Rodrigo A.","family":"Velez","sequence":"first","affiliation":[{"name":"Texas A&amp;M University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"volume-title":"Proceedings, 42nd IEEE Symposium on the Foundations of Computer Science. 482--491","author":"Archer A.","key":"e_1_2_1_1_1"},{"volume-title":"Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '02","author":"Archer A.","key":"e_1_2_1_2_1"},{"volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '07","author":"Chen N.","key":"e_1_2_1_3_1"},{"volume-title":"Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms. SODA '04","author":"Elkind E.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.25"},{"key":"e_1_2_1_6_1","unstructured":"Moulin H. and Velez R. A. 2013. The price of imperfect competition for a spanning network. Games Econ. Behav.. doi 10.1016\/j.geb.2013.03.012.  Moulin H. and Velez R. A. 2013. The price of imperfect competition for a spanning network. Games Econ. Behav .. doi 10.1016\/j.geb.2013.03.012."},{"volume-title":"Eds","year":"2007","author":"Nisan N.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.696327"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509013.2509021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2509013.2509021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:34Z","timestamp":1750231714000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2509013.2509021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1145\/2509013.2509021"],"URL":"https:\/\/doi.org\/10.1145\/2509013.2509021","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}