Incentive compatibility and individual rationality in public good economies

1991 ◽  
Vol 55 (1) ◽  
pp. 203-212 ◽  
Author(s):  
Tatsuyoshi Saijo
Author(s):  
Weiran Shen ◽  
Zihe Wang ◽  
Song Zuo

Motivated by online ad auctions, we consider a repeated auction between one seller and many buyers, where each buyer only has an estimation of her value in each period until she actually receives the item in that period. The seller is allowed to conduct a dynamic auction but must guarantee ex-post individual rationality. In this paper, we use a structure that we call credit accounts to enable a general reduction from any incentive compatible and ex-ante individual rational dynamic auction to an approximate incentive compatible and ex-post individually rational dynamic auction with credit accounts. Our reduction obtains stronger individual rationality guarantees at the cost of weaker incentive compatibility. Surprisingly, our reduction works without any common knowledge assumption. Finally, as a complement to our reduction, we prove that there is no non-trivial auction that is exactly incentive compatible and ex-post individually rational under this setting.


1986 ◽  
Vol 14 (4) ◽  
pp. 448-465 ◽  
Author(s):  
Dennis Sullivan ◽  
Harris Schlesinger

This article analyzes the relationships among three canons of “just” taxation: Pareto optimality, individual rationality, and fairness (nonenvy). Using a helpful device called a Kolm triangle, the analysis shows that the fair and Pareto optimal point need not be individually rational, that it will involve progressive taxation, and that it bears no particular relationship to Lindahl equilibrium, but a rather close relationship to Rawlsian justice.


Author(s):  
Yiling Chen ◽  
Yang Liu ◽  
Juntao Wang

Wagering mechanisms are one-shot betting mechanisms that elicit agents’ predictions of an event. For deterministic wagering mechanisms, an existing impossibility result has shown incompatibility of some desirable theoretical properties. In particular, Pareto optimality (no profitable side bet before allocation) can not be achieved together with weak incentive compatibility, weak budget balance and individual rationality. In this paper, we expand the design space of wagering mechanisms to allow randomization and ask whether there are randomized wagering mechanisms that can achieve all previously considered desirable properties, including Pareto optimality. We answer this question positively with two classes of randomized wagering mechanisms: i) one simple randomized lottery-type implementation of existing deterministic wagering mechanisms, and ii) another family of randomized wagering mechanisms, named surrogate wagering mechanisms, which are robust to noisy ground truth. Surrogate wagering mechanisms are inspired by an idea of learning with noisy labels (Natarajan et al. 2013) as well as a recent extension of this idea to the information elicitation without verification setting (Liu and Chen 2018). We show that a broad set of randomized wagering mechanisms satisfy all desirable theoretical properties.


Author(s):  
Rupert Freeman ◽  
David M. Pennock

We consider an axiomatic view of the Parimutuel Consensus Mechanism defined by Eisenberg and Gale (1959). The parimutuel consensus mechanism can be interpreted as a parimutuel market for wagering with a proxy that bets optimally on behalf of the agents, depending on the bets of the other agents.  We show that the parimutuel consensus mechanism uniquely satisfies the desirable properties of Pareto optimality, individual rationality, budget balance, anonymity, sybilproofness and envy-freeness. While the parimutuel consensus mechanism does violate the key property of incentive compatibility, it is incentive compatible in the limit as the number of agents becomes large. Via simulations on real contest data, we show that violations of incentive compatibility are both rare and only minimally beneficial for the participants. This suggests that the parimutuel consensus mechanism is a reasonable mechanism for eliciting information in practice.


2021 ◽  
Vol 14 (1) ◽  
pp. 1-19
Author(s):  
B. B. Gupta ◽  
Amrita Dahiya

There has been a giant growth in complexity and severity of DDoS attacks from the last past decade. Major research has focused solely on technical solutions. Economic solutions based on incentives have not been given attention. Every DDoS attack is driven by some strong incentive of an attacker. DDoS attacks can only be tackled by providing incentives to legitimate users and at the same time by making attacker deprived of the same. In this paper, VCG-based bidding mechanism has been presented to handle DDoS attacks. VCG is an economic approach used to allocate public good fairly among users. Proposed approach is inherently incentive compatible where attackers do not have any incentive to announce false bid value. Along with making attacker incentive-less, proposed approach is satisfying desirable properties like truthfulness, incentive compatibility, allocative efficiency, and individual rationality. Experimentations have been conducted for proposed method using Java. Output graphs have shown satisfying above mentioned properties.


Author(s):  
James Peck ◽  
Jeevant Rampal

This paper analyzes a monopoly firm’s profit-maximizing mechanism in the following context. There is a continuum of consumers with a unit demand for a good. The distribution of the consumers’ valuations is given by one of two possible demand distributions/states. The consumers are uncertain about the demand state, and they update their beliefs after observing their own valuation for the good. The firm is uncertain about the demand state but infers it from the consumers’ reported valuations. The firm’s problem is to maximize profits by choosing an optimal mechanism among the class of anonymous, deterministic, direct revelation mechanisms that satisfy interim incentive compatibility and ex post individual rationality. We show that, under certain sufficient conditions, the firm’s optimal mechanism is to set the monopoly price in each demand state. Under these conditions, Segal’s optimal ex post mechanism is robust to relaxing ex post incentive compatibility to interim incentive compatibility.


1999 ◽  
Author(s):  
Mark E. Sibicky ◽  
Cortney B. Richardson ◽  
Anna M. Gruntz ◽  
Timothy J. Binegar ◽  
David A. Schroeder ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document