| DOI | Trouver le DOI : https://doi.org/10.1007/978-3-540-24840-8_32 |
|---|
| Auteur | Rechercher : Buffett, Scott1; Rechercher : Grant, Alastair2 |
|---|
| Affiliation | - Conseil national de recherches du Canada. Technologies de l'information et des communications
- Conseil national de recherches du Canada. Institut de technologie de l'information du CNRC
|
|---|
| Format | Texte, Chapitre de livre |
|---|
| Conférence | 17th Conference of the Canadian Society for Computational Studies of Intelligence, May 17-19, 2004, London, Ontario, Canada |
|---|
| Résumé | This paper presents an algorithm for decision-making where the buyer needs to procure one of possibly many bundles of complementary products, and items are sold individually in multiple open ascending-price (English) auctions. Auctions have fixed start and end times, and some may run concurrently. Expected utility of a bidding choice is computed by considering expected utility of choices at future decisions. The problem is modeled as a Markov decision process, and dynamic programming is used to determine the value of bidding/not bidding in each state. Three techniques for reducing the state space are given. Results show that a bidding agent using this algorithm achieves significantly higher utility on average when compared with one that does not consider the value of future choices. |
|---|
| Date de publication | 2004-01-01 |
|---|
| Maison d’édition | Springer Berlin Heidelberg |
|---|
| Dans | |
|---|
| Série | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 23000092 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 0efb30e1-7e34-4682-99a5-50e5b0e4633a |
|---|
| Enregistrement créé | 2016-06-02 |
|---|
| Enregistrement modifié | 2020-06-12 |
|---|
