Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
27
result(s) for
"dominant-strategy implementation"
Sort by:
Bayesian and Dominant-Strategy Implementation in the Independent Private-Values Model
by
Manelli, Alejandro M.
,
Vincent, Daniel R.
in
adverse selection
,
Adverse Selektion
,
Applications
2010
We prove—in the standard independent private-values model—that the outcome, in terms of interim expected probabilities of trade and interim expected transfers, of any Bayesian mechanism can also be obtained with a dominant-strategy mechanism.
Journal Article
Weak Monotonicity Characterizes Deterministic Dominant-Strategy Implementation
by
Bikhchandani, Sushil
,
Chatterji, Shurojit
,
Mu'alem, Ahuva
in
Agency theory
,
Agents
,
Applications
2006
We characterize dominant-strategy incentive compatibility with multidimensional types. A deterministic social choice function is dominant-strategy incentive compatible if and only if it is weakly monotone (W-Mon). The W-Mon requirement is the following: If changing one agent's type (while keeping the types of other agents fixed) changes the outcome under the social choice function, then the resulting difference in utilities of the new and original outcomes evaluated at the new type of this agent must be no less than this difference in utilities evaluated at the original type of this agent.
Journal Article
ON THE EQUIVALENCE OF BAYESIAN AND DOMINANT STRATEGY IMPLEMENTATION
by
Moldovanu, Benny
,
Goeree, Jacob K.
,
Gershkov, Alex
in
Abstimmungsregel
,
Auctions
,
Bayes-Statistik
2013
We consider a standard social choice environment with linear utilities and independent, one-dimensional, private types. We prove that for any Bayesian incentive compatible mechanism there exists an equivalent dominant strategy incentive compatible mechanism that delivers the same interim expected utilities for all agents and the same ex ante expected social surplus. The short proof is based on an extension of an elegant result due to Gutmann, Kemperman, Reeds, and Shepp (1991). We also show that the equivalence between Bayesian and dominant strategy implementation generally breaks down when the main assumptions underlying the social choice model are relaxed or when the equivalence concept is strengthened to apply to interim expected allocations.
Journal Article
Optimal Voting Rules
by
SHI, XIANWEN
,
GERSHKOV, ALEX
,
MOLDOVANU, BENNY
in
Agency theory
,
Incentives
,
Legislative committees
2017
We derive the incentive compatible and ex-ante welfare maximizing (i.e. utilitarian) mechanism for settings with an arbitrary number of agents and alternatives where the privately informed agents have single-crossing and single-peaked preferences. The optimal outcome can be implemented by modifying a sequential voting scheme that is used in many legislatures and committees. The modification uses a flexible majority threshold for each of several alternatives, and allows us to replicate, via a single sequential procedure, the entire class of anonymous, unanimous, and dominant strategy incentive compatible mechanisms. Our analysis relies on elegant characterizations of this class of mechanisms for single-peaked and single-crossing preferences.
Journal Article
On the equivalence of Bayesian and dominant strategy implementation for environments with nonlinear utilities
2019
We extend the equivalence between Bayesian and dominant strategy implementation (Manelli and Vincent in Econometrica 78:1905-1938, 2010; Gershkov et al. in Econometrica 81: 197-220, 2013) to environments with nonlinear utilities satisfying a property of increasing differences over distributions and a convex-valued assumption. The new equivalence result produces novel implications to the literature on the principal-agent problem with allocative externalities, environmental mechanism design, and public good provision.
Journal Article
Implementation in multidimensional dichotomous domains
by
Mishra, Debasis
,
Roy, Souvik
in
cycle monotonicity
,
dichotomous preferences
,
Dominant strategy implementation
2012
We consider deterministic dominant strategy implementation in multidimensional dichotomous domains in private values and quasi-linear utility setting. In such multidimensional domains, an agent’s type is characterized by a single number, the value of the agent, and a non-empty set of acceptable alternatives. Each acceptable alternative gives the agent utility equal to his value and other alternatives give him zero utility. We identity a new condition, which we call generation monotonicity, that is necessary and sufficient for implementability in any dichotomous domain. If such a domain satisfies a richness condition, then a weaker version of generation monotonicity, which we call 2-generation monotonicity (equivalent to 3-cycle monotonicity), is necessary and sufficient for implementation. We use this result to derive the optimal mechanism in a one-sided matching problem with agents having dichotomous types.
Journal Article
Implementation in multidimensional dichotomous domains
2013
We consider deterministic dominant strategy implementation in multidimensional dichotomous domains in private values and quasi-linear utility setting. In such multidimensional domains, an agent’s type is characterized by a single number, the value of the agent, and a non-empty set of acceptable alternatives. Each acceptable alternative gives the agent utility equal to his value and other alternatives give him zero utility. We identity a new condition, which we call generation monotonicity, that is necessary and sufficient for implementability in any dichotomous domain. If such a domain satisfies a richness condition, then a weaker version of generation monotonicity, which we call 2-generation monotonicity (equivalent to 3-cycle monotonicity), is necessary and sufficient for implementation. We use this result to derive the optimal mechanism in a one-sided matching problem with agents having dichotomous types.
Journal Article
A Characterization for Dominant Strategy Implementation
by
Wen, Quan
,
Schwartz, Jesse A
in
Asymmetrische Information
,
Auktionstheorie
,
bilateral bargaining
2013
We introduce a perfect price discriminatingmechanismfor allocation problems with private information. A perfect price discriminating mechanism treats a seller, for example, as a perfect price discriminating monopolist who faces a price schedule that does not depend on her report. In any perfect price discriminating mechanism, every player has a dominant strategy to truthfully report her private information. We establish a characterization for dominant strategy implementation: Any outcome that can be dominant strategy implemented can also be dominant strategy implemented using a perfect price discriminating mechanism. We apply this characterization to derive the optimal, budget-balanced, dominant strategy mechanisms for public good provision and bilateral bargaining.
Journal Article
Coalitionally strategyproof functions depend only on the most-preferred alternatives
2000
In a framework allowing infinitely many individuals, I prove that coalitionally strategyproof social choice functions satisfy \"tops only.\" That is, they depend only on which alternative each individual prefers the most, not on which alternative she prefers the second most, the third,..., or the least. The functions are defined on the domain of profiles measurable with respect to a Boolean algebra of coalitions. The unrestricted domain of profiles is an example of such a domain. I also prove an extension theorem.
Journal Article
Payoff Equivalence between Bayesian and Ex Post Individually Rational Dominant Strategy Mechanisms
1999
An efficient, interim individually rational, ex post budget balanced Bayesian mechanism is shown to be payoff equivalent to an ex post individually rational and ex ante budget balanced dominant strategy mechanism. This result simplifies the search for mechanisms that implement efficient allocation rules by pointing to a class of Groves mechanisms. It eliminates the strict requirement of common knowledge of priors and can be applied to many problems of incomplete information.
Journal Article