|
|
|
 |
Search published articles |
 |
|
Showing 2 results for Ghiyasvand
Dr Mehdi Ghiyasvand, Volume 13, Issue 1 (6-2022)
Abstract
In Fisher's and Arrow-Debreu's market equilibrium models with linear utilities, a set B of buyers and a set G of divisible goods, suppose that there are some buyers with surplus money w.r.t current prices of goods. If there does not exists an equilibrium, then, there are some buyers with surplus money w.r.t the given prices. A set of buyers with surplus money called a violated set. Computing this set helps to find the set of buyers with maximum surplus money w.r.t the given prices. In this paper, two new kinds of violated sets are defined, which called maximum proportion and most violated sets. We present an algorithm to compute a maximum proportion set, which runs in at most |B| maximum flow computations. Also, we show that the set of all buyers B is a most violated set.
Dr. Sepideh Ghazvineh, Mehdi Ghiyasvand, Volume 15, Issue 2 (12-2024)
Abstract
Cai et al.(2013) and Cai and Han (2014) presented the polynomial time algorithms for two-pair and three-pair networks with common bottleneck links, respectively. Also, Chen and HaiBin(2012) proposed a non-polynomial time algorithms for $n$-pair networks with common bottleneck links, where $n$ is an arbitrary integer. This paper presents a new sufficient and necessary condition to determine the solvability of single rate $n$-pair networks with common bottleneck links, which concludes a polynomial time algorithm for $n$-pair networks with common bottleneck links, where $n$ is an arbitrary integer. Our algorithm runs in $O(|V||E|^{2})$ time, where $|V|$ and $|E|$ are the number of nodes and links, respectively.
|
|
|
|
|
|