惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

阮一峰的网络日志
阮一峰的网络日志
Hugging Face - Blog
Hugging Face - Blog
Recent Announcements
Recent Announcements
MongoDB | Blog
MongoDB | Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
G
Google Developers Blog
L
LangChain Blog
The GitHub Blog
The GitHub Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
GbyAI
GbyAI
MyScale Blog
MyScale Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
U
Unit 42
Martin Fowler
Martin Fowler
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Apple Machine Learning Research
Apple Machine Learning Research
爱范儿
爱范儿
博客园 - 聂微东
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
A
About on SuperTechFans
Stack Overflow Blog
Stack Overflow Blog
V
V2EX

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Taxicab distance based best-worst method for multi-criter...
[Submitted on 26 Aug 2024 (v1), last revised 18 Jun 2026 (this v · 2026-06-19 · via math updates on arXiv.org

View PDF

Abstract:The best-worst method is a well-known distance based multi-criteria decision-making method used for computing the weights of decision criteria. This article provides a comprehensive analytical examination of the taxicab distance based model of the method, with the objectives of investigating the uniqueness of these solutions, and performing a rigorous consistency analysis. To achieve this, an optimal modification based optimization problem, equivalent to the original one, is first formulated. This reformulated problem is then solved analytically, and the optimal weight sets are derived from its solutions. Contrary to the prevailing understanding derived from numerical experiments with the taxicab model, our analytical framework proves that the model can, in fact, lead to multiple optimal weight sets, and we formally establish the conditions for this occurrence. A mixed-integer linear programming model is then employed to compute the consistency index. A decision-maker-aided selection strategy is also proposed for addressing non-uniqueness of optimal weight sets. In addition, threshold values of the consistency ratio to assess the admissibility of given preferences are also established. This framework provides a solid mathematical foundation that enhances the understanding of the model and eliminates the requirement for optimization software. By significantly improving the model's computational efficiency, it enables implementation in large-scale, dynamic real-world applications such as electricity market bidding strategies and portfolio rebalancing under market volatility. The effectiveness of the proposed framework is demonstrated through numerical examples, and its practical applicability is illustrated via a smartphone selection problem.

Submission history

From: Harshit Ratandhara [view email]
[v1] Mon, 26 Aug 2024 17:47:24 UTC (221 KB)
[v2] Fri, 4 Apr 2025 06:44:11 UTC (225 KB)
[v3] Thu, 18 Jun 2026 05:47:20 UTC (135 KB)