Algorithms for strategyproof classification
type: Item
instance of: scholarly article
title: Algorithms for strategyproof classification
zbMATH Open document ID: 1251.91022
author: Reshef Meir
author: Ariel D. Procaccia
author: Jeffrey S. Rosenschein
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 91B14
zbMATH DE Number: 6106682
zbMATH Keywords: mechanism design
zbMATH Keywords: classification
zbMATH Keywords: game theory
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.artint.2012.03.008
OpenAlex ID: W2054844093
cites work: Strategyproof Approximation of the Minimax on Networks
cites work: Walking in circles
cites work: Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
cites work: On the use of ordered sets in problems of comparison and consensus of classifications
cites work: PAC learning with nasty noise.
cites work: Incentive compatible regression learning
cites work: Aggregation of binary evaluations
cites work: Aggregation of equivalence relations
cites work: Manipulation of Voting Schemes: A General Result
cites work: Scheduling without Payments
cites work: Efficient and binary consensus functions on transitively valued relations
cites work: Q3524718
cites work: Strategy-proof estimators for simple regression.
cites work: The learnability of voting rules
cites work: Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
cites work: Q3524719
cites work: A theory of the learnable
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: On the theory of aggregation
DOI: 10.1016/J.ARTINT.2012.03.008
description: scientific article; zbMATH DE number 6106682