Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Milgrom
Person information
- award (2020): Nobel Memorial Prize in Economic Sciences
- affiliation: Stanford University, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2004
[b1]Paul Milgrom:
Putting Auction Theory to Work. Cambridge University Press 2004, ISBN 978-0-521-53672-1, pp. I-XXII, 1-368
Journal Articles
- 2023
- [j10]Eva M. Meyersson Milgrom, Paul Milgrom
, Ravi Singh:
When Should Control Be Shared? Manag. Sci. 69(1): 404-418 (2023) - [j9]Martin Bichler, Paul Milgrom, Gregor Schwarz:
Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language. Manag. Sci. 69(4): 2217-2238 (2023) - 2021
- [j8]Paul Milgrom, Joshua Mollner:
Extended proper equilibrium. J. Econ. Theory 194: 105258 (2021) - 2017
- [j7]Kevin Leyton-Brown, Paul Milgrom, Ilya Segal:
Economics and computer science of a radio spectrum reallocation. Proc. Natl. Acad. Sci. USA 114(28): 7202-7209 (2017) - 2016
- [j6]Nicholas Arnosti, Marissa Beck, Paul Milgrom:
Adverse Selection and Auction Design for Internet Display Advertising. EAI Endorsed Trans. Scalable Inf. Syst. 3(11): e4 (2016) - 2014
- [j5]John H. Kagel, Yuanchuan Lien, Paul Milgrom:
Ascending prices and package bidding: Further experimental analysis. Games Econ. Behav. 85: 210-231 (2014) - 2010
- [j4]Paul Milgrom:
Simplified mechanisms with an application to sponsored-search auctions. Games Econ. Behav. 70(1): 62-70 (2010) - 2009
- [j3]Paul Milgrom, Bruno H. Strulovici:
Substitute goods, auctions, and equilibrium. J. Econ. Theory 144(1): 212-247 (2009) - 2008
- [j2]Robert Day, Paul Milgrom:
Core-selecting package auctions. Int. J. Game Theory 36(3-4): 393-407 (2008) - 1985
- [j1]Paul R. Milgrom, Robert J. Weber:
Distributional Strategies for Games with Incomplete Information. Math. Oper. Res. 10(4): 619-632 (1985)
Conference and Workshop Papers
- 2022
- [c7]Paul Milgrom, Mitchell Watt:
Linear Pricing Mechanisms for Markets without Convexity. EC 2022: 300 - 2021
- [c6]Mohammad Akbarpour, Scott Duke Kominers, Shengwu Li, Paul R. Milgrom:
Investment Incentives in Near-Optimal Mechanisms. EC 2021: 26 - 2020
- [c5]Neil Newman, Kevin Leyton-Brown, Paul Milgrom, Ilya Segal:
Incentive Auction Design Alternatives: A Simulation Study. EC 2020: 603-604 - 2015
- [c4]Nick Arnosti, Marissa Beck, Paul Milgrom:
Adverse Selection and Auction Design for Internet Display Advertising. EC 2015: 167 - 2014
- [c3]Paul Milgrom, Ilya Segal:
Deferred-acceptance auctions and radio spectrum reallocation. EC 2014: 185-186 - 2008
- [c2]Paul Milgrom:
Assignment Exchanges. WINE 2008: 12 - 2004
- [c1]Meir Bing, Daniel Lehmann, Paul Milgrom:
Presentation and structure of substitutes valuations. EC 2004: 238-239
Informal and Other Publications
- 2017
- [i1]Neil Newman, Kevin Leyton-Brown, Paul Milgrom, Ilya Segal:
Assessing Economic Outcomes in Simulated Reverse Clock Auctions for Radio Spectrum. CoRR abs/1706.04324 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
