Tight Upper Bounds for the Expected Loss of Lexicographic Heuristics in Binary Multiattribute Choice

SSRN Electronic Journal
doi 10.2139/ssrn.962692
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

Cumulative Dominance and Heuristic Performance in Binary Multiattribute Choice

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2008English

The Influence of Decision Heuristics and Overconfidence on Multiattribute Choice: A Process-Tracing Study

European Journal of Cognitive Psychology
2006English

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1989English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Tight Bounds for Testing Bipartiteness in General Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem

Evolutionary Computation
Computational Mathematics
2017English

Tight Bounds for Parallel Randomized Load Balancing

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy