EDBT 2026 Demo / reviewers in the wild / expert
Luca D'Amico-Wong
dblp:330/9302
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2024
0009-0007-0142-6467ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Algorithmic game theory and mechanism design · 88% Computational complexity · 12% | |
| Databases, data mining, and information retrieval
2 papers |
Data integration and cleaning · 73% Data mining · 27% | |
| Artificial intelligence
2 papers |
Information extraction and text analysis · 57% Representation and self-supervised learning · 43% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 13 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithmic game theory and mechanism design
matching |
1.5 | 2 | 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization · EC 2024 Strategic Recommendation: Revenue Optimal Matching for Online Platforms (Student Abstract) · AAAI 2024 |
Data mining
dataset construction |
0.8 | 1 | 2024 | Newswire: A Large-Scale Structured Database of a Century of Historical News · NeurIPS 2024 |
Data integration and cleaning
entity disambiguation |
0.8 | 1 | 2024 | Newswire: A Large-Scale Structured Database of a Century of Historical News · NeurIPS 2024 |
Algorithmic game theory and mechanism design › market equilibrium
competitive equilibrium |
0.8 | 1 | 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization · EC 2024 |
Algorithmic game theory and mechanism design
market design |
0.8 | 1 | 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization · EC 2024 |
Algorithmic game theory and mechanism design
revenue maximization |
0.8 | 1 | 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization · EC 2024 |
Algorithmic game theory and mechanism design › matching
trading networks |
0.8 | 1 | 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue Maximization · EC 2024 |
Algorithmic game theory and mechanism design › market design
two-sided market |
0.8 | 1 | 2024 | Strategic Recommendation: Revenue Optimal Matching for Online Platforms (Student Abstract) · AAAI 2024 |
Natural language and speech › Information extraction and text analysis › document understanding
document layout analysis |
0.7 | 1 | 2023 | American Stories: A Large-Scale Structured Text Dataset of Historical U.S. Newspapers · NeurIPS 2023 |
Machine learning › Representation and self-supervised learning › pre-training
pretraining data |
0.7 | 1 | 2023 | American Stories: A Large-Scale Structured Text Dataset of Historical U.S. Newspapers · NeurIPS 2023 |
Data integration and cleaning › entity resolution
deduplication |
0.7 | 1 | 2023 | Noise-Robust De-Duplication at Scale · ICLR 2023 |
Data integration and cleaning
entity resolution |
0.7 | 1 | 2023 | Noise-Robust De-Duplication at Scale · ICLR 2023 |
Natural language and speech › Information extraction and text analysis
named entity recognition |
0.2 | 1 | 2024 | Newswire: A Large-Scale Structured Database of a Century of Historical News · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
neural topic classification · 2.3deep learning pipeline · 2.3bi-encoder model · 2.3transformer · 1.3deep learning · 1.3OCR · 1.3polynomial-time algorithm · 0.8competitive equilibrium analysis · 0.8competitive equilibrium · 0.8noise-robust learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Strategic Recommendation: Revenue Optimal Matching for Online Platforms (Student Abstract)abstractWe consider a platform in a two-sided market with unit-supply sellers and unit-demand buyers. Each buyer can transact with a subset of sellers it knows off platform and another seller that the platform recommends. Given the choice of sellers, transactions and prices form a competitive equilibrium. The platform selects one seller for each buyer, and charges a fixed percentage of prices to all transactions that it recommends. The platform seeks to maximize total revenue. We show that the platform's problem is NP-hard, even when each buyer knows at most two buyers off platform. Finally, when each buyer values all sellers equally and knows only one buyer off platform, we provide a polynomial time algorithm that optimally solves the problem. Luca D'Amico-Wong, Gary Qiurui Ma, David C. Parkes |
AAAI | 1 |
| 2024 | Newswire: A Large-Scale Structured Database of a Century of Historical NewsabstractIn the U.S. historically, local newspapers drew their content largely from newswires like the Associated Press. Historians argue that newswires played a pivotal role in creating a national identity and shared understanding of the world, but there is no comprehensive archive of the content sent over newswires. We reconstruct such an archive by applying a customized deep learning pipeline to hundreds of terabytes of raw image scans from thousands of local newspapers. The resulting dataset contains 2.7 million unique public domain U.S. news wire articles, written between 1878 and 1977. Locations in these articles are georeferenced, topics are tagged using customized neural topic classification, named entities are recognized, and individuals are disambiguated to Wikipedia using a novel entity disambiguation model. To construct the Newswire dataset, we first recognize newspaper layouts and transcribe around 138 millions structured article texts from raw image scans. We then use a customized neural bi-encoder model to de-duplicate reproduced articles, in the presence of considerable abridgement and noise, quantifying how widely each article was reproduced. A text classifier is used to ensure that we only include newswire articles, which historically are in the public domain. The structured data that accompany the texts provide rich information about the who (disambiguated individuals), what (topics), and where (georeferencing) of the news that millions of Americans read over the course of a century. We also include Library of Congress metadata information about the newspapers that ran the articles on their front pages. The Newswire dataset is useful both for large language modeling - expanding training data beyond what is available from modern web texts - and for studying a diversity of questions in computational linguistics, social science, and the digital humanities. Emily Silcock, Abhishek Arora 0003, Luca D'Amico-Wong, Melissa Dell |
NeurIPS | 3 |
| 2024 | Disrupting Bipartite Trading Networks: Matching for Revenue MaximizationabstractWe model the role of an online platform disrupting a market with unit-demand buyers and unit-supply sellers. Each seller can transact with a subset of the buyers whom she already knows, as well as with any additional buyers to whom she is introduced by the platform. Given these constraints on trade, prices and transactions are induced by a competitive equilibrium. The platform's revenue is proportional to the total price of all trades between platform-introduced buyers and sellers. Luca D'Amico-Wong, Yannai A. Gonczarowski, Gary Qiurui Ma, David C. Parkes |
EC | 1 |
| 2023 | Noise-Robust De-Duplication at Scale
Emily Silcock, Luca D'Amico-Wong, Jinglin Yang, Melissa Dell |
ICLR | 2 |
| 2023 | American Stories: A Large-Scale Structured Text Dataset of Historical U.S. NewspapersabstractExisting full text datasets of U.S. public domain newspapers do not recognize the often complex layouts of newspaper scans, and as a result the digitized content scrambles texts from articles, headlines, captions, advertisements, and other layout regions. OCR quality can also be low. This study develops a novel, deep learning pipeline for extracting full article texts from newspaper images and applies it to the nearly 20 million scans in Library of Congress's public domain Chronicling America collection. The pipeline includes layout detection, legibility classification, custom OCR, and association of article texts spanning multiple bounding boxes. To achieve high scalability, it is built with efficient architectures designed for mobile phones. The resulting American Stories dataset provides high quality data that could be used for pre-training a large language model to achieve better understanding of historical English and historical world knowledge. The dataset could also be added to the external database of a retrieval-augmented language model to make historical information - ranging from interpretations of political events to minutiae about the lives of people's ancestors - more widely accessible. Furthermore, structured article texts facilitate using transformer-based methods for popular social science applications like topic classification, detection of reproduced content, and news story clustering. Finally, American Stories provides a massive silver quality dataset for innovating multimodal layout analysis models and other multimodal applications. Melissa Dell, Jacob Carlson, Tom Bryan, Emily Silcock, Abhishek Arora 0003, Shannon Shen 0001, Luca D'Amico-Wong, Quan Le, Pablo Querubin, Leander Heldring |
NeurIPS | 7 |