ACM Home Page
Please provide us with feedback. Feedback
Risk-averse auction agents
Full text PdfPdf (217 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the second international joint conference on Autonomous agents and multiagent systems table of contents
Melbourne, Australia
SESSION: Auctions table of contents
Pages: 353 - 360  
Year of Publication: 2003
ISBN:1-58113-683-8
Authors
Yaxin Liu  Georgia Tech, Atlanta, GA
Richard Goodwin  IBM T.J. Watson, Yorktown Heights, NY
Sven Koenig  Georgia Tech, Atlanta, GA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 62,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/860575.860632
What is a DOI?

ABSTRACT

Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are part of complete supply-chain management systems and have to make the same decisions as their human counterparts. To address this issue, we generalize results from auction theory in three ways. First, auction theory provides the optimal bidding function for the case where auction agents want to maximize the expected profit. Since companies are often risk-averse, we derive a closed form of the optimal bidding function for auction agents that maximize the expected utility of the profit for concave exponential utility functions. Second, auction theory often assumes that auction agents know the bidder's valuation of an auctioned item. However, the valuation depends on how the item can be used in the production process. We therefore develop theoretical results that enable us to integrate our auction agents into production-planning systems to derive the bidder's valuation automatically. Third, auction theory often assumes that the probability distribution over the competitors' valuations of the auctioned item is known. We use simulations of the combined auction- and production-planning system to obtain crude approximations of these probability distributions automatically. The resulting auction agents are part of a complete supply-chain management system and seamlessly combine ideas from auction theory, utility theory, and dynamic programming.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
R. Bartle and D. Sherbert. Introduction to Real Analysis. John Wiley and Sons, third edition, 1999.
 
2
 
3
J. Benoît and V. Krishna. Multiple-object auctions with budget constrained bidders. Review of Economic Studies, 68(1):155--179, 2001.
 
4
D. Bernoulli. Specimen theoriae novae de mensura sortis. Commentarii Academiae Scientiarum Imperialis Petropolitanae, 5, 1738. Translated by L. Sommer, Econometrica, 22: 23--36, 1954.
 
5
 
6
S. Campo, E. Guerre, I. Perrigne, and Q. Vuong. Semiparametric estimation of first-price auctions with risk averse bidders. submitted to: Econometrica, 2003.
 
7
S. Hon-Snir, D. Monderer, and A. Sela. A learning approach to auctions. Journal of Economic Theory, 82:65--88, 1998.
 
8
R. Howard. Dynamic Programming and Markov Processes. MIT Press, third edition, 1964.
 
9
R. Howard and J. Matheson. Risk-sensitive Markov decision processes. Management Science, 18(7):356--369, 1972.
 
10
S. Koenig and Y. Liu. Representations of decision-theoretic planning tasks. In Proceedings of the International Conference on Artificial Intelligence Planning Systems, pages 187--195, 2000.
 
11
S. Koenig and R. Simmons. How to make reactive planners risk-sensitive. In Proceedings of the International Conference on Artificial Intelligence Planning Systems, pages 293--298, 1994.
 
12
E. Maskin and J. Riley. Optimal auctions with risk averse buyers. Econometrica, 52(6):1473--1518, 1984.
 
13
R. P. McAfee and J. McMillan. Auctions and bidding. Journal of Economic Literature, 25:699--738, 1987.
 
14
 
15
J. Pratt. Risk aversion in the small and in the large. Econometrica, 32(1-2):122--136, 1964.
 
16
J. von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, second edition, 1947.
 
17
S. Watson and D. Buede. Decision Synthesis. Cambridge University Press, 1987.


Collaborative Colleagues:
Yaxin Liu: colleagues
Richard Goodwin: colleagues
Sven Koenig: colleagues