Incentive compatible regression learning
From MaRDI portal
Publication:1959425
DOI10.1016/j.jcss.2010.03.003zbMath1208.68132MaRDI QIDQ1959425
Felix Fischer, Ariel D. Procaccia, Ofer Dekel
Publication date: 7 October 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2007/1162/
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
91A26: Rationality and learning in game theory
Related Items
Algorithms for strategyproof classification, A Survey on Approximation Mechanism Design Without Money for Facility Games, Optimal Impartial Selection
Cites Work
- Unnamed Item
- Unnamed Item
- The learnability of voting rules
- Reducing mechanism design to algorithm design via machine learning
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Learnability and rationality of choice.
- Strategy-proof estimators for simple regression.
- PAC learning with nasty noise.
- Can PAC learning algorithms tolerate random attribute noise?
- Generalized Condorcet-winners for single peaked and single-plateau preferences
- Inventory Management of a Fast-Fashion Retail Network
- Learning in the Presence of Malicious Errors
- Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical
- Truth revelation in approximately efficient combinatorial auctions
- Incentives in Teams
- Manipulation of Voting Schemes: A General Result
- Straightforward Elections, Unanimity and Phantom Voters
- 10.1162/153244303321897690
- Truthful randomized mechanisms for combinatorial auctions
- Convergence of stochastic processes
- Algorithmic mechanism design
