Strategy-proof voting for multiple public goods
From MaRDI portal
Recommendations
- Strategy-proof allocation of multiple public goods
- A characterization of strategy-proof voting rules for separable weak orderings
- A characterization of strategy-proof social choice functions for economies with pure public goods
- Maximal domain for strategy-proof rules with one public good
- A characterization of possibility domains in strategic voting
Cited in
(15)- Strategy-proof location of public facilities
- Warm-glow giving in networks with multiple public goods
- Choosing the level of a public good when agents have an outside option
- Strategy-proof choice with monotonic additive preferences
- Three public goods and lexicographic preferences: replacement principle
- On strategy-proofness and semilattice single-peakedness
- Random mechanism design on multidimensional domains
- Strategy-proof allocation of multiple public goods
- A characterization of strategy-proof voting rules for separable weak orderings
- Strategy-proof partitioning
- Social Choice Theory
- Strategy-proof voting on the full preference domain
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains
- Strategy-proofness and weighted voting
- Efficient and strategy-proof voting over connected coalitions: a possibility result
This page was built for publication: Strategy-proof voting for multiple public goods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586114)