English
Related papers

Related papers: Bribeproof mechanisms for two-values domains

200 papers

We study mechanism design when agents may have hidden secondary goals which will manifest as non-trivial preferences among outcomes for which their primary utility is the same. We show that in such cases, a mechanism is robust against…

Computer Science and Game Theory · Computer Science 2023-07-25 Renato Paes Leme , Jon Schneider , Hanrui Zhang

Exchange markets are a significant type of market economy, in which each agent holds a budget and certain (divisible) resources available for trading. Most research on equilibrium in exchange economies is based on an environment of…

Computer Science and Game Theory · Computer Science 2024-10-10 Yusen Zheng , Yukun Cheng , Chenyang Xu , Xiaotie Deng

We are concerned with the problem of introducing credibility type information into reasoning systems. The concept of credibility allows us to discount information provided by agents. An important characteristic of this kind of procedure is…

Artificial Intelligence · Computer Science 2013-04-05 Ronald R. Yager

A variety of constructive manipulation, control, and bribery problems for approval-based multiwinner voting have been extensively studied recently. However, their destructive counterparts seem to be less explored. This paper investigates…

Computer Science and Game Theory · Computer Science 2025-03-19 Yongjie Yang

It is a challenging task to reach global cooperation among self-interested agents, which often requires sophisticated design or usage of incentives. For example, we may apply supervisors or referees who are able to detect and punish…

Physics and Society · Physics 2024-12-20 Ting Ling , Zhang Li , Minyu Feng , Attila Szolnoki

We consider a financial market in discrete time and study pricing and hedging conditional on the information available up to an arbitrary point in time. In this conditional framework, we determine the structure of arbitrage-free prices.…

Mathematical Finance · Quantitative Finance 2023-05-15 Lars Niemann , Thorsten Schmidt

We study non-monetary mechanisms for the fair and efficient allocation of reusable public resources, i.e., resources used for varying durations. We consider settings where a limited resource is repeatedly shared among a set of agents, each…

Computer Science and Game Theory · Computer Science 2023-10-17 Siddhartha Banerjee , Giannis Fikioris , Éva Tardos

We consider a persuasion problem between a sender and a receiver whose utility may be nonlinear in her belief; we call such receivers risk-conscious. Such utility models arise when the receiver exhibits systematic biases away from…

Theoretical Economics · Economics 2023-07-17 Jerry Anunrojwong , Krishnamurthy Iyer , David Lingenbrink

We study the problem of automated mechanism design with partial verification, where each type can (mis)report only a restricted set of types (rather than any other type), induced by the principal's limited verification power. We prove…

Computer Science and Game Theory · Computer Science 2021-04-13 Hanrui Zhang , Yu Cheng , Vincent Conitzer

This paper tackles challenges in pricing and revenue projections due to consumer uncertainty. We propose a novel data-based approach for firms facing unknown consumer type distributions. Unlike existing methods, we assume firms only observe…

Theoretical Economics · Economics 2024-05-28 Duarte Gonçalves , Bruno A. Furtado

Persuasion studies how an informed principal may influence the behavior of agents by the strategic provision of payoff-relevant information. We focus on the fundamental multi-receiver model by Arieli and Babichenko (2019), in which there…

Computer Science and Game Theory · Computer Science 2020-04-01 Matteo Castiglioni , Andrea Celli , Nicola Gatti

We study a problem where a group of agents has to decide how some fixed value should be shared among them. We are interested in settings where the share that each agent receives is based on how that agent is evaluated by other members of…

Computer Science and Game Theory · Computer Science 2013-06-04 Arthur Carvalho , Kate Larson

We propose a framework for threshold cryptosystems under a permissionless-economic model in which the participants are rational profit-maximizing entities. To date, threshold cryptosystems have been considered under permissioned settings…

Cryptography and Security · Computer Science 2019-01-07 David Yakira , Ido Grayevsky , Avi Asayag

Mechanism design is addressed in the context of fair allocations of indivisible goods with monetary compensation. Motivated by a real-world social choice problem, mechanisms with verification are considered in a setting where (i) agents'…

Computer Science and Game Theory · Computer Science 2012-09-18 Gianluigi Greco , Francesco Scarcello

In this paper, we show a tight approximation guarantee for budget-feasible mechanisms with an additive buyer. We propose a new simple randomized mechanism with approximation ratio of $2$, improving the previous best known result of $3$. Our…

Computer Science and Game Theory · Computer Science 2020-07-22 Nick Gravin , Yaonan Jin , Pinyan Lu , Chenhao Zhang

How should a buyer design procurement mechanisms when suppliers' costs are unknown, and the buyer does not have a prior belief? We demonstrate that simple mechanisms - that share a constant fraction of the buyer utility with the seller -…

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

We consider the design of private prediction markets, financial markets designed to elicit predictions about uncertain events without revealing too much information about market participants' actions or beliefs. Our goal is to design market…

Computer Science and Game Theory · Computer Science 2016-02-25 Rachel Cummings , David M. Pennock , Jennifer Wortman Vaughan

Heisenberg-Robertson's uncertainty relation expresses a limitation in the possible preparations of the system by giving a lower bound to the product of the variances of two observables in terms of their commutator. Notably, it does not…

Quantum Physics · Physics 2015-01-07 Lorenzo Maccone , Arun K. Pati

Across machine learning (ML) sub-disciplines researchers make mathematical assumptions to facilitate proof-writing. While such assumptions are necessary for providing mathematical guarantees for how algorithms behave, they also necessarily…

Computers and Society · Computer Science 2020-11-05 A. Feder Cooper

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