English
Related papers

Related papers: Approximately Efficient Bilateral Trade

200 papers

This paper studies learning in markets with aggregate uncertainty about whether trade is efficient. A long-lived seller offers prices to buyers, who are short-lived and arrive according to a Poisson process. A hidden state determines…

Theoretical Economics · Economics 2026-01-14 Justus Preusser

We study Bayesian mechanism design problems in settings where agents have budgets. Specifically, an agent's utility for an outcome is given by his value for the outcome minus any payment he makes to the mechanism, as long as the payment is…

Computer Science and Game Theory · Computer Science 2015-03-19 Shuchi Chawla , David Malec , Azarakhsh Malekian

In this work we investigate the inefficiency of the electricity system with strategic agents. Specifically, we prove that without a proper control the total demand of an inefficient system is at most twice the total demand of the optimal…

Computer Science and Game Theory · Computer Science 2015-09-10 Carlos Barreto , Eduardo Mojica-Nava , Nicanor Quijano

Market efficiency at least requires the absence of weak arbitrage opportunities, but this is not sufficient to establish a situation where the market is sensitive, i.e., where it "fully reflects" or "rapidly adjusts to" some information…

General Finance · Quantitative Finance 2026-02-25 Gabriel Frahm

A principal must decide between two options. Which one she prefers depends on the private information of two agents. One agent always prefers the first option; the other always prefers the second. Transfers are infeasible. One application…

Theoretical Economics · Economics 2022-05-24 Deniz Kattwinkel , Axel Niemeyer , Justus Preusser , Alexander Winter

The efficient market hypothesis (EMH) famously stated that prices fully reflect the information available to traders. This critically depends on the transfer of information into prices through trading strategies. Traders optimise their…

Mathematical Finance · Quantitative Finance 2025-01-14 Paolo Barucca , Flaviano Morone

We study a decision-maker's problem of finding optimal monetary incentive schemes for retention when faced with agents whose participation decisions (stochastically) depend on the incentive they receive. Our focus is on policies constrained…

Computer Science and Game Theory · Computer Science 2024-07-31 Daniel Freund , Chamsi Hssaine

We analyze a model of selling a single object to a principal-agent pair who want to acquire the object for a firm. The principal and the agent have different assessments of the object's value to the firm. The agent is budget-constrained…

Theoretical Economics · Economics 2024-10-07 Debasis Mishra , Kolagani Paramahamsa

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

Computer Science and Game Theory · Computer Science 2022-09-22 Sergiu Hart , Noam Nisan

We initiate the study of computing (near-)optimal contracts in succinctly representable principal-agent settings. Here optimality means maximizing the principal's expected payoff over all incentive-compatible contracts---known in economics…

Data Structures and Algorithms · Computer Science 2020-02-28 Paul Duetting , Tim Roughgarden , Inbal Talgam-Cohen

A seller wants to sell a good to a set of bidders using a credible mechanism. We show that when the seller has private information about her cost, it is impossible for a static mechanism to achieve the optimal revenue. In particular, even…

Theoretical Economics · Economics 2025-09-29 Martino Banchio , Andrzej Skrzypacz , Frank Yang

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

We propose a simple model that describes the dynamics of efficiencies of competing agents. Agents communicate leading to increase of efficiencies of underachievers, and an efficiency of each agent can increase or decrease irrespectively of…

Statistical Mechanics · Physics 2009-10-31 S. N. Majumdar , P. L. Krapivsky

In practice, most auction mechanisms are not strategy-proof, so equilibrium analysis is required to predict bidding behavior. In many auctions, though, an exact equilibrium is not known and one would like to understand whether -- manually…

Computer Science and Game Theory · Computer Science 2024-08-22 Fabian R. Pieroth , Tuomas Sandholm

We study the efficiency of simple combinatorial auctions for the allocation of a set of items to a set of agents, with private subadditive valuation functions and budget constraints. The class we consider includes all auctions that allocate…

Computer Science and Game Theory · Computer Science 2020-07-29 Alexandros A. Voudouris

This paper deals with two-sided matching market with two disjoint sets, i.e. the set of buyers and the set of sellers. Each seller can trade with at most with one buyer and vice versa. Money is transferred from sellers to buyers for an…

Computer Science and Game Theory · Computer Science 2023-06-22 Yasir Ali , Asma Javaid

The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that…

Computer Science and Game Theory · Computer Science 2021-05-19 Linda Cai , Raghuvansh R. Saxena

Budget-feasible procurement has been a major paradigm in mechanism design since its introduction by Singer (2010). An auctioneer (buyer) with a strict budget constraint is interested in buying goods or services from a group of strategic…

Computer Science and Game Theory · Computer Science 2025-05-30 Georgios Amanatidis , Sophie Klumper , Evangelos Markakis , Guido Schäfer , Artem Tsikiridis

We examine the dynamics of informational efficiency in a market with asymmetrically informed, boundedly rational traders who adaptively learn optimal strategies using simple multiarmed bandit (MAB) algorithms. The strategies available to…

Theoretical Economics · Economics 2024-11-11 Aleksei Pastushkov

We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin and Alon et al. Fisher and Klimm…

Computer Science and Game Theory · Computer Science 2014-08-01 Nicolas Bousquet , Sergey Norin , Adrian Vetta
‹ Prev 1 4 5 6 7 8 10 Next ›