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

Multiple unit auctions of an indivisible good*

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(46 citation statements)
references
References 0 publications
0
46
0
Order By: Relevance
“…(=)) Here we use the fact that Incentive compatibility implies (b). A result in Krishna and Maenner (2001) then implies (3). By the convexity of V i , we know that @V i is monotone, so:…”
Section: Appendixmentioning
confidence: 83%
See 2 more Smart Citations
“…(=)) Here we use the fact that Incentive compatibility implies (b). A result in Krishna and Maenner (2001) then implies (3). By the convexity of V i , we know that @V i is monotone, so:…”
Section: Appendixmentioning
confidence: 83%
“…The answer is not obvious since the developer does not know company A's cost parameter, so it does not know which alternative "hurts more." 3 In this paper we show that the optimal threat is to tell A that in the event it does not participate, the seller keeps the invention with probability 1 2 , and makes it open source with probability 1 2 . Faced with this lottery, then company A always participates, and more importantly at the revenue maximizing mechanism is ALWAYS awarded the invention at a price of $450,000.…”
Section: Introductionmentioning
confidence: 93%
See 1 more Smart Citation
“…This is the market clearing price, set by the controller. Furthermore, 12) namely the allocated amount to each user is proportional to its bid [54]. Therefore, socially optimal resource allocation can be achieved by bidding (where each user's bid is a single number), and an appropriate charging scheme.…”
Section: Proportional Allocation Mechanismmentioning
confidence: 99%
“…The single-item optimal auction introduced by Myerson, was later extended for one perfectly divisible item by Maskin, [69], and for the case of multiple homogeneous items by Branco,[12]. We will focus on the latter mechanism.…”
Section: Optimal Auctionsmentioning
confidence: 99%