40,690 research outputs found
Power Load Management as a Computational Market
Power load management enables energy utilities to reduce peak loads and thereby save money. Due to the large number of different loads, power load management is a complicated optimization problem. We present a new decentralized approach to this problem by modeling direct load management as a computational market. Our simulation results demonstrate that our approach is very efficient with a superlinear rate of convergence to equilibrium and an excellent scalability, requiring few iterations even when the number of agents is in the order of one thousand. Aframework for analysis of this and similar problems is given which shows how nonlinear optimization and numerical mathematics can be exploited to characterize, compare, and tailor problem-solving strategies in market-oriented programming
Bartering integer commodities with exogenous prices
The analysis of markets with indivisible goods and fixed exogenous prices has
played an important role in economic models, especially in relation to wage
rigidity and unemployment. This research report provides a mathematical and
computational details associated to the mathematical programming based
approaches proposed by Nasini et al. (accepted 2014) to study pure exchange
economies where discrete amounts of commodities are exchanged at fixed prices.
Barter processes, consisting in sequences of elementary reallocations of couple
of commodities among couples of agents, are formalized as local searches
converging to equilibrium allocations. A direct application of the analyzed
processes in the context of computational economics is provided, along with a
Java implementation of the approaches described in this research report.Comment: 30 pages, 5 sections, 10 figures, 3 table
New and simple algorithms for stable flow problems
Stable flows generalize the well-known concept of stable matchings to markets
in which transactions may involve several agents, forwarding flow from one to
another. An instance of the problem consists of a capacitated directed network,
in which vertices express their preferences over their incident edges. A
network flow is stable if there is no group of vertices that all could benefit
from rerouting the flow along a walk.
Fleiner established that a stable flow always exists by reducing it to the
stable allocation problem. We present an augmenting-path algorithm for
computing a stable flow, the first algorithm that achieves polynomial running
time for this problem without using stable allocation as a black-box
subroutine. We further consider the problem of finding a stable flow such that
the flow value on every edge is within a given interval. For this problem, we
present an elegant graph transformation and based on this, we devise a simple
and fast algorithm, which also can be used to find a solution to the stable
marriage problem with forced and forbidden edges.
Finally, we study the stable multicommodity flow model introduced by
Kir\'{a}ly and Pap. The original model is highly involved and allows for
commodity-dependent preference lists at the vertices and commodity-specific
edge capacities. We present several graph-based reductions that show
equivalence to a significantly simpler model. We further show that it is
NP-complete to decide whether an integral solution exists
Application of Market Models to Network Equilibrium Problems
We present a general two-side market model with divisible commodities and
price functions of participants. A general existence result on unbounded sets
is obtained from its variational inequality re-formulation. We describe an
extension of the network flow equilibrium problem with elastic demands and a
new equilibrium type model for resource allocation problems in wireless
communication networks, which appear to be particular cases of the general
market model. This enables us to obtain new existence results for these models
as some adjustments of that for the market model. Under certain additional
conditions the general market model can be reduced to a decomposable
optimization problem where the goal function is the sum of two functions and
one of them is convex separable, whereas the feasible set is the corresponding
Cartesian product. We discuss some versions of the partial linearization
method, which can be applied to these network equilibrium problems.Comment: 18 pages, 3 table
Multi-Agent System Control and Coordination of an Electrical Network
Multi-Agent Systems (MAS) have the potential to solve Active Network Management (ANM) problems arising from an increase in Distributed Energy Resources (DER). The aim of this research is to integrate a MAS into an electrical network emulation for the purpose of implementing ANM. Initially an overview of agents and MAS and how their characteristics can be used to control and coordinate an electrical network is presented. An electrical network comprising a real-time emulated transmission network connected to a live DER network controlled and coordinated by a MAS is then constructed. The MAS is then used to solve a simple ANM problem: the control and coordination of an electrical network in order to maintain frequency within operational limits. The research concludes that a MAS is successful in solving this ANM problem and also that in the future the developed MAS can be applied to other ANM problems. © 2012 IEEE
- …