{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:46:32Z","timestamp":1768560392757,"version":"3.49.0"},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2004,2,12]],"date-time":"2004-02-12T00:00:00Z","timestamp":1076544000000},"content-version":"unspecified","delay-in-days":195,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2003,8]]},"abstract":"<jats:p>In this paper we are interested in the decision problem faced by an \nagent when requesting bids for collections of tasks with complex time \nconstraints and interdependencies. In particular, we study the problem \nof specifying an appropriate schedule for the tasks in the request for \nbids. We expect bids to require resource commitments, so we expect \ndifferent settings of time windows to solicit different bids and \ndifferent costs. The agent is interested in soliciting \n\u201cdesirable\u201d bids, where desirable means bids that can be \nfeasibly combined in a low-cost combination that covers the entire \ncollection of tasks. Since the request for bids has to be issued before \nthe agent can see any bids, in this decision process there is a \nprobability of loss as well as a probability of gain. This requires the \ndecision process to deal with the risk posture of the person or \norganization on whose behalf the agent is acting. We describe a model \nbased on Expected Utility Theory and show how an agent can attempt to \nmaximize its profits while managing its financial risk exposure. We \nillustrate the operation and properties of the model and discuss what \nassumptions are required for its successful integration in multiagent \ncontracting applications.<\/jats:p>","DOI":"10.1017\/s0890060403173027","type":"journal-article","created":{"date-parts":[[2004,1,22]],"date-time":"2004-01-22T22:12:04Z","timestamp":1074809524000},"page":"173-186","source":"Crossref","is-referenced-by-count":6,"title":["Asking the right question: Risk and expectation in multiagent \ncontracting"],"prefix":"10.1017","volume":"17","author":[{"given":"ALEXANDER","family":"BABANOV","sequence":"first","affiliation":[]},{"given":"JOHN","family":"COLLINS","sequence":"additional","affiliation":[]},{"given":"MARIA","family":"GINI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2004,2,12]]},"reference":[{"key":"S0890060403173027_ref041","doi-asserted-by":"publisher","DOI":"10.1006\/game.2000.0822"},{"key":"S0890060403173027_ref027","unstructured":"Reeves, C.R. (1993).Modern Heuristic Techniques for Combinatorial Problems.New York:Wiley."},{"key":"S0890060403173027_ref011","unstructured":"Fujishima, Y. , Leyton\u2013Brown, K. , & Shoham, Y. (1999).Taming the computational complexity of combinatorial auctions:Optimal and approximate approaches.Proc. 16th Int. Joint Conf. Artificial Intelligence, pp.548\u2013553."},{"key":"S0890060403173027_ref006","doi-asserted-by":"publisher","DOI":"10.1109\/4236.914649"},{"key":"S0890060403173027_ref022","unstructured":"McAfee, R. & McMillan, P.J. (1987).Auctions and bidding.Journal of Economic Literature 25,699\u2013738."},{"key":"S0890060403173027_ref010","doi-asserted-by":"publisher","DOI":"10.1126\/science.8346439"},{"key":"S0890060403173027_ref026","doi-asserted-by":"publisher","DOI":"10.2307\/1913738"},{"key":"S0890060403173027_ref032","unstructured":"Sandholm, T. (1999).An algorithm for winner determination in combinatorial auctions.Proc. 16th Int. Joint Conf. Artificial Intelligence, pp.524\u2013547."},{"key":"S0890060403173027_ref023","unstructured":"Nelson, R.R. (1995).Recent evolutionary theorizing about economic change.Journal of Economic Literature 33(1),48\u201390."},{"key":"S0890060403173027_ref029","unstructured":"Rode, D. (1997).Market efficiency, decision processes, and evolutionary games.Carnegie Mellon University."},{"key":"S0890060403173027_ref018","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352879"},{"key":"S0890060403173027_ref014","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888998002082"},{"key":"S0890060403173027_ref025","doi-asserted-by":"crossref","unstructured":"Parkes, D.C. & Ungar, L.H. (2001).An auction-based method for decentralized train scheduling.Proc. Fifth Int. Conf. Autonomous Agents, pp.43\u201350,Montreal. New York:ACM.","DOI":"10.1145\/375735.375866"},{"key":"S0890060403173027_ref016","doi-asserted-by":"publisher","DOI":"10.1086\/262127"},{"key":"S0890060403173027_ref004","unstructured":"Babanov, A. , Ketter, W. , & Gini, M. (2002).An evolutionary framework for large-scale experimentation inmulti-agent systems. InToward an Application Science: MAS Problem Spaces and TheirImplications to Achieving Globally Coherent Behavior.Bologna, Italy."},{"key":"S0890060403173027_ref009","unstructured":"Dutta, P.S. , Sen, S. , & Mukherjee, R. (2001).Scheduling to be competitive in supply chains.IJCAI workshop on E-Business and the Intelligent Web."},{"key":"S0890060403173027_ref007","doi-asserted-by":"publisher","DOI":"10.1080\/10864415.2002.11044260"},{"key":"S0890060403173027_ref001","unstructured":"Axelrod, R. (1997).The Complexity of Cooperation.Princeton, NJ:Princeton University Press."},{"key":"S0890060403173027_ref036","doi-asserted-by":"publisher","DOI":"10.1007\/BF03325096"},{"key":"S0890060403173027_ref002","unstructured":"Axelrod, R.M. (1984).The Evolution of Cooperation.New York:Basic Books."},{"key":"S0890060403173027_ref017","unstructured":"Kjenstad, D. (1998).Coordinated supply chain scheduling.PhD Thesis.Norwegian University of Science and Technology."},{"key":"S0890060403173027_ref042","doi-asserted-by":"publisher","DOI":"10.1145\/280765.280847"},{"key":"S0890060403173027_ref034","unstructured":"Sandholm, T. , Suri, S. , Gilpin, A. , & Levine, D. (2001).CABOB: A fast optimal algorithm for combinatorial auctions.Proc. 17th Int. Joint Conf. Artificial Intelligence,Seattle, WA, pp.1102\u20131108."},{"key":"S0890060403173027_ref030","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.8.1131"},{"key":"S0890060403173027_ref008","unstructured":"Dias, M.B. & Stentz, A. (2000).A free market architecture for distributed control of a multirobotsystem.Sixth Int. Conf. Intelligent Autonomous Systems, pp.115\u2013122,Venice, Italy."},{"key":"S0890060403173027_ref003","unstructured":"Babanov, A. , Collins, J. , & Gini, M. (2002).Risk and expectations in a-priori time allocation in multi-agentcontracting.Proc. First Int. Conf. Autonomous Agents and Multi-Agent Systems,vol. 1, pp.53\u201360,Bologna, Italy."},{"key":"S0890060403173027_ref035","unstructured":"Sandholm, T.W. (1996).Negotiation Among Self-Interested Computationally Limited Agents.PhD Thesis.University of Massachusetts,Amherst."},{"key":"S0890060403173027_ref015","doi-asserted-by":"publisher","DOI":"10.1109\/ICMAS.2000.858447"},{"key":"S0890060403173027_ref037","doi-asserted-by":"publisher","DOI":"10.1086\/261443"},{"key":"S0890060403173027_ref019","doi-asserted-by":"publisher","DOI":"10.1257\/jep.1.1.121"},{"key":"S0890060403173027_ref040","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352900"},{"key":"S0890060403173027_ref039","unstructured":"Tesfatsion, L. (2001).Agent-Based Computational Economics: Growing Economies from theBottom Up.ISU Economics Working Paper No. 1.Ames, IA:Iowa State University."},{"key":"S0890060403173027_ref021","unstructured":"Mas\u2013Colell, A. , Whinston, M.D. , & Green, J.R. (1995).Microeconomic Theory.New York:Oxford University Press."},{"key":"S0890060403173027_ref024","unstructured":"Nisan, N. (1999).Bidding and allocation in combinatorial auctions.Proc. ACM Conf. Electronic Commerce (EC'00), pp.1\u201312,Minneapolis, MN. New York:ACM."},{"key":"S0890060403173027_ref038","unstructured":"Sycara, K. , Decker, K. , & Williamson, M. (1997).Middle-agents for the Internet.Proc. 15th Joint Conf. Artificial Intelligence, pp.578\u2013583."},{"key":"S0890060403173027_ref005","unstructured":"Collins, J. (2002).Solving combinatorial auctions with temporal constraints in economicagents.PhD Thesis.University of Minnesota."},{"key":"S0890060403173027_ref028","doi-asserted-by":"publisher","DOI":"10.1145\/375735.375867"},{"key":"S0890060403173027_ref013","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337010"},{"key":"S0890060403173027_ref012","doi-asserted-by":"publisher","DOI":"10.1145\/336595.337385"},{"key":"S0890060403173027_ref020","unstructured":"Machina, M.J. (1989).Dynamic consistency and non-expected utility models of choice underuncertainty.The Journal of Economic Literature 27(4),1622\u20131668."},{"key":"S0890060403173027_ref031","unstructured":"Sadeh, N.M. , Hildum, D.W. , Kjenstad, D. , & Tseng, A. (1999).MASCOT: An agent-based architecture for coordinatedmixed-initiative supply chain planning and scheduling.Workshop on Agent-Based Decision Support in Managing theInternet-Enabled Supply-Chain, Agents '99, pp.133\u2013138."},{"key":"S0890060403173027_ref033","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9236(99)00066-4"}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0890060403173027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T18:54:15Z","timestamp":1553885655000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0890060403173027\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0890060403173027"],"URL":"https:\/\/doi.org\/10.1017\/s0890060403173027","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}