English
Related papers

Related papers: Profitable Bayesian implementation in one-shot mec…

200 papers

In mechanism design theory, a designer would like to implement a desired social choice function which specifies her favorite outcome for each possible profile of agents' types. To do so, the designer constructs a mechanism which describes…

Computer Science and Game Theory · Computer Science 2019-05-02 Haoyang Wu

In mechanism design theory, agents' types are described as their private information, and the designer may reveal some public information to affect agents' types in order to obtain more payoffs. Traditionally, each agent's private type and…

Theoretical Economics · Economics 2023-12-20 Haoyang Wu

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

Good economic mechanisms depend on the preferences of participants in the mechanism. For example, the revenue-optimal auction for selling an item is parameterized by a reserve price, and the appropriate reserve price depends on how much the…

Computer Science and Game Theory · Computer Science 2014-06-10 Shuchi Chawla , Jason Hartline , Denis Nekipelov

The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…

Computer Science and Game Theory · Computer Science 2014-08-08 Vincent Conitzer , Tuomas Sandholm

The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism design is the art of designing the rules of the game so that…

Computer Science and Game Theory · Computer Science 2007-05-23 Vincent Conitzer , Tuomas Sandholm

We investigate the power of randomness in the context of a fundamental Bayesian optimal mechanism design problem--a single seller aims to maximize expected revenue by allocating multiple kinds of resources to "unit-demand" agents with…

Computer Science and Game Theory · Computer Science 2010-02-24 Shuchi Chawla , David Malec , Balasubramanian Sivan

Mechanism design for a social utility being the sum of agents' utilities (SoU) is a well-studied problem. There are, however, a number of problems of theoretical and practical interest where a designer may have a different objective than…

Computer Science and Game Theory · Computer Science 2015-09-29 Abhinav Sinha , Achilleas Anastasopoulos

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 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

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

Computer Science and Game Theory · Computer Science 2020-01-15 Donya Ghavidel , Pratyush Chakraborty , Enrique Baeyens , Vijay Gupta , Pramod P. Khargonekar

The problem of designing a profit-maximizing, Bayesian incentive compatible and individually rational mechanism with flexible consumers and costly heterogeneous supply is considered. In our setup, each consumer is associated with a…

Computer Science and Game Theory · Computer Science 2018-02-01 Shiva Navabi , Ashutosh Nayyar

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

Computer Science and Game Theory · Computer Science 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

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

We consider the problem of designing an expected-revenue maximizing mechanism for allocating multiple non-perishable goods of $k$ varieties to flexible consumers over $T$ time steps. In our model, a random number of goods of each variety…

Computer Science and Game Theory · Computer Science 2020-07-08 Shiva Navabi , Ashutosh Nayyar

We develop a tool akin to the revelation principle for dynamic mechanism-selection games in which the designer can only commit to short-term mechanisms. We identify a canonical class of mechanisms rich enough to replicate the outcomes of…

Theoretical Economics · Economics 2021-12-13 Laura Doval , Vasiliki Skreta

Agents often have individual goals which depend on a group's actions. If agents trust a forecast of collective action and adapt strategically, such prediction can influence outcomes non-trivially, resulting in a form of performative…

Machine Learning · Computer Science 2025-02-18 António Góis , Mehrnaz Mofakhami , Fernando P. Santos , Gauthier Gidel , Simon Lacoste-Julien

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

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

One of the most celebrated results in mechanism design is Myerson's characterization of the revenue optimal auction for selling a single item. However, this result relies heavily on the assumption that buyers are indifferent to risk. In…

Computer Science and Game Theory · Computer Science 2018-10-08 Evdokia Nikolova , Emmanouil Pountourakis , Ger Yang
‹ Prev 1 2 3 10 Next ›