Approximating Constraint-Based Utility Spaces Using Generalized Gaussian Mixture Models
Complex negotiations are characterized by a particular type of utility spaces that is usually non-linear and non-monotonic. An example of such utility spaces are constraint-based utility spaces. The multitude of constraints’ shapes that could potentially be used by the negotiating agents makes any opponent modeling attempt more challenging. The same problem persists even when the agent is exploring her own utility space as to find her optimal contracts. Seeking a unified form for constraint-based utility representation might shed some light on how to tackle these problems. In this paper, we propose to find an approximation for constraint-based preferences, used mainly in complex negotiation with non-linear utility spaces. The proposed approximation yields a compact form that unifies a whole family of constraints (Cubic, Bell, Conic, etc.). Results show that the new canonical form can in fact be an alternative representation for all known constraint-based utility functions. Additionally, it leads us to a potential parametric model that could be used for opponent modeling in complex non-linear negotiations.
Code (1)
Tasks
FormSimilar Papers 제목 키워드 기반
Generalized maximum entropy estimation
We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we …
Approximating Gaussian Process Emulators with Linear Inequality Constraints and Noisy Observations via MC and MCMC
Adding inequality constraints (e.g. boundedness, monotonicity, convexity) into Gaussian processes (GPs) can lead to more realistic stochastic emulators. Due to the truncated Gaussianity of the posterior, its distribution…
Gaussian ProcessesGeodesic Exponential Kernels: When Curvature and Linearity Conflict
We consider kernel methods on general geodesic metric spaces and provide both negative and positive results. First we show that the common Gaussian kernel can only be generalized to a positive definite kernel on a geodes…
Distribution-Specific Agnostic Conditional Classification With Halfspaces
We study ``selective'' or ``conditional'' classification problems under an agnostic setting. Classification tasks commonly focus on modeling the relationship between features and categories that captures the vast majorit…
ClassificationPAC learningA Note on Non-Negative $L_1$-Approximating Polynomials
$L_1$-Approximating polynomials, i.e., polynomials that approximate indicator functions in $L_1$-norm under certain distributions, are widely used in computational learning theory. We study the existence of \textit{non-n…