skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.


This content will become publicly available on October 16, 2024

Title: Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach
Award ID(s):
2207548
NSF-PAR ID:
10521266
Author(s) / Creator(s):
;
Publisher / Repository:
ACM
Date Published:
ISBN:
9781450399265
Page Range / eLocation ID:
131 to 140
Format(s):
Medium: X
Location:
Washington DC USA
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Convenient assumptions about qualitative properties of the intertemporal utility function have generated counterintuitive implications for the relationship between atemporal risk aversion and the intertemporal elasticity of substitution. If the intertemporal utility function is additively separable, then the latter two concepts are the inverse of each other. We review a theoretical specification with a long lineage in the literature on multi‐attribute utility and use this theoretical structure to guide the design of a series of experiments that allow us to identify and estimate intertemporal correlation aversion. Our results show that subjects are correlation averse over lotteries with intertemporal income profiles.

     
    more » « less
  2. Abstract

    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 utility (EU) theory, under the assumption of risk aversion. The number e can then be used as a measure of how far the data is to EU theory. We apply our methodology to data from three large-scale experiments. Many subjects in these experiments are consistent with utility maximization, but not with EU maximization. Our measure of distance to expected utility is correlated with the subjects’ demographic characteristics.

     
    more » « less
  3. Fair resource allocation is one of the most important topics in communication networks. Existing solutions almost exclusively assume each user utility function is known and concave. This paper seeks to answer the following question: how to allocate resources when utility functions are unknown, even to the users? This answer has become increasingly important in the next-generation AI-aware communication networks where the user utilities are complex and their closed-forms are hard to obtain. In this paper, we provide a new solution using a distributed and data-driven bilevel optimization approach, where the lower level is a distributed network utility maximization (NUM) algorithm with concave surrogate utility functions, and the upper level is a data-driven learning algorithm to find the best surrogate utility functions that maximize the sum of true network utility. The proposed algorithm learns from data samples (utility values or gradient values) to autotune the surrogate utility functions to maximize the true network utility, so works for unknown utility functions. For the general network, we establish the nonasymptotic convergence rate of the proposed algorithm with nonconcave utility functions. The simulations validate our theoretical results and demonstrate the great effectiveness of the proposed method in a real-world network. 
    more » « less