You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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 ...
This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008. The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.
Aline Leon ́ In the last years, public attention was increasingly shifted by the media and world governmentsto the conceptsof saving energy,reducingpollution,protectingthe - vironment, and developing long-term energy supply solutions. In parallel, research funding relating to alternative fuels and energy carriers is increasing on both - tional and international levels. Why has future energy supply become such a matter of concern? The reasons are the problems created by the world’s current energy supply s- tem which is mainly based on fossil fuels. In fact, the energystored in hydrocarb- based solid, liquid, and gaseous fuels was, is, and will be widely consumed for internal combustion eng...
With approval voting, voters can approve of as many candidates as they want, and the one approved by the most voters wins. This book surveys a wide variety of empirical and theoretical knowledge accumulated from years of studying this method of voting.
This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998. The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..
This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.
This book constitutes the refereed proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009, held in Rome, Italy, in December 2009. The 34 regular and 29 short revised full papers presented together with 3 invited talks were carefully reviewed and selected from 142 submissions. The papers address various topics in theoretical computer science, networking and security, economics, mathematics, sociology, and management sciences devoted to the analysis of problems arising in the internet and the worldwide Web, such as auction algorithms, computational advertising, general and majority equilibrium, coalitions, collective action, economics aspects of security and privacy in distributed and network computing, algorithmic design and game theory, information economics, network games, price dynamics, and social networks.
This book constitutes the refereed proceedings of the 39th Annual German Conference on Artificial Intelligence, KI 2016, in conjunction with the Österreichische Gesellschaft für Artificial Intelligence, ÖGAI, held in Klagenfurt, Austria, in September 2016. The 8 revised full technical papers presented together with 12 technical communications, and 16 extended abstracts were carefully reviewed and selected from 44 submissions. The conference provides the opportunity to present a wider range of results and ideas that are of interest to the KI audience, including reports about recent own publications, position papers, and previews of ongoing work.