English
Related papers

Related papers: Multidimensional Bayesian Utility Maximization: Ti…

200 papers

This article presents a pragmatic framework for making formal, utility-based decisions from statistical inferences. The method calculates an expected utility score for an intervention by combining Bayesian posterior probabilities of…

Methodology · Statistics 2025-11-11 Will G. Hopkins

We are often interested in identifying the feasible subset of a decision space under multiple constraints to permit effective design exploration. If determining feasibility required computationally expensive simulations, the cost of…

Machine Learning · Computer Science 2020-06-25 Alma Rahat , Michael Wood

We study coverage problems in which, for a set of agents and a given threshold $T$, the goal is to select $T$ subsets (of the agents) that, while satisfying combinatorial constraints, achieve fair and efficient coverage among the agents. In…

Computer Science and Game Theory · Computer Science 2022-07-06 Siddharth Barman , Anand Krishna , Y. Narahari , Soumyarup Sadhukhan

We propose a new measure of deviations from expected utility theory. For any positive number~$e$, we give a characterization of the datasets with a rationalization that is within~$e$ (in beliefs, utility, or perceived prices) of expected…

General Economics · Economics 2021-02-15 Federico Echenique , Kota Saito , Taisuke Imai

We study social welfare in one-sided matching markets where the goal is to efficiently allocate n items to n agents that each have a complete, private preference list and a unit demand over the items. Our focus is on allocation mechanisms…

Computer Science and Game Theory · Computer Science 2011-04-18 Anand Bhalgat , Deeparnab Chakrabarty , Sanjeev Khanna

Mechanism design for a social utility being the sum of agents' utilities (SoU) is a well-studied problem. There are, however, a number of problems of theoretical and practical interest where a designer may have a different objective than…

Computer Science and Game Theory · Computer Science 2015-09-29 Abhinav Sinha , Achilleas Anastasopoulos

We introduce a general approach based on \emph{selective verification} and obtain approximate mechanisms without money for maximizing the social welfare in the general domain of utilitarian voting. Having a good allocation in mind, a…

Computer Science and Game Theory · Computer Science 2015-07-10 Dimitris Fotakis , Christos Tzamos , Emmanouil Zampetakis

We consider the problem of helping agents improve by setting short-term goals. Given a set of target skill levels, we assume each agent will try to improve from their initial skill level to the closest target level within reach or do…

Computer Science and Game Theory · Computer Science 2022-03-02 Saba Ahmadi , Hedyeh Beyhaghi , Avrim Blum , Keziah Naggita

Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat other domain attributes: as a random variable with a density…

Artificial Intelligence · Computer Science 2013-01-18 Urszula Chajewska , Daphne Koller

We revisit the foundations of fairness and its interplay with utility and efficiency in settings where the training data contain richer labels, such as individual types, rankings, or risk estimates, rather than just binary outcomes. In this…

Machine Learning · Computer Science 2025-05-23 Noga Amit , Omer Reingold , Guy N. Rothblum

We study information design in multi-agent systems (MAS) with binary actions and strategic complementarities, where an external designer influences behavior only through signals. Agents play the smallest-equilibrium of the induced Bayesian…

Computer Science and Game Theory · Computer Science 2026-02-27 Farzaneh Farhadi , Maria Chli

The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016…

Computer Science and Game Theory · Computer Science 2020-12-08 Xiaowei Wu , Bo Li , Jiarui Gan

In non-truthful auctions, agents' utility for a strategy depends on the strategies of the opponents and also the prior distribution over their private types; the set of Bayes Nash equilibria generally has an intricate dependence on the…

Computer Science and Game Theory · Computer Science 2022-11-02 Hu Fu , Tao Lin

In this paper, we present new results on the fair and efficient allocation of indivisible goods to agents whose preferences correspond to {\em matroid rank functions}. This is a versatile valuation class with several desirable properties…

Artificial Intelligence · Computer Science 2021-06-21 Nawal Benabbou , Mithun Chakraborty , Ayumi Igarashi , Yair Zick

This paper studies the efficiency of battery storage operations in electricity markets by comparing the social welfare gain achieved by a central planner to that of a decentralized profit-maximizing operator. The problem is formulated in a…

Computer Science and Game Theory · Computer Science 2026-02-24 Zhile Jiang , Xinhao Nie , Stratis Skoulakis

Social goods are goods that grant value not only to their owners but also to the owners' surroundings, be it their families, friends or office mates. The benefit a non-owner derives from the good is affected by many factors, including the…

Computer Science and Game Theory · Computer Science 2017-07-04 Alon Eden , Tomer Ezra , Michal Feldman

We study the problem of a seller dynamically pricing $d$ distinct types of indivisible goods, when faced with the online arrival of unit-demand buyers drawn independently from an unknown distribution. The goods are not in limited supply,…

Data Structures and Algorithms · Computer Science 2017-06-13 Aaron Roth , Aleksandrs Slivkins , Jonathan Ullman , Zhiwei Steven Wu

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

Computer Science and Game Theory · Computer Science 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla

This paper considers prior-independent mechanism design, namely identifying a single mechanism that has near optimal performance on every prior distribution. We show that mechanisms with truthtelling equilibria, a.k.a., revelation…

Computer Science and Game Theory · Computer Science 2018-08-01 Yiding Feng , Jason D. Hartline

According to the proportional allocation mechanism from the network optimization literature, users compete for a divisible resource -- such as bandwidth -- by submitting bids. The mechanism allocates to each user a fraction of the resource…

Computer Science and Game Theory · Computer Science 2014-02-17 Ioannis Caragiannis , Alexandros A. Voudouris