Bribe-proof rules in the division problem (Q2462290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5216462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bribe-proof rules in the division problem |
scientific article; zbMATH DE number 5216462 |
Statements
Bribe-proof rules in the division problem (English)
0 references
30 November 2007
0 references
bribe-proofness
0 references
strategy-proofness
0 references
Pareto efficiency
0 references
replacement monotonicity
0 references
single-peakedness
0 references
0.8578706
0 references
0 references
0 references
0.83664495
0 references
0.8283745
0 references
0.82738405
0 references
0.8263603
0 references
0.82165295
0 references
0 references
