## 抄録

In this paper, we develop a new method for finding an optimal bidding strategy in sequential auctions, using a dynamic programming technique. The existing method assumes the utility of a user is represented in an additive form. Thus, the remaining endowment of money must be explicitly represented in each state. On the other hand, our method assumes the utility of a user can be represented in a quasi-linear form, and representing the payment as a state-transition cost. Accordingly, we can obtain more than an m-fold speed-up in the computation time, where m is the initial endowment of money. Furthermore, we have developed a method for obtaining a semi-optimal bidding strategy under budget constraints.

本文言語 | 英語 |
---|---|

ホスト出版物のタイトル | Proceedings of the International Conference on Autonomous Agents |

編集者 | J.P. Muller, E. Andre, S. Sen, C. Frasson |

ページ | 83-84 |

ページ数 | 2 |

出版ステータス | 出版済み - 2001 |

外部発表 | はい |

イベント | Fifth International Conference on Autonomous Agents - Montreal, Que., カナダ 継続期間: 5月 28 2001 → 6月 1 2001 |

### その他

その他 | Fifth International Conference on Autonomous Agents |
---|---|

国/地域 | カナダ |

City | Montreal, Que. |

Period | 5/28/01 → 6/1/01 |

## !!!All Science Journal Classification (ASJC) codes

- 工学（全般）