In economics, dichotomous preferences (DP) are preference relations that divide the set of alternatives to two subsets, "Good" and "Bad".
From ordinal utility perspective, DP means that for every two alternatives : [1] : 292
From cardinal utility perspective, DP means that for each agent, there are two utility levels: low and high, and for every alternative :
A common way to let people express dichotomous preferences is using approval ballots, in which each voter can either "approve" or "reject" each alternative.
Exactly-dichotomous preferences are uncommon, but can be a useful approximation of voters' behaviors in two-party systems or when voters support candidates if and only if they share a party. Single-winner voting rules that satisfy independence of irrelevant alternatives are strategyproof with dichotomous preferences.
In the context of fair item assignment, DP can be represented by a mathematical logic formula: [1] : 292 for every agent, there is a formula that describes his desired bundles. An agent is satisfied if-and-only-if he receives a bundle that satisfies the formula.
A special case of DP is single-mindedness. A single-minded agent wants a very specific bundle; he is happy if-and-only-if he receives this bundle, or any bundle that contains it. Such preferences appear in real-life, for example, in the problem of allocating classrooms to schools: each school i needs a number di of classes; the school has utility 1 if it gets all di classes in the same place and 0 otherwise. [2] [3] [4]
Suppose a mechanism selects a lottery over outcomes. The utility of each agent, under this mechanism, is the probability that one of his Good outcomes is selected. The utilitarian mechanism averages over outcomes with the highest approval ratings. It is Pareto efficient, strategyproof, fair to voters, and fair to candidates.
However, it is impossible to achieve all of these properties in addition to proportionality, and as a result proportional representation systems cannot be strategyproof with dichotomous preferences. [5]
Suppose all agents have DP cardinal utility, where each agent is characterized by a single number so that . Then a condition called generation monotonicity[ jargon ] is necessary and sufficient for implementation by a truthful mechanisms in any dichotomous domain (see Monotonicity (mechanism design)). [6] If such a domain satisfies a richness condition,[ jargon ] then a weaker version of generation monotonicity, 2-generation monotonicity (equivalent to 3-cycle monotonicity), is necessary and sufficient for implementation.[ citation needed ] This result can be used to derive the optimal mechanism in a one-sided matching problem with agents who have dichotomous types.[ citation needed ][ further explanation needed ]
In economics, utility is a measure of the satisfaction that a certain person has from a certain state of the world. Over time, the term has been used in at least two different meanings.
In economics, an indifference curve connects points on a graph representing different quantities of two goods, points between which a consumer is indifferent. That is, any combinations of two products indicated by the curve will provide the consumer with equal levels of utility, and the consumer has no preference for one combination or bundle of goods over a different combination on the same curve. One can also refer to each point on the indifference curve as rendering the same level of utility (satisfaction) for the consumer. In other words, an indifference curve is the locus of various points showing different combinations of two goods providing equal utility to the consumer. Utility is then a device to represent preferences rather than something from which preferences come. The main use of indifference curves is in the representation of potentially observable demand patterns for individual consumers over commodity bundles.
A random ballot or random dictatorship is a randomized electoral system where the election is decided on the basis of a single randomly-selected ballot. A closely-related variant is called random serialdictatorship, which repeats the procedure and draws another ballot if multiple candidates are tied on the first ballot.
In mechanism design, a strategyproof (SP) mechanism is a game form in which each player has a weakly-dominant strategy, so that no player can gain by "spying" over the other players to know what they are going to play. When the players have private information, and the strategy space of each player consists of the possible information values, a truthful mechanism is a game in which revealing the true information is a weakly-dominant strategy for each player. An SP mechanism is also called dominant-strategy-incentive-compatible (DSIC), to distinguish it from other kinds of incentive compatibility.
In economics, an ordinal utility function is a function representing the preferences of an agent on an ordinal scale. Ordinal utility theory claims that it is only meaningful to ask which option is better than the other, but it is meaningless to ask how much better it is or how good it is. All of the theory of consumer decision-making under conditions of certainty can be, and typically is, expressed in terms of ordinal utility.
In mechanism design, monotonicity is a property of a social choice function. It is a necessary condition for being able to implement such a function using a strategyproof mechanism. Its verbal description is:
If changing one agent's type changes the outcome under the social choice function, then the resulting difference in utilities of the new and original outcomes evaluated at the new type of this agent must be at least as much as this difference in utilities evaluated at the original type of this agent.
Rental harmony is a kind of a fair division problem in which indivisible items and a fixed monetary cost have to be divided simultaneously. The housemates problem and room-assignment-rent-division are alternative names to the same problem.
Fisher market is an economic model attributed to Irving Fisher. It has the following ingredients:
Envy-free (EF) item allocation is a fair item allocation problem, in which the fairness criterion is envy-freeness - each agent should receive a bundle that they believe to be at least as good as the bundle of any other agent.
Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is a procedure for fair item assignment. It was developed by Eric Budish.
In utility theory, the responsive set (RS) extension is an extension of a preference-relation on individual items, to a partial preference-relation of item-bundles.
Random priority (RP), also called Random serial dictatorship (RSD), is a procedure for fair random assignment - dividing indivisible items fairly among people.
Combinatorial participatory budgeting,also called indivisible participatory budgeting or budgeted social choice, is a problem in social choice. There are several candidate projects, each of which has a fixed costs. There is a fixed budget, that cannot cover all these projects. Each voter has different preferences regarding these projects. The goal is to find a budget-allocation - a subset of the projects, with total cost at most the budget, that will be funded. Combinatorial participatory budgeting is the most common form of participatory budgeting.
When allocating objects among people with different preferences, two major goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single house and two people, every allocation of the house will be unfair to one person. Therefore, several common approximations have been studied, such as maximin-share fairness (MMS), envy-freeness up to one item (EF1), proportionality up to one item (PROP1), and equitability up to one item (EQ1). The problem of efficient approximately fair item allocation is to find an allocation that is both Pareto-efficient (PE) and satisfies one of these fairness notions. The problem was first presented at 2016 and has attracted considerable attention since then.
Market equilibrium computation is a computational problem in the intersection of economics and computer science. The input to this problem is a market, consisting of a set of resources and a set of agents. There are various kinds of markets, such as Fisher market and Arrow–Debreu market, with divisible or indivisible resources. The required output is a competitive equilibrium, consisting of a price-vector, and an allocation, such that each agent gets the best bundle possible given the budget, and the market clears.
Fractional social choice is a branch of social choice theory in which the collective decision is not a single alternative, but rather a weighted sum of two or more alternatives. For example, if society has to choose between three candidates: A B or C, then in standard social choice, exactly one of these candidates is chosen, while in fractional social choice, it is possible to choose "2/3 of A and 1/3 of B".
In fractional social choice, fractional approval voting refers to a class of electoral systems using approval ballots, in which the outcome is fractional: for each alternative j there is a fraction pj between 0 and 1, such that the sum of pj is 1. It can be seen as a generalization of approval voting: in the latter, one candidate wins and the other candidates lose. The fractions pj can be interpreted in various ways, depending on the setting. Examples are:
Budget-proposal aggregation (BPA) is a problem in social choice theory. A group has to decide on how to distribute its budget among several issues. Each group-member has a different idea about what the ideal budget-distribution should be. The problem is how to aggregate the different opinions into a single budget-distribution program.
Donor coordination is a problem in social choice. There are several donors, each of whom wants to donate some money. Each donor supports a different set of targets. The goal is to distribute the total donated amount among the various targets in a way that respects the donors' preferences.
The median voting rule or median mechanism is a rule for group decision-making along a one-dimensional domain. Each person votes by writing down his/her ideal value, and the rule selects a single value which is the median of all votes.