English
Related papers

Related papers: Scale invariance versus translation variance in Na…

200 papers

We investigate the effects of competition in a problem of resource extraction from a common source with diffusive dynamics. In the symmetric version with identical extraction rates we prove the existence of a Nash equilibrium where the…

Optimization and Control · Mathematics 2021-06-10 Erik Ekström , Kristoffer Lindensjö

One key in real-life Nash equilibrium applications is to calibrate players' cost functions. To leverage the approximation ability of neural networks, we proposed a general framework for optimizing and learning Nash equilibrium using neural…

Computer Science and Game Theory · Computer Science 2024-09-04 Di Zhang , Wei Gu , Qing Jin

Statistical mechanics is based on interplay between energy minimization and entropy maximization. Here we formalize this interplay via axioms of cooperative game theory (Nash bargaining) and apply it out of equilibrium. These axioms capture…

Statistical Mechanics · Physics 2020-10-14 S. G. Babajanyan , K. H. Cheong , A. E. Allahverdyan

We study the sensitivity of the expected utility maximization problem in a continuous semi-martingale market with respect to small changes in the market price of risk. Assuming that the preferences of a rational economic agent are modeled…

Portfolio Management · Quantitative Finance 2017-05-24 Oleksii Mostovyi , Mihai Sîrbu

This paper derives polynomial-time approximation schemes for several NP-hard stochastic optimization problems from the algorithmic mechanism design and operations research literatures. The problems we consider involve a principal or seller…

Computer Science and Game Theory · Computer Science 2025-09-18 Robin Bowers , Marius Garbea , Emmanouil Pountourakis , Samuel Taggart

Network slicing to enable resource sharing among multiple tenants --network operators and/or services-- is considered a key functionality for next generation mobile networks. This paper provides an analysis of a well-known model for…

Computer Science and Game Theory · Computer Science 2017-02-21 Pablo Caballero , Albert Banchs , Gustavo de Veciana , Xavier Costa-Perez

For any $\varepsilon>0$, we give a simple, deterministic $(4+\varepsilon)$-approximation algorithm for the Nash social welfare (NSW) problem under submodular valuations. We also consider the asymmetric variant of the problem, where the…

Computer Science and Game Theory · Computer Science 2026-03-31 Jugal Garg , Edin Husić , Wenzheng Li , László A. Végh , Jan Vondrák

In a many-to-one matching market, we analyze the matching game induced by a stable rule when firms' choice function satisfy substitutability. We show that any stable rule implements the individually rational correspondence in Nash…

Theoretical Economics · Economics 2024-04-29 Noelia Juarez , Paola B. Manasero , Jorge Oviedo

Electricity markets differ in their ability to meet power imbalances in short notice in a controlled fashion. Relatively flexible markets have the ability to ramp up (or down) power flows across interties without compromising their ability…

Computer Science and Game Theory · Computer Science 2022-03-01 Hossein Khazaei , Ceyhun Eksin , Roohallah Khatami , Alfredo Garcia

The maximum Nash social welfare (NSW) -- which maximizes the geometric mean of agents' utilities -- is a fundamental solution concept with remarkable fairness and efficiency guarantees. The computational aspects of NSW have been extensively…

Computer Science and Game Theory · Computer Science 2023-12-15 Pallavi Jain , Rohit Vaish

We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…

Mathematical Finance · Quantitative Finance 2023-03-15 Anastasiya Tanana

We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and…

Computer Science and Game Theory · Computer Science 2025-11-07 David X. Lin , Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

Game theory relies heavily on the availability of cardinal utility functions, but in fields such as matching markets, only ordinal preferences are typically elicited. The literature focuses on mechanisms with simple dominant strategies, but…

Computer Science and Game Theory · Computer Science 2024-08-22 Fabian R. Pieroth , Martin Bichler

Most familiar equilibrium concepts, such as Nash and correlated equilibrium, guarantee only that no single player can improve their utility by deviating unilaterally. They offer no guarantees against profitable coordinated deviations by…

Computer Science and Game Theory · Computer Science 2026-05-01 Mingyang Liu , Gabriele Farina , Asuman Ozdaglar

We introduce a strategic behavior in reinsurance bilateral transactions, where agents choose the risk preferences they will appear to have in the transaction. Within a wide class of risk measures, we identify agents' strategic choices to a…

Risk Management · Quantitative Finance 2020-03-19 Michail Anthropelos , Tim J. Boonen

In this paper, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative convex games with partial-decision information. We propose a distributed algorithm, where each agent refines its strategy through projected-gradient…

Computer Science and Game Theory · Computer Science 2023-09-15 Duong Thuy Anh Nguyen , Mattia Bianchi , Florian Dörfler , Duong Tung Nguyen , Angelia Nedić

A truthful mechanism for a Bayesian single-item auction results with some ex-ante revenue for the seller, and some ex-ante total surplus for the buyers. We study the Pareto frontier of the set of seller-buyers ex-ante utilities, generated…

Computer Science and Game Theory · Computer Science 2026-02-13 Moshe Babaioff , Sijin Chen , Zhaohua Chen , Yiding Feng

Allocating items in a fair and economically efficient manner is a central problem in fair division. We study this problem for agents with additive preferences, when items are all goods or all chores, divisible or indivisible. The celebrated…

Computer Science and Game Theory · Computer Science 2026-02-13 Owen Eckart , Alexandros Psomas , Paritosh Verma

The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…

Probability · Mathematics 2012-03-01 Oleg Lepski

Voters making a binary decision purchase votes from a centralized clearing house, paying the square of the number of votes purchased. The net payoff to an agent with utility $u$ who purchases $v$ votes is $\Psi (S_{n+1})u-v^{2}$, where…

Computer Science and Game Theory · Computer Science 2019-07-19 Steven P. Lalley , E. Glen Weyl