Heuristic Bidding Strategies for Multiple Heterogeneous Auctions

نویسندگان

  • David C. K. Yuen
  • Andrew Byde
  • Nicholas R. Jennings
چکیده

This paper investigates utility maximising bidding heuristics for agents that participate in multiple heterogeneous auctions, in which the auction format and the starting and closing times can be different. Our strategy allows an agent to procure one or more items and to participate in any number of auctions. For this case, forming an optimal bidding strategy by global utility maximisation is computationally intractable, and so we develop two-stage heuristics that first provide reasonable bidding thresholds with simple strategies before deciding which auctions to participate in. The proposed approach leads to an average gain of at least 24% in agent utility over commonly used benchmarks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm

In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

متن کامل

Evolving Bidding Strategies using Self Adaptation

Online auctions play an important role in today’s e-commerce for procuring goods. The proliferation of online auctions has caused the increasing need of monitoring and tracking multiple bids in multiple auctions. This paper investigates the application of self adaptive genetic algorithms on a flexible and configurable heuristic decision making framework that can tackle the problem of bidding ac...

متن کامل

Evolving Bidding Strategies for Multiple Auctions

Due to the proliferation of online auctions, there is an increasing need to monitor and bid in multiple auctions in order to procure the best deal for the desired good. Against this background, this paper reports on the development of a heuristic decision making framework that an autonomous agent can exploit to tackle the problem of bidding across multiple auctions with varying protocols (inclu...

متن کامل

Sequential auctions for common value objects with budget constrained bidders

This paper analyzes sequential auctions for budget constrained bidders, for multiple heterogeneous common value objects. In most auctions, bidders not only have valuations for objects but also have budget constraints (i.e., constraints on how much they can actually spend in an auction). Given these constraints, the bidders’ problem is to determine how much to bid in each auction. To this end, t...

متن کامل

Self-Confirming Price Prediction for Bidding in Simultaneous Second-Price Sealed-Bid Auctions

Bidding strategies for simultaneous interdependent markets typically rely on price predictions to manage uncertainty across markets. Previous work on simultaneous ascending auctions has found selfconfirming price predictions particularly effective in dealing with the exposure problem. We adapt this approach to a setting with simultaneous oneshot (SPSB) auctions, producing self-confirming predic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006