Algorithmic Decision Theory: 7th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings: 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ț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 519.07 lei
Preț vechi: 648.84 lei
-20% Nou
Puncte Express: 779
Preț estimativ în valută:
91.84€ • 107.97$ • 80.43£
91.84€ • 107.97$ • 80.43£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030877552
ISBN-10: 3030877558
Pagini: 441
Ilustrații: XIX, 441 p. 32 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.64 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Cham, Switzerland
ISBN-10: 3030877558
Pagini: 441
Ilustrații: XIX, 441 p. 32 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.64 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
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.