Concepts inThe computational complexity of choice sets
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer (which basically means that the problem can be stated by a set of mathematical instructions).
more from Wikipedia
Choice set
A choice set is one scenario, also known as a treatment, provided for evaluation by respondents in a choice experiment. Responses are collected and used to create a choice model. Respondents are usually provided with a series of differing choice sets for evaluation. The choice set is generated from an experimental design and usually involves two or more alternatives being presented together.
more from Wikipedia
Condorcet criterion
The Condorcet candidate or Condorcet winner of an election is the candidate who, when compared with every other candidate, is preferred by more voters. Informally, the Condorcet winner is the person who would win a two-candidate election against each of the other candidates. A Condorcet winner will not always exist in a given set of votes, which is known as Condorcet's voting paradox.
more from Wikipedia
Preference (economics)
In economics and other social sciences, preference refers to the set of assumptions related to ordering some alternatives, based on the degree of happiness, satisfaction, gratification, enjoyment, or utility they provide, a process which results in an optimal "choice" (whether real or imagined). Although economists are usually not interested in choices or preferences in themselves, they are interested in the theory of choice because it serves as a background for empirical demand analysis.
more from Wikipedia
Symmetric relation
In mathematics, a binary relation R over a set X is symmetric if it holds for all a and b in X that if a is related to b then b is related to a. In mathematical notation, this is: Note: symmetry is not the exact opposite of antisymmetry (aRb and bRa implies b = a).
more from Wikipedia
Social choice theory
Social choice theory is a theoretical framework for measuring individual interests, values, or welfares as an aggregate towards collective decision. A non-theoretical example of a collective decision is passing a set of laws under a constitution. Social choice theory dates from Condorcet's formulation of the voting paradox. Kenneth Arrow's Social Choice and Individual Values (1951) and the Arrow's impossibility theorem are generally acknowledged as the basis of the modern social choice theory.
more from Wikipedia
Cooperative game
This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ("coalitions") may enforce cooperative behaviour, hence the game is a competition between coalitions of players, rather than between individual players. An example is a coordination game, when players choose the strategies by a consensus decision-making process.
more from Wikipedia
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices such that for every two vertices in I, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in I. The size of an independent set is the number of vertices it contains. A maximal independent set is an independent set such that adding any other vertex to the set forces the set to contain an edge.
more from Wikipedia