most citedA Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

cs.GT2013★ 2 cited

A Dynamic Programming Model for Determining Bidding Strategies in Sequential Auctions: Quasi-linear Utility and Budget Constraints

Hiromitsu Hattori, Makoto Yokoo, Yuko Sakurai +1

In this paper, we develop a new method for finding an optimal biddingstrategy in sequential auctions, using a dynamic programming technique. Theexisting method assumes that the uti…