@COMMENT This file was generated by bib2html.pl <http://www.cs.cmu.edu/~pfr/misc_software/index.html#bib2html> version 0.90
@COMMENT written by Patrick Riley <http://www.cs.cmu.edu/~pfr>
@COMMENT This file came from Peter Stone's publication pages at
@COMMENT http://www.cs.utexas.edu/~pstone/papers
@InCollection{AMEC04-tac,
        author="David Pardoe and Peter Stone",
        title="Bidding for Customer Orders in {TAC} {SCM}",
        booktitle="Agent Mediated Electronic Commerce {VI}:  Theories for and Engineering of Distributed Mechanisms and Systems (AMEC 2004)",
        editor="P.~Faratin and J.A.~Rodriguez-Aguilar",
        series="Lecture Notes in Artificial Intelligence",      
	volume="3435",
        Publisher="Springer Verlag",
        address="Berlin",
	pages="143--157",
        year="2005",
        abstract={
                  Supply chains are a current, challenging problem for
                  agent-based electronic commerce.  Motivated by the
                  Trading Agent Competition Supply Chain Management
                  (TAC SCM) scenario, we consider an individual supply
                  chain agent as having three major subtasks:
                  acquiring supplies, selling products, and managing
                  its local manufacturing process.  In this paper, we
                  focus on the sales subtask.  In particular, we
                  consider the problem of finding the set of bids to
                  customers in simultaneous reverse auctions that
                  maximizes the agent's expected profit.  The key
                  technical challenges we address are i) predicting
                  the probability that a customer will accept a
                  particular bid price, and ii) searching for the most
                  profitable set of bids.  We first compare several
                  machine learning approaches to estimating the
                  probability of bid acceptance.  We then present a
                  heuristic approach to searching for the optimal set
                  of bids.  Finally, we perform experiments in which
                  we apply our learning method and bidding method
                  during actual gameplay to measure the impact on
                  agent performance.
                 },
  wwwnote={Official version from <a href="http://dx.doi.org/10.1007/11575726_11">Publisher's Webpage</a>&copy Springer-Verlag},
}