English
Related papers

Related papers: Approximating Equilibrium under Constrained Piecew…

200 papers

Given facilities with capacities and clients with penalties and demands, the transportation problem with market choice consists in finding the minimum-cost way to partition the clients into unserved clients, paying the penalties, and into…

Data Structures and Algorithms · Computer Science 2016-08-23 Karen Aardal , Pierre Le Bodic

We present a new algorithm for computing balanced flows in equality networks arising in market equilibrium computations. The current best time bound for computing balanced flows in such networks requires $O(n)$ maxflow computations, where…

Data Structures and Algorithms · Computer Science 2016-05-16 Omar Darwish , Kurt Mehlhorn

Equilibria of realistic multiplayer games constitute a key solution concept both in practical applications, such as online advertising auctions and electricity markets, and in analytical frameworks used to study strategic voting in…

Computer Science and Game Theory · Computer Science 2025-11-18 Jakub Černý , Shuvomoy Das Gupta , Christian Kroer

A major goal in Algorithmic Game Theory is to justify equilibrium concepts from an algorithmic and complexity perspective. One appealing approach is to identify robust natural distributed algorithms that converge quickly to an equilibrium.…

Computer Science and Game Theory · Computer Science 2019-11-25 Richard Cole , Yixin Tao

When calibrating spatial partial equilibrium models with conjectural variations, some modelers fit the suppliers' sales to the available data in addition to total consumption and price levels. While this certainly enhances the quality of…

Optimization and Control · Mathematics 2015-12-17 Tobias Baltensperger , Rudolf M. Füchslin , Pius Krütli , John Lygeros

We study a large economy in which firms cannot compute exact solutions to the non-linear equations that characterize the equilibrium price at which they can sell future output. Instead, firms use polynomial expansions to approximate prices.…

Economics · Quantitative Finance 2016-11-08 Wolfgang Kuhle

We study fair distribution of a collection of m indivisible goods among a group of n agents, using the widely recognized fairness principles of Maximin Share (MMS) and Any Price Share (APS). These principles have undergone thorough…

Computer Science and Game Theory · Computer Science 2023-12-15 Chandra Chekuri , Pooja Kulkarni , Rucha Kulkarni , Ruta Mehta

We consider the scenario where $N$ utilities strategically bid for electricity in the day-ahead market and balance the mismatch between the committed supply and actual demand in the real-time market, with uncertainty in demand and local…

Systems and Control · Electrical Eng. & Systems 2021-09-15 Tianyu Zhao , Hanling Yi , Minghua Chen , Chenye Wu , Yunjian Xu

We study two-sided many-to-one matching markets with transferable utilities, e.g., labor and rental housing markets, in which money can exchange hands between agents, subject to distributional constraints on the set of feasible allocations.…

Theoretical Economics · Economics 2022-04-26 Devansh Jalota , Michael Ostrovsky , Marco Pavone

This paper addresses two deficiencies of models in the area of matching-based market design. The first arises from the recent realization that the most prominent solution that uses cardinal utilities, namely the Hylland-Zeckhauser (HZ)…

Computer Science and Game Theory · Computer Science 2023-04-24 Mojtaba Hosseini , Vijay V. Vazirani

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

Optimization and Control · Mathematics 2016-10-31 Insoon Yang , Samuel A. Burden , Ram Rajagopal , S. Shankar Sastry , Claire J. Tomlin

Computational equilibrium finding in large zero-sum extensive-form imperfect-information games has led to significant recent AI breakthroughs. The fastest algorithms for the problem are new forms of counterfactual regret minimization [Brown…

Computer Science and Game Theory · Computer Science 2020-07-01 Brian Hu Zhang , Tuomas Sandholm

The Fisher market equilibrium for private goods and the Lindahl equilibrium for public goods are classic and fundamental solution concepts for market equilibria. While Fisher market equilibria have been well-studied, the theoretical…

Computer Science and Game Theory · Computer Science 2025-12-05 Yixin Tao , Weiqiang Zheng

Proportional response is a well-established distributed algorithm which has been shown to converge to competitive equilibria in both Fisher and Arrow-Debreu markets, for various sub-families of homogeneous utilities, including linear and…

Computer Science and Game Theory · Computer Science 2025-06-04 Yun Kuen Cheung , Richard Cole , Yixin Tao

We study the computational complexity of the problem of computing local min-max equilibria of games with a nonconvex-nonconcave utility function $f$. From the work of Daskalakis, Skoulakis, and Zampetakis [DSZ21], this problem was known to…

Computational Complexity · Computer Science 2026-02-05 Martino Bernasconi , Matteo Castiglioni

A well-studied nonlinear extension of the minimum-cost flow problem is to minimize the objective $\sum_{ij\in E} C_{ij}(f_{ij})$ over feasible flows $f$, where on every arc $ij$ of the network, $C_{ij}$ is a convex function. We give a…

Data Structures and Algorithms · Computer Science 2016-06-07 Laszlo A. Vegh

Unlike ordinal-utility matching markets, which are well-developed from the viewpoint of both theory and practice, recent insights from a computer science perspective have left cardinal-utility matching markets in a state of flux. The…

Computer Science and Game Theory · Computer Science 2025-01-06 Thorben Tröbst , Vijay V. Vazirani

Fisher markets are those where buyers with budgets compete for scarce items, a natural model for many real world markets including online advertising. A market equilibrium is a set of prices and allocations of items such that supply meets…

Computer Science and Game Theory · Computer Science 2023-03-14 Alexander Peysakhovich , Christian Kroer , Nicolas Usunier

In 1979, Hylland and Zeckhauser \cite{hylland} gave a simple and general scheme for implementing a one-sided matching market using the power of a pricing mechanism. Their method has nice properties -- it is incentive compatible in the large…

Computer Science and Game Theory · Computer Science 2020-04-24 Vijay V. Vazirani , Mihalis Yannakakis

We study the problem of market equilibrium (ME) in future wireless networks, with multiple actors competing and negotiating for a pool of heterogeneous resources (communication and computing) while meeting constraints in terms of global…

Computer Science and Game Theory · Computer Science 2025-04-24 Mandar Datar , Mattia Merluzzi