English
Related papers

Related papers: Strategyproof Multi-Item Exchange Under Single-Min…

200 papers

New fairness notions aligned with the merit principle are proposed for designing exchange rules. We show that for an obviously strategy-proof, efficient and individually rational rule, (i) an agent receives her favorite object when others…

Theoretical Economics · Economics 2025-10-29 Peng Liu , Huaxia Zeng

Consider a barter exchange problem over a finite set of agents, where each agent owns an item and is also associated with a (privately known) wish list of items belonging to the other agents. An outcome of the problem is a (re)allocation of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yuval Emek , Matan-El Shpiro

Strategyproofness in network auctions requires that bidders not only report their valuations truthfully, but also do their best to invite neighbours from the social network. In contrast to canonical auctions, where the value-monotone…

Computer Science and Game Theory · Computer Science 2025-07-22 Yuhang Guo , Dong Hao , Bin Li , Mingyu Xiao , Bakh Khoussainov

A multi-task learning (MTL) system aims at solving multiple related tasks at the same time. With a fixed model capacity, the tasks would be conflicted with each other, and the system usually has to make a trade-off among learning all of…

Machine Learning · Computer Science 2021-02-16 Xi Lin , Zhiyuan Yang , Qingfu Zhang , Sam Kwong

We study optimal risk sharing among $n$ agents endowed with distortion risk measures. Our model includes market frictions that can either represent linear transaction costs or risk premia charged by a clearing house for the agents. Risk…

Optimization and Control · Mathematics 2012-05-07 M. Ludkovski , V. R. Young

I characterize optimal government policy in a sticky-price economy with different types of consumers and endogenous financial constraints in the banking and entrepreneurial sectors. The competitive equilibrium allocation is constrained…

General Economics · Economics 2025-01-29 Aliaksandr Zaretski

We study the problem of allocating multiple objects to agents without transferable utilities, where each agent may receive more than one object according to a quota. Under lexicographic preferences, we characterize the set of strategyproof,…

Computer Science and Game Theory · Computer Science 2016-12-20 Hadi Hosseini , Kate Larson

I develop a revealed preference framework to test whether an aggregate allocation of indivisible objects satisfies Pareto efficiency and individual rationality (PI) without observing individual preferences. Exploiting the type-based…

Theoretical Economics · Economics 2025-12-30 Umutcan Salman

We provide an elementary proof that revenue-maximizing mechanisms exist in multi-parameter settings whenever the distribution of valuations has finite expectation.

Computer Science and Game Theory · Computer Science 2026-01-07 Sergiu Hart , Noam Nisan

We investigate activities that have different periods of duration. We define the profit intensity as a measure of this economic category. The profit intensity in a repeated trading has a unique property of attaining its maximum at a fixed…

Trading and Market Microstructure · Quantitative Finance 2009-11-13 Edward W. Piotrowski , Jan Sladkowski

We consider one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ either refers to the wining probability of an object or a share of a good, and $t$ denotes the payment that the buyer makes. We define…

Computer Science and Game Theory · Computer Science 2024-10-25 Mridu Prabal Goswami

We introduce the notion of a multidimensional hybrid preference domain on a (finite) set of alternatives that is a Cartesian product of finitely many components. We demonstrate that in a model of public goods provision, multidimensional…

Theoretical Economics · Economics 2023-11-17 Shurojit Chatterji , Huaxia Zeng

We study two-sided matching markets in which one side of the market (the players) does not have a priori knowledge about its preferences for the other side (the arms) and is required to learn its preferences from experience. Also, we assume…

Machine Learning · Computer Science 2021-06-23 Lydia T. Liu , Feng Ruan , Horia Mania , Michael I. Jordan

Situations where a group of agents come together to jointly buy a resource that they individually cannot afford to buy are commonly observed in markets. For example in the US market for radio spectrum, a recent proposal invited small firms…

Computer Science and Game Theory · Computer Science 2015-03-09 Vijay Kamble , Jean Walrand

We study the problem of allocating indivisible goods among strategic agents. We focus on settings wherein monetary transfers are not available and each agent's private valuation is a submodular function with binary marginals, i.e., the…

Computer Science and Game Theory · Computer Science 2021-09-14 Siddharth Barman , Paritosh Verma

The problem of allocating scarce items to individuals is an important practical question in market design. An increasingly popular set of mechanisms for this task uses the concept of market equilibrium: individuals report their preferences,…

Computer Science and Game Theory · Computer Science 2019-12-11 Riley Murray , Christian Kroer , Alex Peysakhovich , Parikshit Shah

We construct an empirically founded model of a repo trade intermediated by two broker-dealers and prove multiple equilibrium and the existence of equilibrium at the joint profit maximizing volume of trade. We then present a smart contract…

Theoretical Economics · Economics 2026-04-21 Daniel Aronoff , Robert M. Townsend

We consider two-sided matching markets, and study the incentives of agents to circumvent a centralized clearing house by signing binding contracts with one another. It is well-known that if the clearing house implements a stable match and…

Computer Science and Game Theory · Computer Science 2015-04-14 Nick Arnosti , Nicole Immorlica , Brendan Lucier

In multi-type resource allocation (MTRA) problems, there are p $\ge$ 2 types of items, and n agents, who each demand one unit of items of each type, and have strict linear preferences over bundles consisting of one item of each type. For…

Computer Science and Game Theory · Computer Science 2020-04-28 Xiaoxi Guo , Sujoy Sikdar , Haibin Wang , Lirong Xia , Yongzhi Cao , Hanpin Wang

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We…

Computer Science and Game Theory · Computer Science 2018-11-20 Liad Blumrosen , Shahar Dobzinski
‹ Prev 1 3 4 5 6 7 10 Next ›