We conduct a computational analysis of fair and optimal partitions in additively separable hedonic games. We show that, for strict preferences, a Pareto optimal partition can be found in polynomial time while verifying whether a given partition is Pareto optimal is coNP-complete, even when preferences are symmetric and strict. Moreover, computing a partition with maximum egalitarian or utilitar...

We study the problem of designing envy-free sponsored search auctions, where bidders are budgetconstrained. Our primary goal is to design auctions that maximize social welfare and revenue — two classical objectives in auction theory. For this purpose, we characterize envy-freeness with budgets by proving several elementary properties including consistency, monotonicity and transitivity. Based o...

Cloutier, Nyman, and Su (Mathematical Social Sciences 59 (2005), 26–37) initiated the study of envy-free cake-cutting problems involving several cakes. The classical result in this area is that when there are q players and one cake, an envy-free cake-division requiring only q − 1 cuts exists under weak and natural assumptions. Among other results, Cloutier, Nyman, and Su showed that when there ...

Drawing from victim precipitation, social comparison, and identity theories, this study develops and tests an integrative model of the victimization of high-performing employees. We examine envy as an explanatory mechanism of the victimization of high performers from fellow group members and propose work group identification as a moderator of this envy mechanism. Study 1, in a sample of 4,874 u...

We consider the envy-free pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will buy the product maximizing her personal utility, i.e., the difference between her respective budget and the product’s price. We show that assuming specific hardness of the balanced bipartite independent set pro...

We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A group of agents may only contract a deal if that group is fully connected according to the negotiation topology. An important criterion for assessing the quality of an allocation of resources, in terms of fairness, is env...

Materialistic youth seem to be languishing while grateful youth seem to be flourishing. High school students (N = 1,035) completed measures of materialism, gratitude, academic functioning, envy, depression, life satisfaction, social integration, and absorption. Using structural equation modeling, we found that gratitude, controlling for materialism, uniquely predicts all outcomes considered: hi...

In economics the main efficiency criterion is that of Pareto-optimality. For problems of distributing a social endowment a central notion of fairness is no-envy (each agent should receive a bundle at least as good, according to her own preferences, as any of the other agent’s bundle). For most economies there are multiple allocations satisfying these two properties. We provide a procedure, base...

Envy-freeness is a widely studied notion in resource allocation, capturing some aspects of fairness. The envy being inherently subjective though, it might be the case that an agent envies another agent, but from other agents' point view, she has no reason to do so. difficulty here define objectivity, since ground-truth can properly serve as basis this definition. A natural approach consider jud...