相关论文: A Combinatorial Polynomial Algorithm for the Linea…
We introduce a combinatorial optimization-enriched machine learning pipeline and a novel learning paradigm to solve inventory routing problems with stochastic demand and dynamic inventory updates. After each inventory update, our approach…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
Designing automated market makers (AMMs) for prediction markets on combinatorial securities over large outcome spaces poses significant computational challenges. Prior research has primarily focused on combinatorial prediction markets…
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
In this paper, we investigate the capacitated assortment optimization problem with pricing under the paired combinatorial logit model, whose goal is to identify the revenue-maximizing subset of products as well as their selling prices…
We present a methodology for representing probabilistic relationships in a general-equilibrium economic model. Specifically, we define a precise mapping from a Bayesian network with binary nodes to a market price system where consumers and…
In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problems, reformulate as finding basis for the kernel of special…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…
We study the computation of equilibria in prediction markets in perhaps the most fundamental special case with two players and three trading opportunities. To do so, we show equivalence of prediction market equilibria with those of a…
We derive tractable necessary and sufficient conditions for the absence of buy-and-hold arbitrage opportunities in a perfectly liquid, one period market. We formulate the positivity of Arrow-Debreu prices as a generalized moment problem to…
We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and quadratic unconstrained discrete optimization (QUDO) problems. We also solve the more general…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the…
Knightian uncertainty leads naturally to nonlinear expectations. We introduce a corresponding equilibrium concept with sublinear prices and establish their existence. In general, such equilibria lead to Pareto inefficiency and coincide with…
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, but solvable in linear time on this type of graphs. The…
We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…
We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…
In 1990 Cerlienco and Mureddu gave a combinatorial iterative algorithm which, given an ordered set of points, returns the lexicographical Groebner escalier of the ideal of these points. There are many alternatives to this algorithm and in…