Search results for "convex function"

showing 10 items of 50 documents

Stackelberg equilibrium with multiple firms and setup costs

2017

Abstract I provide conditions that guarantee that a Stackelberg game with a setup cost and an integer number of identical leaders and followers has an equilibrium in pure strategies. The main feature of the game is that when the marginal follower leaves the market the price jumps up, so that a leader’s payoff is neither continuous nor quasiconcave. To show existence I check that a leader’s value function satisfies the following single crossing condition: When the other leaders produce more the leader never accommodates entry of more followers. If demand is strictly logconcave, and if marginal costs are both non decreasing and not flatter than average costs, then a Stackelberg equilibrium ex…

Marginal costStackelberg equilibriumEconomics and EconometricsSetup costApplied Mathematics05 social sciencesStochastic gameExistence of the equilibriumSupermodular gamesCournot competitionSettore SECS-P/06 - Economia ApplicataMicroeconomicsQuasiconvex functionNon quasiconcave payoffEntry deterrenceBellman equation0502 economics and businessEconomicsStackelberg competitionMarket powerLimit (mathematics)050207 economicsSettore SECS-P/01 - Economia PoliticaMathematical economics050205 econometrics Journal of Mathematical Economics
researchProduct

A Decision Model for the Multiple Criteria Group Secretary Problem: Theoretical Considerations

1996

A decision model is developed for solving the discrete multiple criteria group secretary problem. The model extends the single decision-maker progressive algorithm by Korhonen, Moskowitz and Wallenius to group contexts. As the original progressive algorithm, it relaxes the usual assumption of a fixed set of available decision alternatives and complete knowledge of a decision-maker's preference structure (value function). The decision-makers are requested to settle on a compromise, if possible. The model then proceeds with determining the likelihood of finding possibly/surely better settlements (compromises). Linear value functions, linear prospect theory-type value functions, and quasiconca…

MarketingOperations researchComputer scienceStrategy and ManagementStructure (category theory)Management Science and Operations ResearchConflict analysisManagement Information SystemsQuasiconvex functionBellman equationConflict resolutionMultiple criteriaProduction (economics)Mathematical economicsValue (mathematics)Preference (economics)Decision modelSecretary problemJournal of the Operational Research Society
researchProduct

Optimality conditions for nondifferentiable convex semi-infinite programming

1983

This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.

Mathematical optimizationGeneral MathematicsFeasible regionMathematics::Optimization and ControlRegular polygonConstraint satisfactionSemi-infinite programmingConstraint (information theory)Convex optimizationConstraint logic programmingComputer Science::Programming LanguagesConvex functionSoftwareMathematicsMathematical Programming
researchProduct

Geodesic X-ray tomography for piecewise constant functions on nontrapping manifolds

2017

We show that on a two-dimensional compact nontrapping manifold with strictly convex boundary, a piecewise constant function is determined by its integrals over geodesics. In higher dimensions, we obtain a similar result if the manifold satisfies a foliation condition. These theorems are based on iterating a local uniqueness result. Our proofs are elementary.

Mathematics - Differential GeometryGeodesicinverse problemsGeneral Mathematics010102 general mathematicsGeodesic mapMathematical analysisBoundary (topology)16. Peace & justice01 natural sciencesManifoldFoliationinversio-ongelmatDifferential Geometry (math.DG)0103 physical sciencesPiecewiseFOS: Mathematics010307 mathematical physicsConstant functionMathematics::Differential Geometry0101 mathematicsConvex functionMathematics::Symplectic GeometryMathematics
researchProduct

The geodesic X-ray transform with matrix weights

2019

Consider a compact Riemannian manifold of dimension $\geq 3$ with strictly convex boundary, such that the manifold admits a strictly convex function. We show that the attenuated ray transform in the presence of an arbitrary connection and Higgs field is injective modulo the natural obstruction for functions and one-forms. We also show that the connection and the Higgs field are uniquely determined by the scattering relation modulo gauge transformations. The proofs involve a reduction to a local result showing that the geodesic X-ray transform with a matrix weight can be inverted locally near a point of strict convexity at the boundary, and a detailed analysis of layer stripping arguments ba…

Mathematics - Differential GeometryPure mathematicsGeodesicGeneral Mathematicsmath-phBoundary (topology)FOS: Physical sciences01 natural sciencesinversio-ongelmatintegraaliyhtälötMathematics - Analysis of PDEsmath.MPFOS: MathematicsSectional curvature0101 mathematicsMathematical Physicsmath.APMathematicsX-ray transform010102 general mathematicsMathematical Physics (math-ph)Riemannian manifoldPure MathematicsManifoldConnection (mathematics)math.DGDifferential Geometry (math.DG)monistotConvex functionAnalysis of PDEs (math.AP)
researchProduct

