{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:28Z","timestamp":1750307008472,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[],"published-print":{"date-parts":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229025","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"110-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimization with demand oracles"],"prefix":"10.1145","author":[{"given":"Ashwinkumar","family":"Badanidiyuru","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Dobzinski","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigal","family":"Oren","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"BADANIDIYURU A. DOBZINSKI S. FU H. KLEINBERG R. NISAN N. AND ROUGHGARDEN T. 2012. Sketching valuation functions. In SODA. 1025--1035. BADANIDIYURU A. DOBZINSKI S. FU H. KLEINBERG R. NISAN N. AND ROUGHGARDEN T. 2012. Sketching valuation functions. In SODA. 1025--1035.","key":"e_1_3_2_1_1_1","DOI":"10.1137\/1.9781611973099.81"},{"doi-asserted-by":"crossref","unstructured":"BADANIDIYURU A. DOBZINSKI S. AND OREN S. 2011. Optimization with demand oracles. CoRR abs\/1107.2869. BADANIDIYURU A. DOBZINSKI S. AND OREN S. 2011. Optimization with demand oracles. CoRR abs\/1107.2869.","key":"e_1_3_2_1_2_1","DOI":"10.1145\/2229012.2229025"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1386790.1386802"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/846241.846250"},{"doi-asserted-by":"crossref","unstructured":"BEI X. CHEN N. GRAVIN N. AND LU P. 2011. Budget feasible mechanism design via random sampling. CoRR abs\/1107.2994. BEI X. CHEN N. GRAVIN N. AND LU P. 2011. Budget feasible mechanism design via random sampling. CoRR abs\/1107.2994.","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2213977.2214020"},{"doi-asserted-by":"crossref","unstructured":"BEI X. CHEN N. GRAVIN N. AND LU P. 2012. Budget feasible mechanism design: From prior-free to bayesian. CoRR abs\/1203.4455. BEI X. CHEN N. GRAVIN N. AND LU P. 2012. Budget feasible mechanism design: From prior-free to bayesian. CoRR abs\/1203.4455.","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2213977.2214020"},{"doi-asserted-by":"crossref","unstructured":"BLUMROSEN L. AND NISAN N. 2007. Combinatorial Auctions (a survey). In \"Algorithmic Game Theory\" N. Nisan T. Roughgarden E. Tardos and V. Vazirani editors. BLUMROSEN L. AND NISAN N. 2007. Combinatorial Auctions (a survey). In \"Algorithmic Game Theory\" N. Nisan T. Roughgarden E. Tardos and V. Vazirani editors.","key":"e_1_3_2_1_7_1","DOI":"10.1017\/CBO9780511800481.013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1137\/050641181"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1993636.1993740"},{"doi-asserted-by":"crossref","unstructured":"CHEN N. GRAVIN N. AND LU P. 2011. On the approximability of budget feasible mechanisms. In SODA. 685--699. CHEN N. GRAVIN N. AND LU P. 2011. On the approximability of budget feasible mechanisms. In SODA. 685--699.","key":"e_1_3_2_1_10_1","DOI":"10.1137\/1.9781611973082.54"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1993636.1993656"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/1060590.1060681"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1132516.1132607"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1993574.1993615"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/1109557.1109675"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/285055.285059"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1132516.1132523"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/FOCS.2006.14"},{"volume-title":"Polyhedral Combinatorics","author":"FISHER M. L.","series-title":"Mathematical Programming Studies Series","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"crossref","unstructured":"GHARAN S. O. AND VONDR\u00c1K J. 2011. Submodular maximization by simulated annealing. In SODA. GHARAN S. O. AND VONDR\u00c1K J. 2011. Submodular maximization by simulated annealing. In SODA.","key":"e_1_3_2_1_20_1","DOI":"10.1137\/1.9781611973082.83"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1007\/11600930_10"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/S0020-0190(99)00031-9"},{"doi-asserted-by":"crossref","unstructured":"KULIK A. SHACHNAI H. AND TAMIR T. 2009. Maximizing submodular set functions subject to multiple linear constraints. In SODA. KULIK A. SHACHNAI H. AND TAMIR T. 2009. Maximizing submodular set functions subject to multiple linear constraints. In SODA.","key":"e_1_3_2_1_23_1","DOI":"10.1137\/1.9781611973068.60"},{"unstructured":"KULIK A. SHACHNAI H. AND TAMIR T. 2011. Approximations for monotone and non-monotone submodular maximization with knapsack constraints. CoRR abs\/1101.2940. KULIK A. SHACHNAI H. AND TAMIR T. 2011. Approximations for monotone and non-monotone submodular maximization with knapsack constraints. CoRR abs\/1101.2940.","key":"e_1_3_2_1_24_1"},{"unstructured":"LAHAIE S. CONSTANTIN F. AND PARKES D. C. 2005. More on the power of demand queries in combinatorial auctions: Learning atomic languages and handling incentives. In IJCAI. LAHAIE S. CONSTANTIN F. AND PARKES D. C. 2005. More on the power of demand queries in combinatorial auctions: Learning atomic languages and handling incentives. In IJCAI.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/SFCS.2005.76"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1536414.1536459"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/501158.501161"},{"doi-asserted-by":"crossref","unstructured":"NEMHAUSER G. L. AND WOLSEY L. A. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research 3 3 177--188. NEMHAUSER G. L. AND WOLSEY L. A. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research 3 3 177--188.","key":"e_1_3_2_1_29_1","DOI":"10.1287\/moor.3.3.177"},{"unstructured":"NISAN N. AND SEGAL I. 2005. Exponential communication inefficiency of demand queries. In TARK. NISAN N. AND SEGAL I. 2005. Exponential communication inefficiency of demand queries. In TARK.","key":"e_1_3_2_1_30_1"},{"doi-asserted-by":"crossref","unstructured":"SANDHOLM T. AND BOUTILIER C. 2006. Preference Elicitation in Combinatorial Auctions. In \"Combinatorial Auctions\" P. Cramton and Y. Shoham and R. Steinberg editors. SANDHOLM T. AND BOUTILIER C. 2006. Preference Elicitation in Combinatorial Auctions. In \"Combinatorial Auctions\" P. Cramton and Y. Shoham and R. Steinberg editors.","key":"e_1_3_2_1_31_1","DOI":"10.7551\/mitpress\/9780262033428.003.0011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1109\/FOCS.2010.78"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1016\/S0167-6377(03)00062-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/1374376.1374389"}],"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '12","name":"EC '12: ACM Conference on Electronic Commerce","location":"Valencia Spain"},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":34,"alternative-id":["10.1145\/2229012.2229025","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229025","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}