Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Soheil Ghili

dblp:96/10093 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0002-8358-9249ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Theory of computation · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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 · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › pricing
bundling
0.612022
A Characterization for Optimal Bundling of Products with Non-Additive Values · EC 2022
Algorithmic game theory and mechanism design › pricing
monopoly pricing
0.612022
A Characterization for Optimal Bundling of Products with Non-Additive Values · EC 2022
Algorithmic game theory and mechanism design
market design
0.412020
Spatial Distribution of Supply and the Role of Market Thickness: Theory and Evidence from Ridesharing · EC 2020
Machine learning › Trustworthy machine learning
fairness
0.412019
Eliminating Latent Discrimination: Train Then Mask · AAAI 2019
Machine learning › Trustworthy machine learning › fairness
fairness criteria
0.412019
Eliminating Latent Discrimination: Train Then Mask · AAAI 2019

Methods — techniques the papers use, named apart from their topics

relative outflows analysis · 0.4supervised learning · 0.4omitted variable bias · 0.4
YearPublicationVenuePosition
2022 A Characterization for Optimal Bundling of Products with Non-Additive Values
abstract
This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is larger than the optimal sales volume for any smaller bundle.
Soheil Ghili
EC1
2020 Spatial Distribution of Supply and the Role of Market Thickness: Theory and Evidence from Ridesharing
abstract
This paper uses both empirical and theoretical methods to answer salient questions about possible geographical distortion of supply from demand: (i) how to empirically infer whether some regions are "under-supplied" relative to others; (ii) howto identify mechanisms that lead to unequal access to supply across regions; and (iii) how to design policies that alleviate geographical supply inequities. If supply in a spatial market (such as rideshare) is geographically distorted from demand, it will lead to disproportionately low demand-fulfillment rates in some regions relative to other regions. However, empirically identifying such spatial distortions is challenging since unfulfilled demand is unobserved. To deal with this issue, we devise an approach, called relative outflows analysis, which has a simple implementation and minimal data requirements. Our method takes advantage of the overlooked fact that individuals do not migrate as often as they take rides, hence for every trip there is a "trip back." Suppose, for example, that Lyft's "relative outflow" in Staten Island (i.e., the number Lyft rides exiting Staten Island divided by those entering it) is consistently around 0.6. Then we conclude that Lyft's supply is distorted away from Staten Island; because the same population that chooses Lyft over other options to enter the borough, is likely to choose other options over Lyft to exit. This conclusion becomes stronger if Uber's relative outflow in Staten Island is consistently close to 1.
Soheil Ghili, Vineet Kumar 0006
EC1
2019 Eliminating Latent Discrimination: Train Then Mask
abstract
How can we control for latent discrimination in predictive models? How can we provably remove it? Such questions are at the heart of algorithmic fairness and its impacts on society. In this paper, we define a new operational fairness criteria, inspired by the well-understood notion of omitted variable-bias in statistics and econometrics. Our notion of fairness effectively controls for sensitive features and provides diagnostics for deviations from fair decision making. We then establish analytical and algorithmic results about the existence of a fair classifier in the context of supervised learning. Our results readily imply a simple, but rather counter-intuitive, strategy for eliminating latent discrimination. In order to prevent other features proxying for sensitive features, we need to include sensitive features in the training phase, but exclude them in the test/evaluation phase while controlling for their effects. We evaluate the performance of our algorithm on several realworld datasets and show how fairness for these datasets can be improved with a very small loss in accuracy.
Soheil Ghili, Ehsan Kazemi 0001, Amin Karbasi
AAAI1