PropertyValue
?:about
?:abstract
  • 1. Introduction to Computational Social Choice; PART I VOTING: 2. Introduction to the Theory of Voting; 3. Tournament Solutions; 4. Weighted Tournament Solutions; 5. Dodgson’s Rule and Young’s Rule; 6. Barriers to Manipulation in Voting; 7. Control and Bribery in Voting; 8. Rationalizations of Voting Rules; 9. Voting in Combinatorial Domains; 10. Incomplete Information and Communication in Voting; PART II FAIR ALLOCATION: 11. Introduction to the Theory of Fair Allocation; 12. Fair Allocation of Indivisible Goods; 13. Cake Cutting Algorithms; PART III COALITION FORMING: 14. Matching under Preferences; 15. Hedonic Games; 16. Weighted Voting Games; PART IV ADDITIONAL TOPICS: 17. Judgment Aggregation; 18. The Axiomatic Approach and the Internet; 19. Knockout Tournaments (xsd:string)
?:contributor
?:dateModified
  • 2016 (xsd:gyear)
?:datePublished
  • 2016 (xsd:gyear)
?:duplicate
?:editor
?:hasFulltext
  • true (xsd:boolean)
is ?:hasPart of
?:inLanguage
  • Englisch (EN) (xsd:string)
?:isbn
  • 9781107060432 ()
?:libraryLocation
is ?:mainEntity of
?:name
  • Handbook of computational social choice (xsd:string)
?:provider
?:publicationType
  • Buch (de)
  • Elektronische Ressource (xsd:string)
  • book (en)
?:publisher
?:sourceInfo
  • Cambridge: Cambridge Univ. Press, 2016.- XV, 535 S. (xsd:string)
  • GESIS-BIB (xsd:string)
rdf:type