Related papers: Social Choice with Non Quasi-linear Utilities
A preference domain is called a non-dictatorial domain if it allows the design of unanimous social choice functions (henceforth, rules) that are non-dictatorial and strategy-proof. We study a class of preference domains called…
We consider a \emph{Social Group} of networked nodes, seeking a "universe" of segments for maximization of their utility. Each node has a subset of the universe, and access to an expensive link for downloading data. Nodes can also acquire…
We propose generalized versions of strong equity and Pigou-Dalton transfer principle. We study the existence and the real valued representation of social welfare relations satisfying these two generalized equity principles. Our results…
Most agent-based models include a social network that describes the structure of interactions within the artificial population. Because of the dramatic impact of this structure on the simulated dynamics, modelers create this network for it…
We study mechanism design in environments where agents have private preferences and private information about a common payoff-relevant state. In such settings with multi-dimensional types, standard mechanisms fail to implement efficient…
In this work, we investigate the amount of energy that can be extracted or charged through unitary operations when only minimal information about the state is known. Assuming knowledge of only the mean energy of the state, we start by…
In the field of Judgment Aggrgation, a domain, that is a subset of a Cartesian power of $\{0,1\}$, is considered to reflect abstract rationality restrictions on vectors of two-valued judgments on a number of issues. We are interested in the…
We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms…
When allocating indivisible items to agents, it is known that the only strategyproof mechanisms that satisfy a set of rather mild conditions are constrained serial dictatorships: given a fixed order over agents, at each step the designated…
We consider strategy proof mechanisms for facility location which maximize equitability between agents. As is common in the literature, we measure equitability with the Gini index. We first prove a simple but fundamental impossibility…
We consider the allocation of indivisible objects when agents have preferences over their own allocations, but share the ownership of the resources to be distributed. Examples might include seats in public schools, faculty offices, and time…
This paper introduces the theoretical framework for combining Vickrey-Clarke-Groves (VCG) mechanisms with the Consensus Planning Protocol (CPP) to enable truthful and efficient collaboration between a retailer and vendors to lower joint…
We study a budget aggregation setting where voters express their preferred allocation of a fixed budget over a set of alternatives, and a mechanism aggregates these preferences into a single output allocation. Motivated by scenarios in…
Priority-based allocation of individuals to positions are pervasive, and elimination of justified envy is often, an absolute requirement. This leaves serial dictatorship (SD) as the only rule that avoids justified envy under standard direct…
We study efficiency and budget balance for designing mechanisms in general quasi-linear domains. Green and Laffont (1979) proved that one cannot generically achieve both. We consider strategyproof budget-balanced mechanisms that are…
We investigate the performance of the standard Greedy algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of Greedy for…
We consider non-concave and non-smooth random utility functions with do- main of definition equal to the non-negative half-line. We use a dynamic pro- gramming framework together with measurable selection arguments to establish both the…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
Games with continuous strategy sets arise in several machine learning problems (e.g. adversarial learning). For such games, simple no-regret learning algorithms exist in several cases and ensure convergence to coarse correlated equilibria…
We establish an operational characterization of general convex resource theories -- describing the resource content of not only states, but also measurements and channels, both within quantum mechanics and in general probabilistic theories…