Pages that link to "Item:Q483577"
From MaRDI portal
The following pages link to Strategy-proofness on restricted separable domains (Q483577):
Displaying 10 items.
- Coding strategies, the Choquet game, and domain representability (Q260593) (← links)
- Strategy-proof partitioning (Q380879) (← links)
- Tops-only domains (Q623445) (← links)
- On completeness of narrowing strategies (Q912605) (← links)
- Strategy-proofness of continuous aggregation maps (Q1367923) (← links)
- Power of voters and domain of preferences where voting by committees is strategy-proof (Q1906707) (← links)
- A unified characterization of the randomized strategy-proof rules (Q2231399) (← links)
- Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility (Q2273939) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- (Q4900290) (← links)