Effective algorithms for homogeneous utility functions

12/29/2017
by   Alexander Shananin, et al.
0

Under the assumption of (positive) homogeneity (PH in the sequel) of the corresponding utility functions, we construct polynomial time algorithms for the weak separability, the collective consumption behavior and some related problems. These problems are known to be at least NP-hard if the homogeneity assumption is dropped. Keywords: the utility function, the economic indices theory, the collective axiom of revealed preference, the weak separability property, the class of the differential form of the demand.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2020

Belief-Averaged Relative Utilitarianism

We study preference aggregation under uncertainty when individual and co...
research
12/04/2021

A refined consumer behavior model for energy systems: Application to the pricing and energy-efficiency problems

The sum-utility maximization problem is known to be important in the ene...
research
08/20/2019

New developments in revealed preference theory: decisions under risk, uncertainty, and intertemporal choice

The chapter reviews recent developments in revealed preference theory. I...
research
10/05/2020

Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard

Weak unit disk contact graphs are graphs that admit a representation of ...
research
05/24/2022

On Hedonic Games with Common Ranking Property

Hedonic games are a prominent model of coalition formation, in which eac...
research
06/20/2017

The Complexity of Campaigning

In "The Logic of Campaigning", Dean and Parikh consider a candidate maki...

Please sign up or login with your details

Forgot password? Click here to reset