English
Related papers

Related papers: Cursed yet Satisfied Agents

200 papers

Positive feedback trading, which buys when prices rise and sells when prices fall, has long been criticized for being destabilizing as it moves prices away from the fundamentals. Motivated by the relationship between positive feedback…

Mathematical Finance · Quantitative Finance 2021-11-25 Aihua Li

We introduce a dynamic mechanism design problem in which the designer wants to offer for sale an item to an agent, and another item to the same agent at some point in the future. The agent's joint distribution of valuations for the two…

Computer Science and Game Theory · Computer Science 2023-05-22 Christos Papadimitriou , George Pierrakos , Christos-Alexandros Psomas , Aviad Rubinstein

We study the problem of designing truthful and fair mechanisms when allocating a mixture of divisible and indivisible goods. We first show that there does not exist an EFM (envy-free for mixed goods) and truthful mechanism in general. This…

Computer Science and Game Theory · Computer Science 2023-05-17 Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao

We study the problem of fairly allocating indivisible goods among $n$ strategic agents. It is well-known that truthfulness is incompatible with any meaningful fairness notions. We bypass the strong negative result by considering the concept…

Computer Science and Game Theory · Computer Science 2024-07-24 Biaoshuai Tao , Mingwei Yang

From social networks to supply chains, more and more aspects of how humans, firms and organizations interact is mediated by artificial learning agents. As the influence of machine learning systems grows, it is paramount that we study how to…

Multiagent Systems · Computer Science 2022-11-02 Andrea Tacchetti , DJ Strouse , Marta Garnelo , Thore Graepel , Yoram Bachrach

In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (known as the winning price). In SP, for a single item, the…

Machine Learning · Computer Science 2020-01-22 Aritra Ghosh , Saayan Mitra , Somdeb Sarkhel , Jason Xie , Gang Wu , Viswanathan Swaminathan

A seller is selling a pair of divisible complementary goods to an agent. The agent consumes the goods only in a specific ratio and freely disposes of excess in either goods. The value of the bundle and the ratio are private information of…

Theoretical Economics · Economics 2022-07-15 Komal Malik , Kolagani Paramahamsa

We study efficiency loss in Bayesian revenue optimal auctions. We quantify this as the worst case ratio of loss in the realized social welfare to the social welfare that can be realized by an efficient auction. Our focus is on auctions with…

Computer Science and Game Theory · Computer Science 2010-09-14 Vineet Abhishek , Bruce Hajek

We initiate a novel direction in randomized social choice by proposing a new definition of agent utility for randomized outcomes. Each agent has a preference over all outcomes and a {\em quantile} parameter. Given a {\em lottery} over the…

Computer Science and Game Theory · Computer Science 2026-03-03 Ioannis Caragiannis , Fabian Frank , Sanjukta Roy

In practice, incentive providers (i.e., principals) often cannot observe the reward realizations of incentivized agents, which is in contrast to many principal-agent models that have been previously studied. This information asymmetry…

Machine Learning · Computer Science 2023-08-15 Ilgin Dogan , Zuo-Jun Max Shen , Anil Aswani

I study the optimal design of ratings to motivate agent investment in quality when transfers are unavailable. The principal designs a rating scheme that maps the agent's quality to a (possibly stochastic) score. The agent has private…

Theoretical Economics · Economics 2025-08-11 Peiran Xiao

The auction of a single indivisible item is one of the most celebrated problems in mechanism design with transfers. Despite its simplicity, it provides arguably the cleanest and most insightful results in the literature. When the…

Computer Science and Game Theory · Computer Science 2023-07-04 Rangeet Bhattacharyya , Parvik Dave , Palash Dey , Swaprava Nath

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral trade, there is no individually rational (IR), Bayesian…

Computer Science and Game Theory · Computer Science 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

Real-time bidding is the new paradigm of programmatic advertising. An advertiser wants to make the intelligent choice of utilizing a \textbf{Demand-Side Platform} to improve the performance of their ad campaigns. Existing approaches are…

Artificial Intelligence · Computer Science 2022-09-14 Yining Lu , Changjie Lu , Naina Bandyopadhyay , Manoj Kumar , Gaurav Gupta

We consider a social planner faced with a stream of myopic selfish agents. The goal of the social planner is to maximize the social welfare, however, it is limited to using only information asymmetry (regarding previous outcomes) and cannot…

Computer Science and Game Theory · Computer Science 2019-05-15 Lee Cohen , Yishay Mansour

In our multi-agent model agents generate wealth from repeated interactions for which a prisoner's dilemma payoff matrix is assumed. Their gains are taxed by a government at a rate $\alpha$. The resulting budget is spent to cover…

Physics and Society · Physics 2021-06-30 Frank Schweitzer , Luca Verginer , Giacomo Vaccario

We study computational questions in a game-theoretic model that, in particular, aims to capture advertising/persuasion applications such as viral marketing. Specifically, we consider a multi-agent Bayesian persuasion model where an informed…

Computer Science and Game Theory · Computer Science 2016-03-07 Yakov Babichenko , Siddharth Barman

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

Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in…

Computer Science and Game Theory · Computer Science 2016-02-16 Shaddin Dughmi , Haifeng Xu

All-pay auctions, a common mechanism for various human and agent interactions, suffers, like many other mechanisms, from the possibility of players' failure to participate in the auction. We model such failures, and fully characterize…

Computer Science and Game Theory · Computer Science 2017-02-15 Yoad Lewenberg , Omer Lev , Yoram Bachrach , Jeffrey S. Rosenschein
‹ Prev 1 3 4 5 6 7 10 Next ›