Sampling and optimal preference elicitation in simple mechanisms
From MaRDI portal
Cites work
- 1-pass relative-error L_p-sampling with applications
- Advances in the spatial theory of voting.
- Approximating optimal social choice under metric preferences
- Asymptotically optimal communication in simple mechanisms
- Differential Privacy: A Survey of Results
- Eliciting single-peaked preferences using comparison queries
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 5547873 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- Incentive compatibility and informational requirements
- Introduction to Property Testing
- Lower bounds for sampling algorithms for estimating the average
- Manipulation of Voting Schemes: A General Result
- Metric-Distortion Bounds under Limited Information
- Perfect L_p sampling in a data stream
- Strategy-proof location on a network
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The communication cost of selfishness
- The communication requirements of social choice rules and supporting budget sets
- Verifiably truthful mechanisms
- Vote elicitation with probabilistic preference models: empirical estimation and cost tradeoffs
This page was built for publication: Sampling and optimal preference elicitation in simple mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233466)
