default search action
Michael H. Rothkopf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j38]Justin Jia
, Ronald M. Harstad, Michael H. Rothkopf:
Information Variability Impacts in Auctions. Decis. Anal. 7(1): 137-142 (2010) - [j37]Peter T. L. Popkowski Leszczyc
Charitable Motives and Bidding in Charity Auctions. Manag. Sci. 56(3): 399-413 (2010)
2000 – 2009
- 2008
- [j36]Phillip G. Bradford, Sunju Park, Michael H. Rothkopf, Heejin Park:
Protocol completion incentive problems in cryptographic Vickrey auctions. Electron. Commer. Res. 8(1-2): 57-77 (2008) - 2007
- [j35]Michael H. Rothkopf:
Decision Analysis: The Right Tool for Auctions. Decis. Anal. 4(3): 167-172 (2007) - [j34]Michael H. Rothkopf:
Editorial: The Seventh Interfaces Ranking of Universities' Contributions to the Practice Literature. Interfaces 37(6): 566-569 (2007) - [j33]Michael H. Rothkopf:
Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical. Oper. Res. 55(2): 191-197 (2007) - [j32]Esther David, Alex Rogers, Nicholas R. Jennings
Optimal design of english auctions with discrete bid levels. ACM Trans. Internet Techn. 7(2): 12 (2007) - 2005
- [j31]Wedad Elmaghraby, Pinar Keskinocak, Michael H. Rothkopf:
Introduction. Electron. Commer. Res. 5(2): 175-180 (2005) - [j30]Sunju Park, Michael H. Rothkopf:
Auctions with bidder-determined allowable combinations. Eur. J. Oper. Res. 161(2): 399-415 (2005) - [j29]Richard P. O'Neill, Paul M. Sotkiewicz, Benjamin F. Hobbs, Michael H. Rothkopf, William R. Stewart:
Efficient market-clearing prices in markets with nonconvexities. Eur. J. Oper. Res. 164(1): 269-285 (2005) - [j28]Michael H. Rothkopf:
Editorial: The Sixth Interfaces Ranking of Universities' Contributions to the Practice Literature. Interfaces 35(5): 425-428 (2005) - [j27]Michael H. Rothkopf:
IFORS' Operational Research Hall of Fame Hugh Jordan Miser. Int. Trans. Oper. Res. 12(2): 259-262 (2005) - [j26]Octavian Carare
Slow Dutch Auctions. Manag. Sci. 51(3): 365-373 (2005) - 2004
- [j25]Michael H. Rothkopf:
Editorial: The Fifth Interfaces Ranking of Universities' Contributions to the Practice Literature. Interfaces 34(2): 135-138 (2004) - 2003
- [j24]Michael H. Rothkopf, Ronald M. Harstad, Yuhong Fu:
Is Subsidizing Inefficient Bidders Actually Costly? Manag. Sci. 49(1): 71-84 (2003) - [j23]Aleksandar Pekec, Michael H. Rothkopf:
Combinatorial Auction Design. Manag. Sci. 49(11): 1485-1503 (2003) - 2002
- [j22]Michael H. Rothkopf:
Editorial: Leveling the Field? The Fourth Interfaces Ranking of Universities' Contribution to the Practice Literature. Interfaces 32(2): 23-27 (2002) - 2001
- [j21]Terry P. Harrison, Michael H. Rothkopf:
Editorial: An Initiative to Help Preserve the History of OR/MS. Interfaces 31(3): 1-2 (2001) - [j20]Michael H. Rothkopf, Terry P. Harrison:
Editorial: The Oracle's Last Words. Interfaces 31(4): 15-16 (2001) - [j19]Michael H. Rothkopf, Sunju Park:
An Elementary Introduction to Auctions. Interfaces 31(6): 83-97 (2001) - 2000
- [j18]Michael H. Rothkopf:
Under the Mike-R-Scope: What Happened at Xerox PARC? Interfaces 30(6): 91-94 (2000)
1990 – 1999
- 1999
- [j17]Michael H. Rothkopf:
Editorial: The Third Interfaces Ranking of Universities' Contributions to the Practice Literature. Interfaces 29(6): 107-111 (1999) - 1998
- [j16]Michael H. Rothkopf:
Editorial: Personal OR/MS. Interfaces 28(4): 13-14 (1998) - 1995
- [j15]Ronald M. Harstad, Michael H. Rothkopf:
Withdrawable Bids as Winner's Curse Insurance. Oper. Res. 43(6): 983-994 (1995) - 1994
- [j14]Michael H. Rothkopf:
Ten Years of the OR Practice Section. Oper. Res. 42(1): 31-33 (1994) - [j13]Uriel G. Rothblum, Michael H. Rothkopf:
Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices. Oper. Res. 42(4): 669-676 (1994) - [p2]Michael H. Rothkopf:
Chapter 19 Models of auctions and competitive bidding. Operations research and the public sector 1994: 673-699 - [p1]Stephen M. Pollock, Michael H. Rothkopf, Arnold Barnett:
Preface. Operations research and the public sector 1994: v-viii - [e1]Stephen M. Pollock, Michael H. Rothkopf, Arnold Barnett:
Operations research and the public sector. Handbooks in operations research and management science 6, North-Holland 1994, ISBN 978-0-444-89204-1 [contents]
1980 – 1989
- 1989
- [j12]Harvey M. Wagner, Michael H. Rothkopf, Clayton J. Thomas, Hugh J. Miser:
OR Forum - The Next Decade in Operations Research: Comments on the Condor Report. Oper. Res. 37(4): 664-672 (1989) - 1987
- [j11]Michael H. Rothkopf, Paul Rech:
Perspectives on Queues: Combining Queues is Not Always Beneficial. Oper. Res. 35(6): 906-909 (1987) - 1985
- [j10]Stephen A. Smith, Michael H. Rothkopf:
Simultaneous Bidding with a Fixed Charge if Any Bid is Successful. Oper. Res. 33(1): 28-37 (1985) - 1984
- [j9]Michael H. Rothkopf:
OR Practice - Area Editor Statement. Oper. Res. 32(1): 5-6 (1984) - [j8]Michael H. Rothkopf, Stephen A. Smith:
Technical Note - There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs. Oper. Res. 32(2): 451-456 (1984) - 1980
- [j7]Michael H. Rothkopf:
TREES - A Decision-Maker's Lament. Oper. Res. 28(1): 3 (1980) - [j6]Michael H. Rothkopf:
On Multiplicative Bidding Strategies. Oper. Res. 28(3-Part-I): 570-575 (1980) - [j5]Michael H. Rothkopf:
Equilibrium Linear Bidding Strategies. Oper. Res. 28(3-Part-I): 576-583 (1980)
1970 – 1979
- 1979
- [j4]Robert M. Stark, Michael H. Rothkopf:
Competitive Bidding: A Comprehensive Bibliography. Oper. Res. 27(2): 364-390 (1979) - 1977
- [j3]Michael H. Rothkopf:
Bidding in Simultaneous Auctions with a Constraint on Exposure. Oper. Res. 25(4): 620-629 (1977) - 1975
- [j2]Shmuel S. Oren, Michael H. Rothkopf:
Optimal Bidding in Sequential Auctions. Oper. Res. 23(6): 1080-1090 (1975)
1960 – 1969
- 1968
- [j1]Michael H. Rothkopf, S. Fromovitz:
Models for a Save-Discard Decision. Oper. Res. 16(6): 1186-1193 (1968)
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 05:41 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: