@inproceedings{Chen:2003,
author = {Chen, Jinbo and Bugacov, Ro and Szekely, Pedro and Frank, Martin and Cai, Min and Kim, Donghan and Neches, Robert},
title = {{Coordinated Aggressive Bidding in Distributed}},
booktitle = {In Proceedings of the AAMAS 2003 Workshop on Representations and Approaches for Time-critical Decentralized Resource/Role/Task Allocation},
year = {2003},
address = {Melbourne , Australia},
month = jul,
annote = {Jinbo Chen (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Ro Bugacov (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Pedro Szekely (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Martin Frank (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Min Cai (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Donghan Kim (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Robert Neches (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292);},
language = {English},
rating = {0},
date-added = {2013-01-18T02:06:42GMT},
date-modified = {2013-05-02T16:22:57GMT},
abstract = {Large NP-hard combinatorial resource allocation problems are best solved via approximation techniques which produce acceptable solutions in the time available. The best of such "good-enough/soon-enough" techniques handle large problems, run in distributed environments, adapt rapidly to changes to the problem while solving, and exhibit good anytime performance.},
Urlpaper = {http://www.isi.edu/~szekely/contents/papers/2003/aamas2003marbles-workshop-resource-allocation.pdf},
uri = {\url{papers2://publication/uuid/B291C0F3-77EF-40A8-AFA5-C0D73EE8BDD2}}
}

{"_id":{"_str":"5342276aecd21cdc07000808"},"__v":22,"authorIDs":["5456fbd98b01c819300000dc","5457d2042abc8e9f3700078f","54586077b43425b772000019","5467199cbc7d6a460d000b72","547e574ba29145d03f000992","7x83pdAZCjgDXS4pB","WY8dCWsDcxhomeQyJ"],"author_short":["Chen, J.","Bugacov, R.","Szekely, P.","Frank, M.","Cai, M.","Kim, D.","Neches, R."],"bibbaseid":"chen-bugacov-szekely-frank-cai-kim-neches-coordinatedaggressivebiddingindistributed-2003","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Chen"],"firstnames":["Jinbo"],"suffixes":[]},{"propositions":[],"lastnames":["Bugacov"],"firstnames":["Ro"],"suffixes":[]},{"propositions":[],"lastnames":["Szekely"],"firstnames":["Pedro"],"suffixes":[]},{"propositions":[],"lastnames":["Frank"],"firstnames":["Martin"],"suffixes":[]},{"propositions":[],"lastnames":["Cai"],"firstnames":["Min"],"suffixes":[]},{"propositions":[],"lastnames":["Kim"],"firstnames":["Donghan"],"suffixes":[]},{"propositions":[],"lastnames":["Neches"],"firstnames":["Robert"],"suffixes":[]}],"title":"Coordinated Aggressive Bidding in Distributed","booktitle":"In Proceedings of the AAMAS 2003 Workshop on Representations and Approaches for Time-critical Decentralized Resource/Role/Task Allocation","year":"2003","address":"Melbourne , Australia","month":"July","annote":"Jinbo Chen (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Ro Bugacov (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Pedro Szekely (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Martin Frank (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Min Cai (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Donghan Kim (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Robert Neches (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292);","language":"English","rating":"0","date-added":"2013-01-18T02:06:42GMT","date-modified":"2013-05-02T16:22:57GMT","abstract":"Large NP-hard combinatorial resource allocation problems are best solved via approximation techniques which produce acceptable solutions in the time available. The best of such \"good-enough/soon-enough\" techniques handle large problems, run in distributed environments, adapt rapidly to changes to the problem while solving, and exhibit good anytime performance.","urlpaper":"http://www.isi.edu/~szekely/contents/papers/2003/aamas2003marbles-workshop-resource-allocation.pdf","uri":"˘rlpapers2://publication/uuid/B291C0F3-77EF-40A8-AFA5-C0D73EE8BDD2","bibtex":"@inproceedings{Chen:2003,\nauthor = {Chen, Jinbo and Bugacov, Ro and Szekely, Pedro and Frank, Martin and Cai, Min and Kim, Donghan and Neches, Robert},\ntitle = {{Coordinated Aggressive Bidding in Distributed}},\nbooktitle = {In Proceedings of the AAMAS 2003 Workshop on Representations and Approaches for Time-critical Decentralized Resource/Role/Task Allocation},\nyear = {2003},\naddress = {Melbourne , Australia},\nmonth = jul,\nannote = {Jinbo Chen (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Ro Bugacov (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Pedro Szekely (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Martin Frank (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Min Cai (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Donghan Kim (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292); Robert Neches (USC/Information Sciences Institute; 4676 Admiralty Way; Marina del Rey , CA 90292);},\nlanguage = {English},\nrating = {0},\ndate-added = {2013-01-18T02:06:42GMT},\ndate-modified = {2013-05-02T16:22:57GMT},\nabstract = {Large NP-hard combinatorial resource allocation problems are best solved via approximation techniques which produce acceptable solutions in the time available. The best of such \"good-enough/soon-enough\" techniques handle large problems, run in distributed environments, adapt rapidly to changes to the problem while solving, and exhibit good anytime performance.},\nUrlpaper = {http://www.isi.edu/~szekely/contents/papers/2003/aamas2003marbles-workshop-resource-allocation.pdf},\nuri = {\\url{papers2://publication/uuid/B291C0F3-77EF-40A8-AFA5-C0D73EE8BDD2}}\n}\n\n","author_short":["Chen, J.","Bugacov, R.","Szekely, P.","Frank, M.","Cai, M.","Kim, D.","Neches, R."],"key":"Chen:2003","id":"Chen:2003","bibbaseid":"chen-bugacov-szekely-frank-cai-kim-neches-coordinatedaggressivebiddingindistributed-2003","role":"author","urls":{"Paper":"http://www.isi.edu/~szekely/contents/papers/2003/aamas2003marbles-workshop-resource-allocation.pdf"},"metadata":{"authorlinks":{"szekely, p":"https://usc-isi-i2.github.io/"}}},"bibtype":"inproceedings","biburl":"www.isi.edu/~szekely/contents/szekely_bib.bib","downloads":0,"keywords":[],"search_terms":["coordinated","aggressive","bidding","distributed","chen","bugacov","szekely","frank","cai","kim","neches"],"title":"Coordinated Aggressive Bidding in Distributed","year":2003,"dataSources":["kJHZJNqDYzzxrNuWu","GJE8gKYhoBxt3N5EG","28D8KWKqxPjuRtpxg","iRgLxj3RQ2AXvJN9t"]}