arXiv subjects

Ehsan Heidari

Publications and source records attributed to Ehsan Heidari.

2 recordsLinked to original sources

arXiv2025

Improved Maximin Share Guarantee for Additive Valuations

The maximin share ($\textsf{MMS}$) is the most prominent share-based fairness notion in the fair allocation of indivisible goods. Recent years have seen significant efforts to improve the approximation guarantees for $\textsf{MMS}$ for different valuation classes, particularly for additive valuations. For the additive setting, it has been shown that for some instances, no allocation can guarantee a factor better than $1-\tfrac{1}{n^4}$ of maximin share value to all agents. However, the best currently known algorithm achieves an approximation guarantee of $\tfrac{3}{4} + \tfrac{3}{3836}$ for $\textsf{MMS}$. In this work, we narrow this gap and improve the best-known approximation guarantee for $\textsf{MMS}$ to $\tfrac{10}{13}$.

cs.GT↗

arXiv2011

An Efficient Method Based on Genetic Algorithms to Solve Sensor Network Optimization Problem

Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. In this paper, we propose an efficient method based on genetic algorithms (GAs) to solve a sensor network optimization problem. Long communication distances between sensors and a sink in a sensor network can greatly drain the energy of sensors and reduce the lifetime of a network. By clustering a sensor network into a number of independent clusters using a GA, we can greatly minimize the total communication distance, thus prolonging the network lifetime. Simulation results show that our algorithm can quickly find a good solution.

cs.NI↗