## Abstract

We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu exchange markets with linear utilities. Our algorithm is based on a variant of the weakly polynomial Duan–Mehlhorn (DM) algorithm. We use the DM algorithm as a subroutine to identify revealed edges—that is, pairs of agents and goods that must correspond to the best bang-per-buck transactions in every equilibrium solution. Every time a new revealed edge is found, we use another subroutine that decides if there is an optimal solution using the current set of revealed edges or, if none exists, finds the solution that approximately minimizes the violation of the demand and supply constraints. This task can be reduced to solving a linear program (LP). Even though we are unable to solve this LP in strongly polynomial time, we show that it can be approximated by a simpler LP with two variables per inequality that is solvable in strongly polynomial time.

Original language | English (US) |
---|---|

Pages (from-to) | 487-505 |

Number of pages | 19 |

Journal | Operations Research |

Volume | 71 |

Issue number | 2 |

DOIs | |

State | Published - Mar 1 2023 |

## Keywords

- linear exchange markets
- market equilibria
- strongly polynomial algorithm
- two-variable-per-inequality systems

## ASJC Scopus subject areas

- Computer Science Applications
- Management Science and Operations Research