You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, CP 2003, held in Kinsale, Ireland in September/October 2003. The 48 revised full papers and 34 revised short papers presented together with 4 invited papers and 40 abstracts of contributions to the CP 2003 doctoral program were carefully reviewed and selected from 181 submissions. A wealth of recent results in computing with constraints is addressed ranging from foundational and methodological issues to solving real-world problems in a variety of application fields.
The rapidly growing field of computational social choice, at the intersection of computer science and economics, deals with the computational aspects of collective decision making. This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions. Topics include voting theory (such as the computational complexity of winner determination and manipulation in elections), fair allocation (such as algorithms for dividing divisible and indivisible goods), coalition formation (such as matching and hedonic games), and many more. Graduate students, researchers, and professionals in computer science, economics, mathematics, political science, and philosophy will benefit from this accessible and self-contained book.
A balanced and thought-provoking guide to all the big questions about AI and ethics Can computers understand morality? Can they respect privacy? And what can we do to make AI safe and fair? The artificial intelligence revolution has begun. Today, there are self-driving cars on our streets, autonomous weapons in our armies, robot surgeons in our hospitals – and AI's presence in our lives will only increase. Some see this as the dawn of a new era in innovation and ease; others are alarmed by its destructive potential. But one thing is clear: this is a technology like no other, one that raises profound questions about the very definitions of human intelligence and morality. In Moral AI, world...
Thepresentvolumewasdevotedto thethirdeditionofthe InternationalSym- sium on Algorithmic Game Theory (SAGT), an interdisciplinary scienti?c event intended to provide a forum for researchers as well as practitioners to exchange innovative ideas and to be aware of each other's e?orts and results. SAGT 2010 took place in Athens, on October 18–20, 2010. The present volume contains all contributed papers presented at SAGT 2010 together with the distinguished invited lectures of Amos Fiat (Tel-Aviv University, Israel), and Paul Goldberg (University of Liverpool, UK). The two invited papers are presented at the - ginning of the proceedings, while the regular papers follow in alphabetical order (by...
This thesis presents a study of several combinatorial problems related to social choice and social networks. The main concern is their computational complexity, with an emphasis on their parameterized complexity. The goal is to devise efficient algorithms for each of the problems studied here, or to prove that, under widely-accepted assumptions, such algorithms cannot exist. The problems discussed in Chapter 3 and in Chapter 4 are about manipulating a given election, where some relationships between the entities of the election are assumed. This can be seen as if the election occurs on top of an underlying social network, connecting the voters participating in the election or the candidates ...
The ubiquitous challenge of learning and decision-making from rank data arises in situations where intelligent systems collect preference and behavior data from humans, learn from the data, and then use the data to help humans make efficient, effective, and timely decisions. Often, such data are represented by rankings. This book surveys some recent progress toward addressing the challenge from the considerations of statistics, computation, and socio-economics. We will cover classical statistical models for rank data, including random utility models, distance-based models, and mixture models. We will discuss and compare classical and state-of-the-art algorithms, such as algorithms based on M...
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms.
This book offers a self-sufficient treatment of a key tool, game theory and mechanism design, to model, analyze, and solve centralized as well as decentralized design problems involving multiple autonomous agents that interact strategically in a rational and intelligent way. The contents of the book provide a sound foundation of game theory and mechanism design theory which clearly represent the “science” behind traditional as well as emerging economic applications for the society.The importance of the discipline of game theory has been recognized through numerous Nobel prizes in economic sciences being awarded to game theorists, including the 2005, 2007, and 2012 prizes. The book distil...
This volume contains 13 thoroughly refereed and revised papers detailing recent advances in research on trading agents, negotiating agents, dynamic pricing, and auctions. They were originally presented at the 10th International Workshop on Agent-Mediated Electronic Commerce (AMEC 2008) collocated with AAMAS 2008 in Estoril, Portugal, or the 6th Workshop on Trading Agent Design and Analysis (TADA 2008) collocated with AAAI 2008 in Chicago, IL, USA. The papers originating from AMEC 2008 address agent modeling and multi-agent problems in the context of e-negotiations and e-commerce. The TADA papers stem from the effort to design scenarios where trading agents and market designers can be pitched against each other in applications from supply chain management and procurement. They are all characterized by interdisciplinary research combining fields such as artificial intelligence, distributed systems, game theory, and economics.