default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Lubin
Person information
- affiliation: Boston University, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Benedikt Bünz
, Benjamin Lubin, Sven Seuken:
Designing Core-Selecting Payment Rules: A Computational Search Approach. Inf. Syst. Res. 33(4): 1157-1173 (2022)- [c17]Jakob Weissteiner, Chris Wendler, Sven Seuken, Benjamin Lubin, Markus Püschel:
Fourier Analysis-based Iterative Combinatorial Auctions. IJCAI 2022: 549-556 - 2021
- [c16]Manuel Beyeler, Gianluca Brero, Benjamin Lubin, Sven Seuken:
iMLCA: Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding. EC 2021: 136 - 2020
- [j5]Vitor Bosshard, Benedikt Bünz, Benjamin Lubin, Sven Seuken:
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification. J. Artif. Intell. Res. 69: 531-570 (2020) - [i9]Jakob Weissteiner, Chris Wendler, Sven Seuken, Benjamin Lubin, Markus Püschel:
Fourier Analysis-based Iterative Combinatorial Auctions. CoRR abs/2009.10749 (2020) - [i8]Manuel Beyeler, Gianluca Brero, Benjamin Lubin, Sven Seuken:
Machine Learning-powered Iterative Combinatorial Auctions with Interval Bidding. CoRR abs/2009.13605 (2020)
2010 – 2019
- 2019
- [c15]Sébastien Lahaie, Benjamin Lubin:
Adaptive-Price Combinatorial Auctions. EC 2019: 749-750 - [i7]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Machine Learning-powered Iterative Combinatorial Auctions. CoRR abs/1911.08042 (2019) - 2018
- [c14]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Combinatorial Auctions via Machine Learning-based Preference Elicitation. IJCAI 2018: 128-136 - [c13]Benedikt Bünz, Benjamin Lubin, Sven Seuken:
Designing Core-selecting Payment Rules: A Computational Search Approach. EC 2018: 109 - [i6]Vitor Bosshard, Benedikt Bünz, Benjamin Lubin, Sven Seuken:
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification. CoRR abs/1812.01955 (2018) - 2017
- [c12]Gianluca Brero, Benjamin Lubin, Sven Seuken:
Probably Approximately Efficient Combinatorial Auctions via Machine Learning. AAAI 2017: 397-405 - [c11]Michael Weiss, Benjamin Lubin, Sven Seuken:
SATS: A Universal Spectrum Auction Test Suite. AAMAS 2017: 51-59 - [c10]Vitor Bosshard, Benedikt Bünz, Benjamin Lubin, Sven Seuken:
Computing Bayes-Nash Equilibria in Combinatorial Auctions with Continuous Value and Action Spaces. IJCAI 2017: 119-127 - 2015
- [j4]Jesse Shore, Benjamin Lubin:
Spectral goodness of fit for network models. Soc. Networks 43: 16-27 (2015) - [j3]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. ACM Trans. Economics and Comput. 3(1): 5:1-5:41 (2015) - [c9]Benedikt Bünz, Sven Seuken, Benjamin Lubin:
A Faster Core Constraint Generation Algorithm for Combinatorial Auctions. AAAI 2015: 827-834 - [c8]Maryam Ghasemi, Benjamin Lubin:
Modeling Multi-Attribute Demand for Sustainable Cloud Computing with Copulae. IJCAI 2015: 2596-2602 - [i5]Benjamin Lubin:
Games and Meta-Games: Pricing Rules for Combinatorial Mechanisms. CoRR abs/1503.06244 (2015) - 2014
- [j2]Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee:
Market mechanisms for managing datacenters with heterogeneous microarchitectures. ACM Trans. Comput. Syst. 32(1): 3:1-3:31 (2014) - [c7]Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee:
Strategies for anticipating risk in heterogeneous system design. HPCA 2014: 154-164 - [i4]Jesse Shore, Benjamin Lubin:
Spectral goodness of fit for network models. CoRR abs/1407.7247 (2014) - 2013
- [c6]Marisabel Guevara, Benjamin Lubin, Benjamin C. Lee:
Navigating heterogeneous processors with market mechanisms. HPCA 2013: 95-106 - [i3]Benjamin Lubin, Jesse Shore, Vatche Ishakian:
Communication Network Design: Balancing Modularity and Mixing via Optimal Graph Spectra. CoRR abs/1308.3174 (2013) - 2012
- [c5]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment rules through discriminant-based classifiers. EC 2012: 477-494 - [i2]Benjamin Lubin, David C. Parkes:
Quantifying the Strategyproofness of Mechanisms via Metrics on Payoff Distributions. CoRR abs/1205.2630 (2012) - [i1]Paul Dütting, Felix A. Fischer, Pichayut Jirapinyo, John K. Lai, Benjamin Lubin, David C. Parkes:
Payment Rules through Discriminant-Based Classifiers. CoRR abs/1208.1184 (2012) - 2011
- [c4]George M. Wyner, Benjamin Lubin:
From Hello World to Interface Design in Three Days: Teaching Non-technical Students to Use an API. AMCIS 2011
2000 – 2009
- 2009
- [c3]Benjamin Lubin, Jeffrey O. Kephart, Rajarshi Das, David C. Parkes:
Expressive Power-Based Resource Allocation for Data Centers. IJCAI 2009: 1451-1456 - [c2]Benjamin Lubin, David C. Parkes:
Quantifying the Strategyproofness of Mechanisms via Metrics on Payoff Distributions. UAI 2009: 349-358 - 2008
- [j1]Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, Sébastien Lahaie, Jeffrey Shneidman, David C. Parkes:
ICE: An Expressive Iterative Combinatorial Exchange. J. Artif. Intell. Res. 33: 33-77 (2008) - 2005
- [c1]David C. Parkes, Ruggiero Cavallo, Nick Elprin, Adam I. Juda, Sébastien Lahaie, Benjamin Lubin, Loizos Michael, Jeffrey Shneidman, Hassan Sultan:
ICE: an iterative combinatorial exchange. EC 2005: 249-258
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 22:56 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:
