default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOkke Schrijvers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Luofeng Liao, Christian Kroer, Sergei Leonenkov, Okke Schrijvers, Liang Shi, Nicolás Stier Moses, Congshan Zhang:
Interference Among First-Price Pacing Equilibria: A Bias and Variance Analysis. CoRR abs/2402.07322 (2024)- 2023
- [i10]Fransisca Susan, Negin Golrezaei, Okke Schrijvers:
Multi-Platform Budget Management in Ad Markets with Non-IC Auctions. CoRR abs/2306.07352 (2023) - 2022
- [j7]Vincent Conitzer
, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Nicolás E. Stier Moses, Eric Sodomka, Christopher A. Wilkens:
Pacing Equilibrium in First Price Auction Markets. Manag. Sci. 68(12): 8515-8535 (2022) - [c16]Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan, Okke Schrijvers:
Equilibria in Auctions with Ad Types. WWW 2022: 68-78 - [i9]Bhuvesh Kumar, Jamie Morgenstern, Okke Schrijvers:
Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets. CoRR abs/2202.05881 (2022) - 2021
- [c15]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic bandits for multi-platform budget optimization in online advertising. WWW 2021: 2805-2817 - [i8]Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan, Okke Schrijvers:
Equilibria in Auctions With Ad Types. CoRR abs/2103.06177 (2021) - [i7]Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers:
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising. CoRR abs/2103.10246 (2021) - 2020
- [c14]Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens:
The Ad Types Problem. WINE 2020: 45-58 - [c13]Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka:
Envy, Regret, and Social Welfare Loss. WWW 2020: 2913-2919
2010 – 2019
- 2019
- [c12]Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicolás E. Stier Moses, Chris Wilkens:
Pacing Equilibrium in First-Price Auction Markets. EC 2019: 587 - [c11]Zhe Feng, Okke Schrijvers, Eric Sodomka:
Online Learning for Measuring Incentive Compatibility in Ad Auctions? WWW 2019: 2729-2735 - [i6]Zhe Feng, Okke Schrijvers, Eric Sodomka:
Online Learning for Measuring Incentive Compatibility in Ad Auctions. CoRR abs/1901.06808 (2019) - [i5]Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens:
The Ad Types Problem. CoRR abs/1907.04400 (2019) - [i4]Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka:
Envy, Regret, and Social Welfare Loss. CoRR abs/1907.07721 (2019) - 2018
- [i3]Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicolás E. Stier Moses, Chris Wilkens:
Pacing Equilibrium in First-Price Auction Markets. CoRR abs/1811.07166 (2018) - 2017
- [b1]Okke Schrijvers:
Learning and incentives in computer science. Stanford University, USA, 2017 - [j6]Okke Schrijvers:
Knowledge valorization. XRDS 23(4): 5 (2017) - [j5]Okke Schrijvers:
Crossroads. XRDS 24(1): 5-7 (2017) - [c10]Tim Roughgarden, Okke Schrijvers:
Online Prediction with Selfish Experts. NIPS 2017: 1300-1310 - [i2]Tim Roughgarden, Okke Schrijvers:
Online Prediction with Selfish Experts. CoRR abs/1702.03615 (2017) - 2016
- [j4]Okke Schrijvers:
Impractical, impossible, and interdisciplinary: pushing the boundaries of computer science. XRDS 22(4): 5-6 (2016) - [j3]Okke Schrijvers:
The forgotten promise of technology. XRDS 23(2): 5-7 (2016) - [j2]Tim Roughgarden, Okke Schrijvers:
Network Cost-Sharing without Anonymity. ACM Trans. Economics and Comput. 4(2): 8:1-8:24 (2016) - [c9]Okke Schrijvers, Joseph Bonneau, Dan Boneh, Tim Roughgarden:
Incentive Compatibility of Bitcoin Mining Pool Reward Functions. Financial Cryptography 2016: 477-498 - [c8]Sudipto Guha, Nina Mishra, Gourav Roy, Okke Schrijvers:
Robust Random Cut Forest Based Anomaly Detection on Streams. ICML 2016: 2712-2721 - [c7]Tim Roughgarden, Okke Schrijvers:
Ironing in the Dark. EC 2016: 1-18 - 2015
- [c6]Mohammad Mahdian, Okke Schrijvers, Sergei Vassilvitskii:
Algorithmic Cartography: Placing Points of Interest and Ads on Maps. KDD 2015: 755-764 - [c5]Volodymyr Kuleshov, Okke Schrijvers:
Inverse Game Theory: Learning Utilities in Succinct Games. WINE 2015: 413-427 - [i1]Tim Roughgarden, Okke Schrijvers:
Ironing in the Dark. CoRR abs/1511.06918 (2015) - 2014
- [c4]Tim Roughgarden, Okke Schrijvers:
Network Cost-Sharing without Anonymity. SAGT 2014: 134-145 - 2013
- [j1]Okke Schrijvers, Jarke J. van Wijk:
Visual Explanation of the Complexity in Julia Sets. Comput. Graph. Forum 32(3): 431-440 (2013) - [c3]Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Richard Shewchuk:
Vertex Deletion for 3D Delaunay Triangulations. ESA 2013: 253-264 - [c2]Okke Schrijvers, Frits van Bommel, Kevin Buchin:
Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm. ISVD 2013: 7-15 - 2011
- [c1]Tal Milea, Okke Schrijvers, Kevin Buchin, Herman J. Haverkort:
Shortest-Paths Preserving Metro Maps. GD 2011: 445-446
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-24 23: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:
