The importance of being biased
From MaRDI portal
Publication:3579199
Recommendations
- scientific article; zbMATH DE number 1790502
- We should focus on the biases that matter: a reply to commentaries
- Biases in bias elicitation
- A note on biased fundamentalists
- Understanding outcome bias
- Biased information and the exchange paradox
- The impossibility of unbiased judgment aggregation
- Determining the majority: The biased case
Cited in
(50)- Approximation hardness of edge dominating set problems
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
- Approximating the minimum weight weak vertex cover
- Graph covering using bounded size subgraphs
- Minimum vertex cover in rectangle graphs
- A parameterized approximation scheme for generalized partial vertex cover
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- On the independent set problem in random graphs
- Crown reductions for the minimum weighted vertex cover problem
- Testing juntas
- A primal-dual approximation algorithm for the vertex cover P^3 problem
- Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
- Inapproximability results for equations over infinite groups
- On the hardness of approximating minimum vertex cover
- On problems without polynomial kernels
- Online multiset submodular cover
- On approximating minimum vertex cover for graphs with perfect matching
- Approximating the influence of monotone Boolean functions in \(O(\sqrt{n})\) query complexity
- A Katona-type proof of an Erdős-Ko-Rado-type theorem
- Upper and lower bounds on approximating weighted mixed domination
- Maximum locally stable matchings
- Parameterized approximability of maximizing the spread of influence in networks
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- On the Minimum Hitting Set of Bundles Problem
- Super-polynomial approximation branching algorithms
- Metrical service systems with multiple servers
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Using the FGLSS-Reduction to Prove Inapproximability Results for Minimum Vertex Cover in Hypergraphs
- Confronting intractability via parameters
- On the advantage of overlapping clusters for minimizing conductance
- Complexity of approximating bounded variants of optimization problems
- scientific article; zbMATH DE number 7576795 (Why is no real title available?)
- Mathematics of computation through the lens of linear equations and lattices
- On finding the longest antisymmetric path in directed acyclic graphs
- On the minimum hitting set of bundles problem
- An edge-reduction algorithm for the vertex cover problem
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Approximation hardness of dominating set problems in bounded degree graphs
- On the measure of intersecting families, uniqueness and stability
- Gaussian bounds for noise correlation of functions
- Inapproximability results for equations over finite groups
- The checkpoint problem
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover
- A simple rounding scheme for multistage optimization
- On the induced matching problem in Hamiltonian bipartite graphs
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding
- Linear time algorithms for approximating the facility terminal cover problem
- Online budgeted maximum coverage
- Priority algorithms for graph optimization problems
This page was built for publication: The importance of being biased
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579199)
