English
Related papers

Related papers: Mechanisms without transfers for fully biased agen…

200 papers

A principal wishes to transact business with a multidimensional distribution of agents whose preferences are known only in the aggregate. Assuming a twist (= generalized Spence-Mirrlees single-crossing) hypothesis and that agents can choose…

Optimization and Control · Mathematics 2009-12-17 Alessio Figalli , Young-Heon Kim , Robert J. McCann

We consider the problem of budget feasible mechanism design proposed by Singer (2010), but in a Bayesian setting. A principal has a public value for hiring a subset of the agents and a budget, while the agents have private costs for being…

Computer Science and Game Theory · Computer Science 2015-10-22 Eric Balkanski , Jason D. Hartline

In this paper, we study belief elicitation about an uncertain future event, where the reports will affect a principal's decision. We study two problems that can arise in this setting: (1) Agents may have an interest in the outcome of the…

Computer Science and Game Theory · Computer Science 2023-03-01 Manuel Wuthrich , Mark York , David C. Parkes

Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been implemented the preferences of agents might change and envy might arise. We study the…

Computer Science and Game Theory · Computer Science 2022-02-04 Niclas Boehmer , Robert Bredereck , Klaus Heeger , Dušan Knop , Junjie Luo

Methods for learning optimal policies in autonomous agents often assume that the way the domain is conceptualised---its possible states and actions and their causal structure---is known in advance and does not change during learning. This…

Artificial Intelligence · Computer Science 2018-01-11 Craig Innes , Alex Lascarides , Stefano V Albrecht , Subramanian Ramamoorthy , Benjamin Rosman

The host of a game presents two indistinguishable envelopes to an agent. One of the envelopes is randomly selected and allocated to the agent. The agent is informed that the monetary content of one of the envelopes is twice that of the…

Other Statistics · Statistics 2015-06-16 Jeffrey Brian Tyler

We revisit the classic problem of fair division from a mechanism design perspective, using {\em Proportional Fairness} as a benchmark. In particular, we aim to allocate a collection of divisible items to a set of agents while incentivizing…

Computer Science and Game Theory · Computer Science 2014-02-26 Richard Cole , Vasilis Gkatzelis , Gagan Goel

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

Computer Science and Game Theory · Computer Science 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

The design of privacy mechanisms for two scenarios is studied where the private data is hidden or observable. In the first scenario, an agent observes useful data $Y$, which is correlated with private data $X$, and wants to disclose the…

Information Theory · Computer Science 2023-01-16 Amirreza Zamani , Tobias J. Oechtering , Mikael Skoglund

Recently, Frazier et al. proposed a natural model for crowdsourced exploration of different a priori unknown options: a principal is interested in the long-term welfare of a population of agents who arrive one by one in a multi-armed bandit…

Computer Science and Game Theory · Computer Science 2015-12-29 Li Han , David Kempe , Ruixin Qiang

It is often beneficial for agents to pool their resources in order to better accommodate fluctuations in individual demand. Many multi-round resource allocation mechanisms operate in an online manner: in each round, the agents specify their…

Computer Science and Game Theory · Computer Science 2022-08-02 Fu Li , C. Gregory Plaxton , Vaibhav B. Sinha

A set of divisible resources becomes available over a sequence of rounds and needs to be allocated immediately and irrevocably. Our goal is to distribute these resources to maximize fairness and efficiency. Achieving any non-trivial…

Computer Science and Game Theory · Computer Science 2020-09-29 Vasilis Gkatzelis , Alexandros Psomas , Xizhi Tan

This paper considers the scenario in which there are multiple institutions, each with a limited capacity for candidates, and candidates, each with preferences over the institutions. A central entity evaluates the utility of each candidate…

Data Structures and Algorithms · Computer Science 2024-09-10 L. Elisa Celis , Amit Kumar , Nisheeth K. Vishnoi , Andrew Xu

We analyze a principal-agent procurement problem in which the principal (she) is unaware some of the marginal cost types of the agent (he). Communication arises naturally as some types of the agent may have an incentive to raise the…

Theoretical Economics · Economics 2025-10-27 Alejandro Francetich , Burkhard C. Schipper

Persuasion studies how a principal can influence agents' decisions via strategic information revelation --- often described as a signaling scheme --- in order to yield the most desirable equilibrium outcome. Recently, there has been a large…

Computer Science and Game Theory · Computer Science 2019-10-22 Haifeng Xu

Suppose you run a home exam, where students should report their own scores but can cheat freely. You can, if needed, call a limited number of students to class and verify their actual performance against their reported score. We consider…

Computer Science and Game Theory · Computer Science 2026-02-17 Reshef Meir , Jonathan Wagner , Omer Ben-Porat

Incentives are more likely to elicit desired outcomes when they are designed based on accurate models of agents' strategic behavior. A growing literature, however, suggests that people do not quite behave like standard economic agents in a…

Computer Science and Game Theory · Computer Science 2014-06-09 Arpita Ghosh , Robert Kleinberg

A network of agents attempt to learn some unknown state of the world drawn by nature from a finite set. Agents observe private signals conditioned on the true state, and form beliefs about the unknown state accordingly. Each agent may face…

Machine Learning · Computer Science 2015-03-13 Shahin Shahrampour , Mohammad Amin Rahimian , Ali Jadbabaie

We study the optimal auction design problem when bidders' preferences follow the maxmin expected utility model. We suppose that each bidder's set of priors consists of beliefs close to the seller's belief, where "closeness" is defined by a…

Theoretical Economics · Economics 2021-10-19 Sosung Baik , Sung-Ha Hwang

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang
‹ Prev 1 8 9 10 Next ›