scholarly journals Fair Division: The Computer Scientist’s Perspective

2020 ◽  
Author(s):  
Toby Walsh
Keyword(s):  
Game Theory ◽  
Computational Complexity ◽  
Knowledge Representation ◽  
Social Choice ◽  
Recent Progress ◽  
Communication Complexity ◽  
Fair Division ◽  
Approximation Methods ◽  
Challenging Problem ◽  
Computational Perspective

I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide items fairly and efficiently. This has involved bringing to bear tools such as those used in knowledge representation, computational complexity, approximation methods, game theory, online analysis and communication complexity.

scholarly journals Studies of Electron-Molecule Collisions on Distributed-memory Parallel Computers

1992 ◽  
Vol 45 (3) ◽  
pp. 325 ◽  
Author(s):  
Carl Winstead ◽  
Qiyan Sun ◽  
Paul G Hipes ◽  
Marco AP Lima ◽  
Vincent McKoy
Keyword(s):  
Distributed Memory ◽  
Recent Progress ◽  
Cost Effective ◽  
Parallel Computers ◽  
Polyatomic Molecules ◽  
Low Energy ◽  
Materials Processing ◽  
Challenging Problem ◽  
Molecular Systems ◽  
Critical Data

We review recent progress in the study of low-energy collisions between electrons and polyatomic molecules which has resulted from the application of distributed-memory parallel computing to this challenging problem. Recent studies of electronically elastic and inelastic scattering from several molecular systems, including ethene, propene, cyclopropane, and disilane, are presented. We also discuss the potential of ab initio methods combined with cost-effective parallel computation to provide critical data for the modeling of materials-processing plasmas.

scholarly journals Distributive Justice: From Steinhaus, Knaster, and Banach to Elster and Rawls — The Perspective of Sociological Game Theory

2014 ◽  
Vol 37 (1) ◽  
pp. 11-38 ◽  
Author(s):  
Tom Burns ◽  
Ewa Roszkowska ◽  
Nora Machado des Johansson
Keyword(s):  
Game Theory ◽  
Distributive Justice ◽  
Social Organization ◽  
Fair Division ◽  
Theoretical Framework ◽  
Human Judgment ◽  
Key Concepts ◽  
Point Of Departure ◽  
Organization Section

Abstract This article presents a relatively straightforward theoretical framework about distributive justice with applications. It draws on a few key concepts of Sociological Game Theory (SGT). SGT is presented briefly in section 2. Section 3 provides a spectrum of distributive cases concerning principles of equality, differentiation among recipients according to performance or contribution, status or authority, or need. Two general types of social organization of distributive judgment are distinguished and judgment procedures or algorithms are modeled in each type of social organization. Section 4 discusses briefly the larger moral landscapes of human judgment – how distribution may typically be combined with other value into consideration. The article suggests that Rawls, Elster, and Machado point in this direction. Finally, it is suggested that the SGT framework presented provides a useful point of departure to systematically link it and compare the Warsaw School of Fair Division, Rawls, and Elster, among others.

scholarly journals Knowledge Representation of Highly Dynamic Ontologies Using Defeasible Logic

2021 ◽  
Vol 10 (2) ◽  
pp. 948-954
Keyword(s):  
Computational Complexity ◽  
Knowledge Representation ◽  
Knowledge Base ◽  
Description Logic ◽  
Defeasible Logic ◽  
Small Domain ◽  
Automated Support ◽  
Logical Rules

Description logic gives us the ability of reasoning with acceptable computational complexity with retaining the power of expressiveness. The power of description logic can be accompanied by the defeasible logic to manage non-monotonic reasoning. In some domains, we need flexible reasoning and knowledge representation to deal the dynamicity of such domains. In this paper, we present a DL representation for a small domain that describes the connections between different entities in a university publication system to show how could we deal with changeability in domain rules. An automated support can be provided on the basis of defeasible logical rules to represent the typicality in the knowledge base and to solve the conflicts that might happen.

scholarly journals A Computational Perspective on Network Coding

2010 ◽  
Vol 2010 ◽  
pp. 1-11
Author(s):  
Qin Guo ◽  
Mingxing Luo ◽  
Lixiang Li ◽  
Yixian Yang
Keyword(s):  
Graph Theory ◽  
Computational Complexity ◽  
Lower Bound ◽  
Network Coding ◽  
Upper Bound ◽  
Upper Bounds ◽  
Lower And Upper Bounds ◽  
Multicast Networks ◽  
Computational Perspective ◽  
Source Rate

From the perspectives of graph theory and combinatorics theory we obtain some new upper bounds on the number of encoding nodes, which can characterize the coding complexity of the network coding, both in feasible acyclic and cyclic multicast networks. In contrast to previous work, during our analysis we first investigate the simple multicast network with source rateh=2, and thenh≥2. We find that for feasible acyclic multicast networks our upper bound is exactly the lower bound given by M. Langberg et al. in 2006. So the gap between their lower and upper bounds for feasible acyclic multicast networks does not exist. Based on the new upper bound, we improve the computational complexity given by M. Langberg et al. in 2009. Moreover, these results further support the feasibility of signatures for network coding.

scholarly journals QUANTUM MECHANISM HELPS AGENTS COMBAT "BAD" SOCIAL CHOICE RULES

2011 ◽  
Vol 09 (01) ◽  
pp. 615-623 ◽  
Author(s):  
HAOYANG WU
Keyword(s):  
Game Theory ◽  
Social Choice ◽  
Mechanism Design ◽  
Design Theory ◽  
Reverse Problem ◽  
Quantum Domain ◽  
Quantum Mechanism ◽  
Social Choice Rules ◽  
Quantum Strategies

Quantum strategies have been successfully applied to game theory for years. However, as a reverse problem of game theory, the theory of mechanism design is ignored by physicists. In this paper, the theory of mechanism design is generalized to a quantum domain. The main result is that by virtue of a quantum mechanism, agents who satisfy a certain condition can combat "bad" social choice rules instead of being restricted by the traditional mechanism design theory.

Game theory and social choice

1982 ◽  
Vol 3 (4) ◽  
pp. 407-409
Author(s):  
Mamoru Kaneko ◽  
F.W. Roush
Keyword(s):  
Game Theory ◽  
Social Choice

scholarly journals Computational Social Choice Meets Databases

2018 ◽  
Author(s):  
Benny Kimelfeld ◽  
Phokion G. Kolaitis ◽  
Julia Stoyanovich
Keyword(s):  
Computational Complexity ◽  
Social Choice ◽  
Relational Database ◽  
Database Management ◽  
Plurality Rule ◽  
Technical Level ◽  
Computational Social Choice ◽  
Conceptual Level ◽  
Voting Rules ◽  
Conjunctive Queries

We develop a novel framework that aims to create bridges between the computational social choice and the database management communities. This framework enriches the tasks currently supported in computational social choice with relational database context, thus making it possible to formulate sophisticated queries about voting rules, candidates, voters, issues, and positions. At the conceptual level, we give rigorous semantics to queries in this framework by introducing the notions of necessary answers and possible answers to queries. At the technical level, we embark on an investigation of the computational complexity of the necessary answers. In particular, we establish a number of results about the complexity of the necessary answers of conjunctive queries involving the plurality rule that contrast sharply with earlier results about the complexity of the necessary winners under the plurality rule.

Sign in / Sign up

Export Citation Format

Share Document