Search arXivSearch

arXiv · 2606.09631

Efficiently Restructuring Sovereign Debt via Arctic Auctions with Convex Costs

Abstract

We study the problem of computing competitive equilibria in the Arctic product-mix auction, originally developed for the Icelandic government for exchanging blocked financial accounts, and more recently proposed by IMF staff for sovereign debt restructuring. From the buyers' perspective, the Arctic auction is equivalent to the quasi-linear Fisher market. However, unlike the standard Fisher model, the seller can express rich supply preferences through explicit supply-side costs and constraints. Despite extensive algorithmic literature on Fisher markets, the seller side has not received much attention, and no polynomial-time algorithm was previously known for computing competitive equilibrium when sellers face nontrivial costs. We examine the natural and expressive regime of separable, stepwise-increasing marginal costs that underlie the above-stated applications. Using polyhedral theory techniques, we first show that rational inputs lead to rational-valued competitive equilibria. Motivated by this result, we develop the first polynomial-time algorithm for this setting based on a non-trivial extension of classic primal-dual balanced-flow techniques for linear Fisher markets. Our work provides a robust computational foundation for auctions with sophisticated preferences, paving the way for flexible and institutionally feasible market designs in global finance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jugal Garg, Edwin Lock, Vijay V. Vazirani. 2026-08-22. Efficiently Restructuring Sovereign Debt via Arctic Auctions with Convex Costs. https://arxiv.org/abs/2606.09631

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT