1996
DOI: 10.1007/bf02499124
|View full text |Cite
|
Sign up to set email alerts
|

Mechanisms that efficiently verify the optimality of a proposed action

Abstract: D51, D80, D82, Decentralized mechanisms, Message spaces, Communication costs, Exchange economies,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2006
2006
2008
2008

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…18 For the organization considered in 2.2.7 (N − 1 managers and an Allocator), a similar argument (given in Ishikida and Marschak, 1996) establishes that no suitably smooth mechanism can realize the goal function G (defined in 2.2.7) with a message space dimension less than nL (the message-space dimension of the G-realizing price mechanism that we constructed). In our nL-dimensional test class, the kth activity for manager j (who has n j < L activities) uses only the resource k and earns a profit of 2α…”
mentioning
confidence: 76%
See 1 more Smart Citation
“…18 For the organization considered in 2.2.7 (N − 1 managers and an Allocator), a similar argument (given in Ishikida and Marschak, 1996) establishes that no suitably smooth mechanism can realize the goal function G (defined in 2.2.7) with a message space dimension less than nL (the message-space dimension of the G-realizing price mechanism that we constructed). In our nL-dimensional test class, the kth activity for manager j (who has n j < L activities) uses only the resource k and earns a profit of 2α…”
mentioning
confidence: 76%
“…An activity uses resources and it generates profit. There are 12 This example is discussed in Ishikida and Marschak (1996). …”
mentioning
confidence: 99%
“…IM is also related to Sjostrom's (1996) Condition W, but the latter is much stronger in that it allows to construct supporting budget sets verifying x using no information other than x itself. Therefore, Condition W allows F to be fully realized with a "proposed action" protocol described by Ishikida and Marschak (1996), which only announces the alternative to be implemented (formally, F itself satis…es Privacy Preservation).…”
Section: Theorem 2 Choice Rule F Satis…es the Budget Equilibrium Revementioning
confidence: 99%
“…Note that according to De…nition 9, the empty coalition S = ; will block in any state, hence F can only include alternatives in the set X = fx 2 X : (x; ;) = ;g, which we interpret as the set of feasible alternatives. 17 With this notation, a CU choice rule will include those feasible alternatives that are not blocked by nonempty coalitions.…”
Section: A Class Of Intersection-monotonic Choice Rulesmentioning
confidence: 99%
“…Nisan and Segal (2005) show that the answer is "no,"by constructing an allocation problem for which the restriction to demand-query protocols brings about an In general, agents' incentives in a protocol can be manipulated using two instruments: Since this bound is very weak, FS proceed to ask whether it is ever achieved or approached. 36 For BIC implementation, FS do show that the bound is tight, by providing an example in which the communication cost of sel…shness is exponential. The example has two agents:…”
Section: Bits)mentioning
confidence: 98%