Prescribing the behaviour of geodesics in negative curvature

2010

Given a family of (almost) disjoint strictly convex subsets of a complete negatively curved Riemannian manifold M, such as balls, horoballs, tubular neighborhoods of totally geodesic submanifolds, etc, the aim of this paper is to construct geodesic rays or lines in M which have exactly once an exactly prescribed (big enough) penetration in one of them, and otherwise avoid (or do not enter too much in) them. Several applications are given, including a definite improvement of the unclouding problem of [PP1], the prescription of heights of geodesic lines in a finite volume such M, or of spiraling times around a closed geodesic in a closed such M. We also prove that the Hall ray phenomenon desc…

Mathematics - Differential GeometryhoroballsPure mathematicsGeodesicDisjoint setsLagrange spectrum52A5501 natural sciences53C22Mathematics - Metric Geometry0103 physical sciences0101 mathematicshoroball[MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG]MathematicsFinite volume methodHall rayAMS : 53 C 22 11 J 06 52 A 55 53 D 25Mathematics - Number Theory010102 general mathematicsnegative curvatureRiemannian manifold[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]Closed geodesic53D25[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]Totally geodesic010307 mathematical physicsGeometry and TopologyNegative curvatureMathematics::Differential GeometryConvex functiongeodesicgeodesics11J06
researchProduct

Stackelberg Equilibrium with Many Leaders and Followers. The Case of Setup Costs

2016

I provide conditions that guarantee that a Stackelberg game with a setup cost and an integer number of leaders and followers has an equilibrium in pure strategies. The main feature of the game is that when the marginal follower leaves the market the price jumps up, so that a leader’s payoff is neither continuous nor quasiconcave. To show existence I check that a leader’s value function satisfies the following single crossing condition: When the other leaders produce more the leader never accommodates entry of more followers. If demand is strictly logconcave, and if marginal costs are both non decreasing and not flatter than average costs, then a Stackelberg equilibrium exists. Besides showi…

MicroeconomicsMarginal costQuasiconvex functionBellman equationStochastic gameEconomicsStackelberg competitionDeterrence theoryMarket powerCournot competitionMathematical economicsSSRN Electronic Journal
researchProduct

Improving the stability bound for the PPH nonlinear subdivision scheme for data coming from strictly convex functions

2021

Abstract Subdivision schemes are widely used in the generation of curves and surfaces, and therefore they are applied in a variety of interesting applications from geological reconstructions of unaccessible regions to cartoon film productions or car and ship manufacturing. In most cases dealing with a convexity preserving subdivision scheme is needed to accurately reproduce the required surfaces. Stability respect to the initial input data is also crucial in applications. The so called PPH nonlinear subdivision scheme is proven to be both convexity preserving and stable. The tighter the stability bound the better controlled is the final output error. In this article a more accurate stabilit…

Nonlinear subdivision0209 industrial biotechnologybusiness.industryComputer scienceApplied MathematicsStability (learning theory)020206 networking & telecommunications02 engineering and technologyConvexityComputational MathematicsNonlinear system020901 industrial engineering & automationScheme (mathematics)0202 electrical engineering electronic engineering information engineeringApplied mathematicsVariety (universal algebra)businessConvex functionComputingMethodologies_COMPUTERGRAPHICSSubdivisionApplied Mathematics and Computation
researchProduct

Starlikeness Condition for a New Differential-Integral Operator

2020

A new differential-integral operator of the form I n f ( z ) = ( 1 &minus

Physicsconvex functionbest dominantPure mathematicsGeneral MathematicsOperator (physics)lcsh:Mathematicsstarlike functionDifferential operatorlcsh:QA1-939univalent functionanalytic functionComputer Science (miscellaneous)Convex functiondominantEngineering (miscellaneous)differential subordinationDifferential (mathematics)Analytic functionUnivalent functionMathematics
researchProduct

Strictly convex corners scatter

2017

We prove the absence of non-scattering energies for potentials in the plane having a corner of angle smaller than $\pi$. This extends the earlier result of Bl{\aa}sten, P\"aiv\"arinta and Sylvester who considered rectangular corners. In three dimensions, we prove a similar result for any potential with a circular conic corner whose opening angle is outside a countable subset of $(0,\pi)$.

Plane (geometry)non-scattering energiesGeneral Mathematicsta111010102 general mathematicsMathematical analysis01 natural sciencescomplex geometrical optics solutions010101 applied mathematicsMathematics - Analysis of PDEscorner scatteringConic sectionFOS: MathematicsCountable set0101 mathematicsConvex functionMathematicsAnalysis of PDEs (math.AP)
researchProduct