A new characterization of M#-convex set functions by substitutability

A new characterization of M#-convex set functions by substitutability

0.00 Avg rating0 Votes
Article ID: iaor20043302
Country: Japan
Volume: 47
Issue: 1
Start Page Number: 18
End Page Number: 24
Publication Date: Mar 2004
Journal: Journal of the Operations Research Society of Japan
Authors: ,
Keywords: game theory, programming: convex, programming: integer
Abstract:

The concepts of M-convex functions and M-convex functions play central roles in the theory of discrete convex analysis which has been applied to mathematical economics. On the other hand, substitutability, which is the key property guaranteeing the existence of a stable matching in generalized stable marriage models, is known as a nice property in mathematical economics. In this paper, we introduce new properties, which are extensions of substitutability, and present new characterizations of M-convex set functions by these properties.

Reviews

Required fields are marked *. Your email address will not be published.