Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.19753

A New Decision- Making Method Based on Shannon Entropy Analysis

Hamid Babaei·Shabnam Mohammadi·Hossein Ghaneai
View original source ↗Read source document ↗Export metadata ↓

Abstract

Because the appropriate combination of existing elements and establishing coordination between them as a consequence of making the right decision to accomplish the intended objective is achieved, management is now one of the main pillars of community management. Decisions are made in the majority of situations when the decision maker is pleased with the conclusion based on numerous factors. Several criteria are used instead of one measure of optimality in multi-criteria decision making, which has been studied by numerous academics in recent decades. The importance of the indicators in this type of decision making is clearly not equal, and it is necessary to understand the coefficient of importance or weight of each of these indicators in decision making. In this work, a novel technique termed scattering axis Dispersion-based Weighting Method (D.W.M) is suggested to address weighing issues, with the closest method in terms of computational logic being their entropy. After constructing the option's criterion matrix, the mean, standard deviation, and coefficient of variation are determined, and then the weight of each criterion is calculated, according to the proposed D.W.M technique. Several numerical examples have been utilized to demonstrate and assess the suggested technique. In addition, the Shannon entropy approach, which is a commonly used weighting method, was chosen to compare the findings. The statistical results demonstrate that these two weighing techniques have a strong connection. In compared to the Shannon entropy technique, the suggested method has the following advantages: Minimal computational burden The data does not need to be normalized. Its use in the case of negative data.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamid Babaei, Shabnam Mohammadi, Hossein Ghaneai. 2025-04-28. A New Decision- Making Method Based on Shannon Entropy Analysis. https://arxiv.org/abs/2504.19753

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

KEEP EXPLORING

Related papers

arXiv2026

$β$-Uniform Convexity and Divisible Domains

Divisible convex sets have long been important in the study of Hilbert geometries. When a divisible convex set is an ellipsoid, the Hilbert geometry it induces is the hyperbolic space. In general, strictly convex divisible domains exhibit negative curvature properties, but only the ellipsoid is a CAT(0) space. The notion of p-uniform convexity from the theory of Banach spaces has been proposed by Shin-Ichi Ohta as a generalization of the Alexandrov-Toponogov comparison theorems to Finsler manifolds. We prove that a natural Finsler metric on a strictly convex divisible domain is $β$-uniformly convex, where the constant $β$ is related to the regularity of the boundary. We use this to show, with AI assistance, that the Hilbert metric, under suitable local and scale-dependent assumptions, is $β$-uniformly convex on such domains.

math.MG↗
arXiv2026

A positive solution to the $L^p$ projection centroid conjecture

In a classical paper [21] in 2000, Lutwak-Yang-Zhang established the $L^p$ analog of the Petty projection inequality and the $L^p$ analog of the Busemann-Petty centroid inequality. In Section 7 of [21], Lutwak-Yang-Zhang proposed the important $L^p$ projection centroid conjecture. We give a positive solution to the $L^p$ projection centroid conjecture in this work.

math.MG↗
arXiv2026

Minimal central slices of the regular simplex

We prove that minimal-volume hyperplane sections of the regular simplex through its centroid are parallel to a facet. The proof combines variational methods with Fourier-analytic techniques and zero-diminishing arguments to show that every critical normal vector has at most three distinct non-zero coordinates. Analysis of the two- and three-value cases then yields the sharp lower bound.

math.MG↗