Mathematics of Operations Research最新文献

{"title":"On a Network Centrality Maximization Game","authors":"Costanza Catalano, Maria Castaldo, Giacomo Como, Fabio Fagnani","doi":"10.1287/moor.2022.0251","DOIUrl":"https://doi.org/10.1287/moor.2022.0251","url":null,"abstract":"We study a network formation game where n players, identified with the nodes of a directed graph to be formed, choose where to wire their outgoing links in order to maximize their PageRank centrality. Specifically, the action of every player i consists in the wiring of a predetermined number d<jats:sub>i</jats:sub> of directed out-links, and her utility is her own PageRank centrality in the network resulting from the actions of all players. We show that this is a potential game and that the best response correspondence always exhibits a local structure in that it is never convenient for a node i to link to other nodes that are at incoming distance more than d<jats:sub>i</jats:sub> from her. We then study the equilibria of this game determining necessary conditions for a graph to be a (strict, recurrent) Nash equilibrium. Moreover, in the homogeneous case, where players all have the same number d of out-links, we characterize the structure of the potential-maximizing equilibria, and in the special cases d = 1 and d = 2, we provide a complete classification of the set of (strict, recurrent) Nash equilibria. Our analysis shows in particular that the considered formation mechanism leads to the emergence of undirected and disconnected or loosely connected networks.Funding: This research was carried out within the framework of the Ministero dell’Università e della Ricerca (MIUR)-funded Progetto di Eccellenza of the Dipartimento di Scienze Matematiche G. L. Lagrange, Politecnico di Torino [CUP: E11G18000350001]. It received partial support from the MIUR-funded project PRIN 2017 “Advanced Network Control of Future Smart Grids” and from the Compagnia di San Paolo.","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal Ratcheting of Dividends with Capital Injection","authors":"Wenyuan Wang, Ran Xu, Kaixin Yan","doi":"10.1287/moor.2023.0102","DOIUrl":"https://doi.org/10.1287/moor.2023.0102","url":null,"abstract":"In this paper, we investigate the optimal dividend problem with capital injection and ratcheting constraint with nondecreasing dividend payout rate. Capital injections are introduced in order to eliminate the possibility of bankruptcy. Under the Cramér–Lundberg risk model, the problem is formulated as a two-dimensional stochastic control problem. By applying the viscosity theory, we show that the value function is the unique viscosity solution to the associated Hamilton–Jacobi–Bellman equation. In order to obtain analytical results, we further study the problem with finite ratcheting constraint, where the dividend rate takes only a finite number of available values. We show that the value function under general ratcheting can be approximated arbitrarily closely by the one with finite ratcheting. Finally, we derive the expressions of value function when the threshold-type finite ratcheting dividend strategy with capital injection is applied, and we show the optimality of such a strategy under certain conditions of concavity. Numerical examples under various scenarios are provided at the end.Funding W. Wang was supported by the National Natural Science Foundation of China [Grants 12171405, 12271066, and 11661074] and the Fundamental Research Funds for the Central Universities of China [Grant 20720220044]. R. Xu was supported by the National Natural Science Foundation of China [Grants 12201506 and 12371468], the Natural Science Foundation of the Jiangsu Higher Education Institutions of China [Grant 21KJB110024], and Xi’an Jiaotong-Liverpool University Research Development Funding [Grant RDF-20-01-02].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142220587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the Set of Balanced Games","authors":"Pedro Garcia-Segador, Michel Grabisch, Pedro Miranda","doi":"10.1287/moor.2023.0379","DOIUrl":"https://doi.org/10.1287/moor.2023.0379","url":null,"abstract":"We study the geometric structure of the set of cooperative transferable utility games having a nonempty core, characterized by Bondareva and Shapley as balanced games. We show that this set is a nonpointed polyhedral cone, and we find the set of its extremal rays and facets. This study is also done for the set of balanced games whose value for the grand coalition is fixed, which yields an affine nonpointed polyhedral cone. Finally, the case of nonnegative balanced games with fixed value for the grand coalition is tackled. This set is a convex polytope, with remarkable properties. We characterize its vertices and facets, study the adjacency structure of vertices, develop an algorithm for generating vertices in a random uniform way, and show that this polytope is combinatorial and its adjacency graph is Hamiltonian. Last, we give a characterization of the set of games having a core reduced to a singleton.Funding: This work was supported by the Spanish Government [Grant PID2021-124933NB-I00].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142227350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Compact Extended Formulations for Low-Rank Functions with Indicator Variables","authors":"Shaoning Han, Andrés Gómez","doi":"10.1287/moor.2021.0281","DOIUrl":"https://doi.org/10.1287/moor.2021.0281","url":null,"abstract":"We study the mixed-integer epigraph of a special class of convex functions with nonconvex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are defined as compositions of low-dimensional nonlinear functions with affine functions. Extended formulations describing the convex hull of such sets can easily be constructed via disjunctive programming although a direct application of this method often yields prohibitively large formulations, whose size is exponential in the number of variables. In this paper, we propose a new disjunctive representation of the sets under study, which leads to compact formulations with size exponential in the dimension of the nonlinear function but polynomial in the number of variables. Moreover, we show how to project out the additional variables for the case of dimension one, recovering or generalizing known results for the convex hulls of such sets (in the original space of variables). Our computational results indicate that the proposed approach can significantly improve the performance of solvers in structured problems.Funding: This work was supported by the National Science Foundation Division of Computing and Communication Foundations [Grant 2006762].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142220586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Parabolic Regularity of Spectral Functions","authors":"Ashkan Mohammadi, Ebrahim Sarabi","doi":"10.1287/moor.2023.0010","DOIUrl":"https://doi.org/10.1287/moor.2023.0010","url":null,"abstract":"This paper is devoted to the study of the second-order variational analysis of spectral functions. It is well-known that spectral functions can be expressed as a composite function of symmetric functions and eigenvalue functions. We establish several second-order properties of spectral functions when their associated symmetric functions enjoy these properties. Our main attention is given to characterize parabolic regularity for this class of functions. It was observed recently that parabolic regularity can play a central rule in ensuring the validity of important second-order variational properties, such as twice epi-differentiability. We demonstrates that for convex spectral functions, their parabolic regularity amounts to that of their symmetric functions. As an important consequence, we calculate the second subderivative of convex spectral functions, which allows us to establish second-order optimality conditions for a class of matrix optimization problems.Funding: The research of A. Mohammadi is funded by a postdoctoral fellowship from Georgetown University. E. Sarabi is partially supported by the U.S. National Science Foundation [Grant DMS 2108546].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142220588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Information Design and Sharing in Supply Chains","authors":"René Caldentey, Avi Giloni, Clifford Hurvich, Yichen Zhang","doi":"10.1287/moor.2023.008","DOIUrl":"https://doi.org/10.1287/moor.2023.008","url":null,"abstract":"We study the interplay between inventory replenishment policies and information sharing in the context of a two-tier supply chain with a single supplier and a single retailer serving an independent and identically distributed Gaussian market demand. We investigate how the retailer’s inventory policy impacts the supply chain’s cumulative expected long-term average inventory costs [Formula: see text] in two extreme information-sharing cases: (a) full information sharing and (b) no information sharing. To find the retailer’s inventory policy that minimizes [Formula: see text], we formulate an infinite-dimensional optimization problem whose decision variables are the MA([Formula: see text]) coefficients that characterize a stationary ordering policy. Under full information sharing, the optimization problem admits a simple solution and the optimal policy is given by an MA(1) process. On the other hand, to solve the optimization problem under no information sharing, we reformulate the optimization from its time domain formulation to an equivalent z-transform formulation in which the decision variables correspond to elements of the Hardy space H2. This alternative representation allows us to use a number of results from H2 theory to compute the optimal value of [Formula: see text] and characterize a sequence of ϵ-optimal inventory policies under some mild technical conditions. By comparing the optimal solution under full information sharing and no information sharing, we derive a number of important practical takeaways. For instance, we show that there is value in information sharing if and only if the retailer’s optimal policy under full information sharing is not invertible with respect to the sequence of demand shocks. Furthermore, we derive a fundamental mathematical identity that reveals the value of information sharing by exploiting the canonical Smirnov–Beurling inner–outer factorization of the retailer’s orders when viewed as an element of H2. We also show that the value of information sharing can grow unboundedly when the cumulative supply chain costs are dominated by the supplier’s inventory costs. Funding: R. Caldentey acknowledges the University of Chicago Booth School of Business for financial support. Supplemental Material: The online appendix is available at https://doi.org/10.1287/moor.2023.008 .","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141922035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Uncertainty Propagation and Dynamic Robust Risk Measures","authors":"Marlon R. Moresco, Mélina Mailhot, Silvana M. Pesenti","doi":"10.1287/moor.2023.0267","DOIUrl":"https://doi.org/10.1287/moor.2023.0267","url":null,"abstract":"We introduce a framework for quantifying propagation of uncertainty arising in a dynamic setting. Specifically, we define dynamic uncertainty sets designed explicitly for discrete stochastic processes over a finite time horizon. These dynamic uncertainty sets capture the uncertainty surrounding stochastic processes and models, accounting for factors such as distributional ambiguity. Examples of uncertainty sets include those induced by the Wasserstein distance and f-divergences. We further define dynamic robust risk measures as the supremum of all candidates’ risks within the uncertainty set. In an axiomatic way, we discuss conditions on the uncertainty sets that lead to well-known properties of dynamic robust risk measures, such as convexity and coherence. Furthermore, we discuss the necessary and sufficient properties of dynamic uncertainty sets that lead to time-consistencies of dynamic robust risk measures. We find that uncertainty sets stemming from f-divergences lead to strong time-consistency whereas the Wasserstein distance results in a new time-consistent notion of weak recursiveness. Moreover, we show that a dynamic robust risk measure is strong time-consistent or weak recursive if and only if it admits a recursive representation of one-step conditional robust risk measures arising from static uncertainty sets.Funding: M. Mailhot and S. M. Pesenti acknowledge support from the Canadian Statistical Sciences Institute (CANSSI) and from the Natural Sciences and Engineering Research Council of Canada [Grants RGPIN-2015-05447, DGECR-2020-00333, and RGPIN-2020-04289]. M. R. Moresco thanks the Horizon Postdoctoral Fellowship for the support.","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141939658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems","authors":"I. Necoara, Olivier Fercoq","doi":"10.1287/moor.2024.0500","DOIUrl":"https://doi.org/10.1287/moor.2024.0500","url":null,"abstract":"Our proof of linear convergence for Dykstra’s algorithm was erroneous, and in fact, there even exists a counterexample showing that the result is false.","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fair Shares: Feasibility, Domination, and Incentives","authors":"Moshe Babaioff, Uriel Feige","doi":"10.1287/moor.2022.0257","DOIUrl":"https://doi.org/10.1287/moor.2022.0257","url":null,"abstract":"We consider fair allocation of indivisible goods to n equally entitled agents. Every agent i has a valuation function v<jats:sub>i</jats:sub> from some given class of valuation functions. A share s is a function that maps [Formula: see text] to a nonnegative value. A share is feasible if for every allocation instance, there is an allocation that gives every agent i a bundle that is acceptable with respect to v<jats:sub>i</jats:sub>, one of value at least her share value [Formula: see text]. We introduce the following concepts. A share is self-maximizing if reporting the true valuation maximizes the minimum true value of a bundle that is acceptable with respect to the report. A share s ρ-dominates another share [Formula: see text] if [Formula: see text] for every valuation function. We initiate a systematic study of feasible and self-maximizing shares and a systematic study of ρ-domination relation between shares, presenting both positive and negative results.Funding: The research of M. Babaioff is supported in part by a Golda Meir Fellowship. The research of U. Feige is supported in part by the Israel Science Foundation [Grant 1122/22].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Augmented Lagrangian Approach to Conically Constrained Nonmonotone Variational Inequality Problems","authors":"Lei Zhao, Daoli Zhu, Shuzhong Zhang","doi":"10.1287/moor.2023.0167","DOIUrl":"https://doi.org/10.1287/moor.2023.0167","url":null,"abstract":"In this paper we consider a nonmonotone (mixed) variational inequality (VI) model with (nonlinear) convex conic constraints. Through developing an equivalent Lagrangian function-like primal-dual saddle point system for the VI model in question, we introduce an augmented Lagrangian primal-dual method, called ALAVI (Augmented Lagrangian Approach to Variational Inequality) in the paper, for solving a general constrained VI model. Under an assumption, called the primal-dual variational coherence condition in the paper, we prove the convergence of ALAVI. Next, we show that many existing generalized monotonicity properties are sufficient—though by no means necessary—to imply the abovementioned coherence condition and thus are sufficient to ensure convergence of ALAVI. Under that assumption, we further show that ALAVI has in fact an [Formula: see text] global rate of convergence where k is the iteration count. By introducing a new gap function, this rate further improves to be [Formula: see text] if the mapping is monotone. Finally, we show that under a metric subregularity condition, even if the VI model may be nonmonotone, the local convergence rate of ALAVI improves to be linear. Numerical experiments on some randomly generated highly nonlinear and nonmonotone VI problems show the practical efficacy of the newly proposed method.Funding: L. Zhao and D. Zhu were partially supported by the Major Project of the National Natural Science Foundation of China [Grant 72293582], the National Key R&amp;D Program of China [Grant 2023YFA0915202], and the Fundamental Research Funds for the Central Universities (the Interdisciplinary Program of Shanghai Jiao Tong University) [Grant YG2024QNA36]. L. Zhao was partially supported by the Startup Fund for Young Faculty at SJTU (SFYF at SJTU) [Grant 22X010503839].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141873020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}