In this paper, we describe a novel bidding strategy that autonomous trading agents can use to participate in Continuous Double Auctions (CDAs). Our strategy is based on both short and long-term learning that allows such agents to adapt their bidding behaviour to be efficient in a wide variety of environments. For the shortterm learning, the agent updates the aggressiveness of its bidding behaviour (more aggressive means it will trade off profit to improve its chance of transacting, less aggressive that it targets more profitable transactions and is willing to trade off its chance of transacting to achieve them) based on market information observed after any bid or ask appears in the market. The long-term learning then determines how this aggressiveness factor influences an agent's choice of which bids or asks to submit in the market, and is based on market information observed after every transaction (successfully matched bid and ask). The principal motivation for the short-term learning is to enable the agent to immediately respond to market fluctuations, while for the long-term learning it is to adapt to broader trends in the way in which the market demand and supply changes over time. We benchmark our strategy against the current state of the art (ZIP and GDX) and show that it outperforms these benchmarks in both static and dynamic environments. This is true both when the population is homogeneous (where the increase in efficiency is up to 5.2%) and heterogeneous (in which case there is a 0.85 probability of our strategy being adopted in a two-population evolutionary game theoretic analysis).
A research agenda for making the smart grid a reality.
Abstract-This paper reports on the design and comparison of two economically inspired mechanisms for task allocation in environments where sellers have finite production capacities and a cost structure composed of a fixed overhead cost and a constant marginal cost. Such mechanisms are required when a system consists of multiple self-interested stakeholders that each possess private information that is relevant to solving a systemwide problem. Against this background, we first develop a computationally tractable centralized mechanism that finds the set of producers that have the lowest total cost in providing a certain demand (i.e., it is efficient). We achieve this by extending the standard Vickrey-Clarke-Groves mechanism to allow for multiattribute bids and by introducing a novel penalty scheme such that producers are incentivized to truthfully report their capacities and their costs. Furthermore, our extended mechanism is able to handle sellers' uncertainty about their production capacity and ensures that individual agents find it profitable to participate in the mechanism. However, since this first mechanism is centralized, we also develop a complementary decentralized mechanism based around the continuous double auction. Again, because of the characteristics of our domain, we need to extend the standard form of this protocol by introducing a novel clearing rule based around an order book. With this modified protocol, we empirically demonstrate (with simple trading strategies) that the mechanism achieves high efficiency. In particular, despite this simplicity, the traders can still derive a profit from the market which makes our mechanism attractive since these results are a likely lower bound on their expected returns.Index Terms-Decision theory, distributed decision making, market-based control (MBC), multiagent systems.
In this paper, we propose a game-theoretic framework for analysing competing double auction marketplaces that vie for traders and make profits by charging fees. Firstly, we analyse the equilibrium strategies for the traders' market selection decision for given market fees using evolutionary game theory. Using this approach, we investigate how traders dynamically change their strategies, and thus, which equilibrium, if any, can be reached. In so doing, we show that, when the same type of fees are charged by two marketplaces, it is unlikely that competing marketplaces will continue to co-exist when traders converge to their equilibrium market selection strategies. Eventually, all the traders will congregate in one marketplace. However, when different types of fees are allowed (registration fees and profit fees), competing marketplaces are more likely to co-exist in equilibrium. We also find that sometimes all the traders eventually migrate to the marketplace that charges higher fees. We then further analyse this phenomenon, and specifically analyse how bidding strategies and random exploration of traders affects this migration respectively. Secondly, we analyse the equilibrium strategies of the marketplaces when they have the ability to vary their fees in response to changes in the traders' market selection strategies. In this case, we consider the competition of the marketplaces as a two-stage game, where the traders' market selection strategies are conditional on the market fees. In particular, we use a coevolutionary approach to analyse how competing marketplaces dynamically set fees while taking into account the dynamics of the traders' market selection strategies. In so doing, we find that two identical marketplaces undercut each other, and they will eventually charge the minimal fee as we set that guarantees positive market profits for them. Furthermore, Bing Shi School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK E-mail: bs07r@ecs.soton.ac.uk Enrico H. Gerding School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK E-mail: eg@ecs.soton.ac.uk Perukrishnen Vytelingum School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK E-mail: pv@ecs.soton.ac.uk Nicholas R. Jennings School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK E-mail: nrj@ecs.soton.ac.uk 2 we extend the co-evolutionary analysis of the marketplaces' fee strategies to more general cases. Specifically, we analyse how an initially disadvantaged marketplace with an adaptive fee strategy can outperform an initially advantaged one with a fixed fee strategy, or even one with an adaptive fee strategy, and how competing marketplaces evolve their fee strategies when different types of fees are allowed.
With dwindling nonrenewable energy reserves and the adverse effects of climate change, the development of the smart electricity grid is seen as key to solving global energy security issues and to reducing carbon emissions. In this respect, there is a growing need to integrate renewable (or green) energy sources in the grid. However, the intermittency of these energy sources requires that demand must also be made more responsive to changes in supply, and a number of smart grid technologies are being developed, such as highcapacity batteries and smart meters for the home, to enable consumers to be more responsive to conditions on the grid in real time. Traditional solutions based on these technologies, however, tend to ignore the fact that individual consumers will behave in such a way that best satisfies their own preferences to use or store energy (as opposed to that of the supplier or the grid operator). Hence, in practice, it is unclear how these solutions will cope with large numbers of consumers using their devices in this way. Against this background, in this article, we develop novel control mechanisms based on the use of autonomous agents to better incorporate consumer preferences in managing demand. These agents, residing on consumers' smart meters, can both communicate with the grid and optimize their owner's energy consumption to satisfy their preferences. More specifically, we provide a novel control mechanism that models and controls a system comprising of a green energy supplier operating within the grid and a number of individual homes (each possibly owning a storage device). This control mechanism is based on the concept of homeostasis whereby control signals are sent to individual components of a system, based on their continuous feedback, in order to change their state so that the system may reach a stable equilibrium. Thus, we define a new carbon-based pricing mechanism for this green energy supplier that takes advantage of carbon-intensity signals available on the Internet in order to provide real-time pricing. The pricing scheme is designed in such a way that it can be readily implemented using existing communication technologies and is easily understandable by consumers. Building upon this, we develop new control signals that the supplier can use to incentivize agents to shift demand (using their storage device) to times when green energy is available. Moreover, we show how these signals can be adapted according to changes in supply and to various degrees of penetration of storage in the system. We empirically evaluate our system and show that, when all homes are equipped with storage devices, the supplier can significantly reduce its reliance on other carbon-emitting power sources to cater for its own shortfalls. By so doing, the supplier reduces the carbon emission of the system by up to 25% while the consumer reduces its costs by up to 14.5%. Finally, we demonstrate that our homeostatic control mechanism is not sensitive to small prediction errors and the supplier is incentivized to accura...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.