Algorithmic Decision Theory: Lecture Notes in Computer Science, cartea 13023
Editat de Dimitris Fotakis, David Ríos Insuaen Limba Engleză Paperback – 7 oct 2021
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 522.59 lei
Preț vechi: 653.24 lei
-20%
Puncte Express: 784
Carte tipărită la comandă
Livrare economică 09-23 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783030877552
ISBN-10: 3030877558
Pagini: 464
Ilustrații: XIX, 441 p. 32 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.7 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030877558
Pagini: 464
Ilustrații: XIX, 441 p. 32 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.7 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Computational Social Choice and Preference Modelling.- Aggregating Preferences Represented by Conditional Preference Networks.- Measuring Nearly Single-peakedness of an Electorate: Some New Insights.- Preference Aggregation in the Generalised Unavailable Candidate Model.- Simultaneous Elicitation of Scoring Rule and Agent Preferences for Robust Winner Determination.- Preference Elicitation.- Incremental elicitation of preferences: optimist or pessimist?.- Probabilistic Lexicographic Preference Trees.- Incremental Preference Elicitation with Bipolar Choquet Integrals.- Preference Aggregation and Voting.- In the Beginning There Were n Agents: Founding and Amending a Constitution.- Unveiling the Truth in Liquid Democracy with Misinformed Voters.- Computing Kemeny Rankings From d-Euclidean Preferences.- Iterative Deliberation via Metric Aggregation.-Manipulation in Voting.- Obvious Manipulability of Voting Rules.- Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games.- Strategic Voting in Negotiating Teams.- The Nonmanipulative Vote-Deficits of Voting Rules.- Fair Division and Resource Allocation.- Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs.- On Fairness via Picking Sequences in Allocation of Indivisible Goods.- On Reachable Assignments in Cycles.- Minimizing and balancing envy among agents using Ordered Weighted Average.- Algorithmic Decision Theory.- Interactive Optimization of Submodular Functions under Matroid Constraints.- Necessary and possible interaction in a 2-maxitive Sugeno integral model.- Coalition Formation.- Democratic Forking: Choosing Sides with Social Choice.- Hedonic Diversity Games Revisited.- Stable Matchings.- Multi-agent Reinforcement Learning for Decentralized Stable Matching.- Lazy Gale-Shapley for Many-to-One Matching with Partial Information.- Participatory Budgeting.- Participatory Funding Coordination: Model, Axioms and Rules.- Complexity of Manipulative Interference in Participatory Budgeting.