DeepAI AI Chat
Log In Sign Up

Utilitarians Without Utilities: Maximizing Social Welfare for Graph Problems using only Ordinal Preferences - Full Version

by   Ben Abramowitz, et al.
Rensselaer Polytechnic Institute

We consider ordinal approximation algorithms for a broad class of utility maximization problems for multi-agent systems. In these problems, agents have utilities for connecting to each other, and the goal is to compute a maximum-utility solution subject to a set of constraints. We represent these as a class of graph optimization problems, including matching, spanning tree problems, TSP, maximum weight planar subgraph, and many others. We study these problems in the ordinal setting: latent numerical utilities exist, but we only have access to ordinal preference information, i.e., every agent specifies an ordering over the other agents by preference. We prove that for the large class of graph problems we identify, ordinal information is enough to compute solutions which are close to optimal, thus demonstrating there is no need to know the underlying numerical utilities. For example, for problems in this class with bounded degree b a simple ordinal greedy algorithm always produces a (b+1)-approximation; we also quantify how the quality of ordinal approximation depends on the sparsity of the resulting graphs. In particular, our results imply that ordinal information is enough to obtain a 2-approximation for Maximum Spanning Tree; a 4-approximation for Max Weight Planar Subgraph; a 2-approximation for Max-TSP; and a 2-approximation for various Matching problems.


page 1

page 2

page 3

page 4


Truthful Mechanisms for Matching and Clustering in an Ordinal World

We study truthful mechanisms for matching and related problems in a part...

Blind, Greedy, and Random: Ordinal Approximation Algorithms for Matching and Clustering

We study Matching and other related problems in a partial information se...

Ordinal Approximation for Social Choice, Matching, and Facility Location Problems given Candidate Positions

In this work we consider general facility location and social choice pro...

Facility Location Games with Ordinal Preferences

We consider a new setting of facility location games with ordinal prefer...

Improving Welfare in One-sided Matching using Simple Threshold Queries

We study one-sided matching problems where n agents have preferences ove...

Unstructuring User Preferences: Efficient Non-Parametric Utility Revelation

Tackling the problem of ordinal preference revelation and reasoning, we ...

On Quasi Ordinal Diagram Systems

The purposes of this note are the following two; we first generalize Oka...