Multi-object auctions: sequential vs. simultaneous sales
Management Science
Computationally feasible bounds for partially observed Markov decision processes
Operations Research
Market-based control: a paradigm for distributed resource allocation
Market-based control: a paradigm for distributed resource allocation
Computationally Manageable Combinational Auctions
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Sequential auctions for the allocation of resources with complementarities
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A heuristic variable grid solution method for POMDPs
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Decision procedures for multiple auctions
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
A Dynamic Programming Model for Algorithm Design in Simultaneous Auctions
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
A Comparison among Bidding Algorithms for Multiple Auctions
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Efficient Monte Carlo decision tree solution in dynamic purchasing environments
ICEC '03 Proceedings of the 5th international conference on Electronic commerce
Considering expected utility of future bidding options in bundle purchasing with multiple auctions
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
A Decision Procedure for Bundle Purchasing with Incomplete Information on Future Prices
International Journal of Electronic Commerce
Heuristic Bidding Strategies for Multiple Heterogeneous Auctions
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Fast planning in stochastic games
UAI'00 Proceedings of the Sixteenth conference on Uncertainty in artificial intelligence
Solving hybrid markov decision processes
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
A markov model for inventory level optimization in supply-chain management
AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
Repeated auctions with complementarities
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
Proximity-based non-uniform abstractions for approximate planning
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and multiagent decision problems. When agents value resources in combination rather than in isolation. they must often deliberate about appropriate bidding strategies for a sequence of auctions offering resources of interest. We briefly describe a discrete dynamic programming model for constructing appropriate bidding policies for resources exhibiting both complementarities substitutability. We then introduce a continuous approximation of this model, assuming that money (or the numeraire good) is infinitely divisible. Though this has the potential to reduce the computational cost of computing policies, value functions in the transformed problem do not have a convenient closed form representation. We develop grid-based approximations for such value functions, representing value functions using piecewise linear approximations. We show that these methods can offer significant computational savings with relatively small cost in solution quality.