Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1607.02376

Multi-Agent System for Groundwater Depletion Using Game Theory

Ying Huang·Pavel Janovsky·Sanjoy Das·Stephen M. Welch·Scott DeLoach
View original source ↗Read source document ↗Export metadata ↓

Abstract

Groundwater is one of the most vital of all common pool resources throughout the world. More than half of groundwater is used to grow crops. This research models groundwater depletion patterns within a multi-agent system framework. Irrigators are modeled as agents in the multi-agent system. The irrigation strategies adopted by the agents are investigated using game theory. A set of five irrigators, growing three crops: corn, sorghum and wheat, have been considered in this study. To allow groundwater flow, these agents are assumed to be located in adjoining farm lands. Irrigators are modeled selfish agents that strategize their irrigation patterns in order to maximize their own utilities, i.e. the difference between the total revenue obtained from crop sales and the costs incurred, including groundwater extraction costs. Due to groundwater flow, and have no incentive to conserve groundwater. This leads to unsustainable depletion of the resource under Nash equilibrium, when no irrigator can increase its utility by unilaterally changing its strategy. All parameters in this research are representative of Kansas. Recorded environmental and economic data of the region, along with the DSSAT software, have been used to obtain these futuristic projections. One of the emergent phenomena of the simulations is the adoption of crop rotation patterns by the irrigators to conserve groundwater. The irrigators grow corn, which is a more profitable yet water intensive crop in one year, and in the next, conserve water by growing sorghum instead. Another emergent outcome of this research is the viability of LEMAs. When the irrigators are subject to LEMA-level limits on groundwater use, there is a slight increase in the aggregate utility of the LEMA.

Explore related subjects

cs.GTcs.CEcs.CYcs.MA

Keep this discovery

BibTeXRIS

Ying Huang, Pavel Janovsky, Sanjoy Das, Stephen M. Welch, Scott DeLoach. 2016-07-07. Multi-Agent System for Groundwater Depletion Using Game Theory. https://arxiv.org/abs/1607.02376

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