Related papers: Decentralized Supply Chain Formation: A Market Pro…
Personalized pricing is a business strategy to charge different prices to individual consumers based on their characteristics and behaviors. It has become common practice in many industries nowadays due to the availability of a growing…
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the…
Problem definition: Traditional monopoly pricing assumes sellers have full information about consumer valuations. We consider monopoly pricing under limited information, where a seller only knows the mean, variance and support of the…
Supply chain management encompasses various processes including various conventional logistics activities, and various other processes These processes are supported -- to a certain limit -- by coordination and integration mechanisms which…
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…
Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension…
In this work, we analyze the spatio-temporal economic properties of multi-product supply chains. Specifically, we interpret the supply chain as a coordinated market in which stakeholders (suppliers, consumers, and providers of…
In this paper, we investigate a supply chain network with a supplier and multiple retailers. The supplier can either take orders from retailers directly, or choose to build a warehouse somewhere in the network to centralize the ordering…
Procurement in maritime logistics faces challenges due to uncertainties in demand and fluctuating market conditions. To address these complexities, we introduce a flexible discrete-event simulation framework that models the request-to-order…
A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized…
Blockchains are widely used for secure transaction processing, but their scalability remains limited, and existing multichain designs are typically static even as demand and capacity shift. We cast blockchain configuration as a multiagent…
Due to delays in the adaptation of production or delivery rates, supply chains can be dynamically unstable with respect to perturbations in the consumption rate, which is known as "bull-whip effect". Here, we study several conceivable…
As an integral part of the decentralized finance (DeFi) ecosystem, decentralized exchanges (DEXs) with automated market maker (AMM) protocols have gained massive traction with the recently revived interest in blockchain and distributed…
Stochastic matching is the stochastic version of the well-known matching problem, which consists in maximizing the rewards of a matching under a set of probability distributions associated with the nodes and edges. In most stochastic…
In a day-ahead market, energy buyers and sellers submit their bids for a particular future time, including the amount of energy they wish to buy or sell and the price they are prepared to pay or receive. However, the dynamic for forming the…
We present a simple dynamic equilibrium model for an online exchange where both buyers and sellers arrive according to a exogenously defined stochastic process. The structure of this exchange is motivated by the limit order book mechanism…
This paper develops a decomposition methodology for common agency games in which each principal's payoff depends on her own outcome and the agent's type, but not on rivals' outcomes. The key step reduces each principal's best-response…
In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node private objective functions. Algorithms interleave local computations with communication among all or a subset…
Equilibrium computation in markets usually considers settings where player valuation functions are known. We consider the setting where player valuations are unknown; using a PAC learning-theoretic framework, we analyze some classes of…
We consider a monopolistic seller in a market that may be segmented. The surplus of each consumer in a segment depends on the price that the seller optimally charges, which depends on the set of consumers in the segment. We study which…