English
Related papers

Related papers: Social Choice with Non Quasi-linear Utilities

200 papers

Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…

Logic · Mathematics 2023-11-17 Alex Hall

Traditional studies of combinatorial auctions often only consider linear constraints. The rise of smart grid presents a new class of auctions, characterized by quadratic constraints. This paper studies the {\em complex-demand knapsack…

Computer Science and Game Theory · Computer Science 2017-09-25 Chi-Kin Chau , Khaled Elbassioni , Majid Khonji

The choice of admissible trading strategies in mathematical modelling of financial markets is a delicate issue, going back to Harrison and Kreps (1979). In the context of optimal portfolio selection with expected utility preferences this…

Computational Finance · Quantitative Finance 2017-07-25 Sara Biagini , Aleš Černý

We give a definitive treatment of duality for optimal consumption over the infinite horizon, in a semimartingale incomplete market satisfying no unbounded profit with bounded risk (NUPBR). Rather than base the dual domain on (local)…

Portfolio Management · Quantitative Finance 2021-12-21 Michael Monoyios

Renewable power sources have low marginal pro-duction costs, but may result in high balancing costs due to the inherent production uncertainty. Current day-ahead markets elicit only point production profiles and neglect the degree of…

Systems and Control · Electrical Eng. & Systems 2026-04-06 Shobhit Singhal , Lesia Mitridati , Licio Romao

We study a general robust utility maximization problem in a discrete-time frictionless market. The investor is assumed to have a possibly infinite, random, nonconcave, and nondecreasing utility function defined on the whole real line. She…

Mathematical Finance · Quantitative Finance 2025-10-14 Laurence Carassus , Massinissa Ferhoune

We propose a new version of the scalar Weak Gravity Conjecture (WGC) which would apply to any scalar field coupled to quantum gravity. For a single scalar it is given by the differential constraint $V''\leq…

High Energy Physics - Theory · Physics 2019-10-02 Eduardo Gonzalo , Luis E. Ibáñez

The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many…

Computer Science and Game Theory · Computer Science 2013-10-14 Paul Duetting , Monika Henzinger , Martin Starnberger

Profit maximization (PM) is to select a subset of users as seeds for viral marketing in online social networks, which balances between the cost and the profit from influence spread. We extend PM to that under the general marketing strategy,…

Social and Information Networks · Computer Science 2021-03-16 Jianxiong Guo , Weili Wu

We study social choice rules under the utilitarian distortion framework, with an additional metric assumption on the agents' costs over the alternatives. In this approach, these costs are given by an underlying metric on the set of all…

Computer Science and Game Theory · Computer Science 2021-01-15 Ashish Goel , Anilesh Kollagunta Krishnaswamy , Kamesh Munagala

Random utility maximisation (RUM) models are one of the cornerstones of discrete choice modelling. However, specifying the utility function of RUM models is not straightforward and has a considerable impact on the resulting interpretable…

Machine Learning · Statistics 2024-04-23 Jose Ignacio Hernandez , Niek Mouter , Sander van Cranenburgh

It is generally believed that submodular functions -- and the more general class of $\gamma$-weakly submodular functions -- may only be optimized under the non-negativity assumption $f(S) \geq 0$. In this paper, we show that once the…

Data Structures and Algorithms · Computer Science 2019-04-23 Christopher Harshaw , Moran Feldman , Justin Ward , Amin Karbasi

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

Consider a university assigning students to courses and dorms. While many mechanisms are available, they each have their own drawbacks. Running serial dictatorship once for all goods is highly unfair, but running serial dictatorship…

Theoretical Economics · Economics 2026-03-19 Eric Gao

This paper establishes alternative characterizations of very expressive classes of existential rule sets with decidable query entailment. We consider the notable class of greedy bounded-treewidth sets (gbts) and a new, generalized variant,…

Logic in Computer Science · Computer Science 2023-07-19 Tim S. Lyon , Sebastian Rudolph

A model for decision making that generalizes Expected Utility Maximization is presented. This model, Expected Qualitative Utility Maximization, encompasses the Maximin criterion. It relaxes both the Independence and the Continuity…

Computer Science and Game Theory · Computer Science 2007-05-23 Daniel Lehmann

This paper develops a novel characterization for random utility models (RUM), which turns out to be a dual representation of the characterization by Kitamura and Stoye (2018, ECMA). For a given family of budgets and its "patch"…

Theoretical Economics · Economics 2024-06-19 Nobuo Koida , Koji Shirai

In the problem of allocating a single non-disposable commodity among agents whose preferences are single-peaked, we study a weakening of strategy-proofness called not obvious manipulability (NOM). If agents are cognitively limited, then NOM…

Theoretical Economics · Economics 2024-04-25 R. Pablo Arribillaga , Agustin G. Bonifacio

Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…

Combinatorics · Mathematics 2022-09-09 Sarah E. Anderson , Kirsti Kuenzel , Houston Schuerger

We study the problem of aggregating distributions, such as budget proposals, into a collective distribution. An ideal aggregation mechanism would be Pareto efficient, strategyproof, and fair. Most previous work assumes that agents evaluate…

Theoretical Economics · Economics 2025-12-24 Felix Brandt , Matthias Greger , Erel Segal-Halevi , Warut Suksompong