{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T09:41:22Z","timestamp":1768556482390,"version":"3.49.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0020-0190(00)00073-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:37:09Z","timestamp":1027629429000},"page":"29-34","source":"Crossref","is-referenced-by-count":15,"title":["Constrained multi-object auctions and -matching"],"prefix":"10.1016","volume":"75","author":[{"given":"Michal","family":"Penn","sequence":"first","affiliation":[]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00073-9_ID003","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","article-title":"A polynomial algorithm for b -matching: An alternative approach","volume":"Vol. 24","author":"Anstee","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00073-9_ID004","series-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0020-0190(00)00073-9_ID005","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.12.1.97","article-title":"Linear systems for constrained matching problems","volume":"Vol. 12","author":"Cook","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(00)00073-9_ID006","doi-asserted-by":"crossref","DOI":"10.1111\/j.1430-9134.1995.00267.x","article-title":"Money out of thin air: The nationwide narrowband pcs auction","author":"Cramton","year":"1995","journal-title":"J. Econom. Management Strategy"},{"key":"10.1016\/S0020-0190(00)00073-9_ID007","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","article-title":"A primal algorithm for optimum matching","volume":"Vol. 8","author":"Cunningham","year":"1978","journal-title":"Math. Programming Study"},{"key":"10.1016\/S0020-0190(00)00073-9_ID008","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches","author":"Fujishima","year":"1999"},{"key":"10.1016\/S0020-0190(00)00073-9_ID009","first-page":"699","article-title":"Auctions and bidding","volume":"Vol. 25","author":"McAfee","year":"1987","journal-title":"J. Econom. Literature"},{"key":"10.1016\/S0020-0190(00)00073-9_ID010","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1257\/jep.8.3.145","article-title":"Selling spectrum rights","volume":"Vol. 8","author":"McMillan","year":"1994","journal-title":"J. Econom. Perspectives"},{"key":"10.1016\/S0020-0190(00)00073-9_ID011","series-title":"Putting auction theory to work: The simultaneous ascending auction","author":"Milgrom","year":"1998"},{"key":"10.1016\/S0020-0190(00)00073-9_ID012","series-title":"Advances in Economic Theory: Fifth World Congress","article-title":"Auction theory","author":"Milgrom","year":"1987"},{"key":"10.1016\/S0020-0190(00)00073-9_ID013","series-title":"Facets of matching polyhedra","author":"Pulleyblank","year":"1973"},{"issue":"8","key":"10.1016\/S0020-0190(00)00073-9_ID014","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinatorial auctions","volume":"Vol. 44","author":"Rothkhof","year":"1998","journal-title":"Management Sci."},{"key":"10.1016\/S0020-0190(00)00073-9_ID015","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"An algorithm for optimal winner determination in combinatorial auctions","author":"Sandholm","year":"1999"},{"issue":"4","key":"10.1016\/S0020-0190(00)00073-9_ID016","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1111\/j.1467-6419.1996.tb00018.x","article-title":"Auctions: An introduction","volume":"Vol. 10","author":"Wolfstetter","year":"1996","journal-title":"J. Econom. Surveys"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T07:22:42Z","timestamp":1555831362000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0020019000000739"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00073-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}