A Strongly Polynomial Algorithm for Arctic Auctions
Our main contribution is a strongly polynomial algorithm for computing an equilibrium for the Arctic Auction, which is the quasi-linear extension of the linear Fisher market model. We build directly on Orlin's strongly polynomial algorithm for the linear Fisher market (Orlin, 2010).
Garg, Jugal +2 more
openaire +2 more sources
Moment cone membership for quivers in strongly polynomial time [PDF]
, 2023 In this note we observe that membership in moment cones of spaces of quiver representations can be decided in strongly polynomial time, for any acyclic quiver. This generalizes a recent result by Chindris-Collins-Kline for bipartite quivers.
Vergne, Michèle, Walter, Michael
core +1 more source
Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming [PDF]
, 2014 International audienceThis note shows that the number of arithmetic operations required by any member of a broad class of optimistic policy iteration algorithms to solve a deterministic discounted dynamic programming problem with three states and four ...
Feinberg, Eugene, A. +2 more
core +1 more source
Strongly Polynomial and Fully Combinatorial Algorithms for Bisubmodular Function Minimization [PDF]
, 2007 Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, Fleischer, and Fujishige (IFF) algorithm for submodular function ...
S. Thomas McCormick, Satoru Fujishige
core
A numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming problem [PDF]
, 2023 Utilizing illustrative linear programming (LP) problem instances, this article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general LP problem.
Awoniyi, Samuel
core +1 more source
Local quadratic convergence of polynomial-time interior-point methods for conic optimization problems [PDF]
In this paper, we establish a local quadratic convergence of polynomial-time interior-point methods for general conic optimization problems. The main structural property used in our analysis is the logarithmic homogeneity of self-concordant barrier ...
NESTEROV, Yu., TUNCEL, Levent
core
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents [PDF]
, 2007 We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n x n matrix to within a multiplicative factor of e^n.
Avi Wigderson +2 more
core
An approximation algorithm for a generalized assignment problem with small resource requirements. [PDF]
We investigate a generalized assignment problem where the resource requirements are either 1 or 2. This problem is motivated by a question that arises when data blocks are to be retrieved from parallel disks as efficiently as possible.
Aerts, J, Korst, J, Spieksma, Frederik
core
Algorithms for network piecewise-linear programs [PDF]
, 1994 In this paper a subarea of Piecewise-Linear Programming named network Piecewise-Linear Programming (NPLP) is discussed. Initially the problem formulation, main efinitins and related Concepts are presented.
Machado, A, Marins, F A S, Perin, C
core
A strongly polynomial algorithm for the uniform balanced network flow problem
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources