Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2308.08522v1

Help | Advanced Search

Mathematics > Optimization and Control

arXiv:2308.08522v1 (math)
[Submitted on 16 Aug 2023 (this version) , latest version 29 Jan 2024 (v2) ]

Title: Generalizing the Min-Max Regret Criterion using Ordered Weighted Averaging

Title: 使用有序加权平均推广最小最大遗憾准则

Authors:Werner Baak, Marc Goerigk, Adam Kasperski, Paweł Zieliński
Abstract: In decision making under uncertainty, several criteria have been studied to aggregate the performance of a solution over multiple possible scenarios, including the ordered weighted averaging (OWA) criterion and min-max regret. This paper introduces a novel generalization of min-max regret, leveraging the modeling power of OWA to enable a more nuanced expression of preferences in handling regret values. This new OWA regret approach is studied both theoretically and numerically. We derive several properties, including polynomially solvable and hard cases, and introduce an approximation algorithm. Through computational experiments using artificial and real-world data, we demonstrate the advantages of our OWAR method over the conventional min-max regret approach, alongside the effectiveness of the proposed clustering heuristics.
Abstract: 在不确定性下的决策中,已经研究了几种准则来汇总解决方案在多个可能情景下的表现,包括有序加权平均(OWA)准则和最小最大后悔准则。 本文引入了最小最大后悔的一种新泛化方法,利用OWA的建模能力,以更细致的方式表达在处理后悔值时的偏好。 这种新的OWA后悔方法从理论和数值两个方面进行了研究。 我们推导了几个性质,包括多项式可解和困难的情况,并引入了一个近似算法。 通过使用人工和现实数据的计算实验,我们展示了我们的OWAR方法相对于传统最小最大后悔方法的优势,同时证明了所提出的聚类启发式方法的有效性。
Subjects: Optimization and Control (math.OC)
Cite as: arXiv:2308.08522 [math.OC]
  (or arXiv:2308.08522v1 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2308.08522
arXiv-issued DOI via DataCite

Submission history

From: Marc Goerigk [view email]
[v1] Wed, 16 Aug 2023 17:20:43 UTC (96 KB)
[v2] Mon, 29 Jan 2024 07:24:51 UTC (236 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2023-08
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号