English
Related papers

Related papers: Walrasian Dynamics in Multi-unit Markets

200 papers

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

Computer Science and Game Theory · Computer Science 2026-05-11 Ian Gemp , Crystal Qian , Marc Lanctot , Kate Larson

We investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

In the envy-free perfect matching problem, $n$ items with unit supply are available to be sold to $n$ buyers with unit demand. The objective is to find allocation and prices such that both seller's revenue and buyers' surpluses are…

Computer Science and Game Theory · Computer Science 2023-08-25 Marcos Salvatierra

In quasi-proportional auctions, each bidder receives a fraction of the allocation equal to the weight of their bid divided by the sum of weights of all bids, where each bid's weight is determined by a weight function. We study the…

Computer Science and Game Theory · Computer Science 2015-07-28 Zheng Wen , Eric Bax , James Li

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

We present a method for finding envy-free prices in a combinatorial auction where the consumers' number $n$ coincides with that of distinct items for sale, each consumer can buy one single item and each item has only one unit available.…

Computer Science and Game Theory · Computer Science 2023-08-25 Marcos Salvatierra , Juan G. Colonna , Mario Salvatierra , Alcides de C. Amorim Neto

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

Computer Science and Game Theory · Computer Science 2024-11-13 Zhikang Fan , Weiran Shen

Examining the behavior of multi-agent systems is vitally important to many emerging distributed applications - game theory has emerged as a powerful tool set in which to do so. The main approach of game-theoretic techniques is to model…

Computer Science and Game Theory · Computer Science 2024-06-03 Rohit Konda , Rahul Chandan , Jason Marden

Two issues of algorithmic collusion are addressed in this paper. First, we show that in a general class of symmetric games, including Prisoner's Dilemma, Bertrand competition, and any (nonlinear) mixture of first and second price auction,…

Theoretical Economics · Economics 2024-09-05 Zhang Xu , Wei Zhao

We propose a decentralized market model in which agents can negotiate bilateral contracts. This builds on a similar, but centralized, model of trading networks introduced by Hatfield et al. in 2013. Prior work has established that…

Computer Science and Game Theory · Computer Science 2025-01-29 Edwin Lock , Benjamin Patrick Evans , Eleonora Kreacic , Sujay Bhatt , Alec Koppel , Sumitra Ganesh , Paul W. Goldberg

In socio-technical multi-agent systems, deception exploits privileged information to induce false beliefs in "victims," keeping them oblivious and leading to outcomes detrimental to them or advantageous to the deceiver. We consider…

Systems and Control · Electrical Eng. & Systems 2025-07-08 Michael Tang , Umar Javed , Xudong Chen , Miroslav Krstic , Jorge I. Poveda

We study $k$-price auctions in a complete information environment and characterize all pure-strategy Nash equilibrium outcomes. In a setting with $n$ agents having ordered valuations, we show that any agent, except those with the lowest…

Theoretical Economics · Economics 2025-07-09 Sumit Goel , Jeffrey Zeidel

We develop efficient algorithms to construct utility maximizing mechanisms in the presence of risk averse players (buyers and sellers) in Bayesian settings. We model risk aversion by a concave utility function, and players play…

Computer Science and Game Theory · Computer Science 2012-06-28 Anand Bhalgat , Tanmoy Chakraborty , Sanjeev Khanna

We investigate the behavior of equilibria in an $M/M/1$ feedback queue where price and time sensitive customers are homogeneous with respect to service valuation and cost per unit time of waiting. Upon arrival, customers can observe the…

Optimization and Control · Mathematics 2022-02-02 Mark Fackrell , Peter Taylor , Jiesen Wang

We analyze a nonlinear pricing model where the seller controls both product pricing (screening) and buyer information about their own values (persuasion). We prove that the optimal mechanism always consists of finitely many signals and…

Theoretical Economics · Economics 2025-03-11 Dirk Bergemann , Tibor Heumann , Stephen Morris

The connection between games and no-regret algorithms has been widely studied in the literature. A fundamental result is that when all players play no-regret strategies, this produces a sequence of actions whose time-average is a…

Computer Science and Game Theory · Computer Science 2020-09-15 Zhe Feng , Guru Guruganesh , Christopher Liaw , Aranyak Mehta , Abhishek Sethi

Combinatorial auctions are used to allocate resources in domains where bidders have complex preferences over bundles of goods. However, the behavior of bidders under different payment rules is not well understood, and there has been limited…

Computer Science and Game Theory · Computer Science 2022-06-09 Vitor Bosshard , Ye Wang , Sven Seuken

In revenue maximization of selling a digital product in a social network, the utility of an agent is often considered to have two parts: a private valuation, and linearly additive influences from other agents. We study the incomplete…

Computer Science and Game Theory · Computer Science 2011-09-27 Wei Chen , Pinyan Lu , Xiaorui Sun , Bo Tang , Yajun Wang , Zeyuan Allen Zhu

A special case of Myerson's classic result describes the revenue-optimal equilibrium when a seller offers a single item to a buyer. We study a repeated sales extension of this model: a seller offers to sell a single fresh copy of an item to…

Computer Science and Game Theory · Computer Science 2019-03-12 Nikhil R. Devanur , Yuval Peres , Balasubramanian Sivan

A group of players which contain n sellers and n buyers bargain over the partitions of n pies. A seller(/buyer) has to reach an agreement with a buyer (/seller) on the division of a pie. The players bargain in a system like the stock…

Computer Science and Game Theory · Computer Science 2016-10-10 Jiawei Li