Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems

DOI10.1287/ijoc.2022.1190OpenAlexW4224286131MaRDI QIDQ5057996

Kimia Keshanian, Kaushik Dutta, Daniel Zantedeschi

Publication date: 1 December 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1190

zbMATH Keywords

game theoryinformation systemsfeature selectiononline advertisingNash social welfare

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• glmnet
• darch

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed integer second-order cone programming formulations for variable selection in linear regression
• Training restricted Boltzmann machines: an introduction
• Elastic-net regularization in learning theory
• Nonsymmetric Nash solutions and replications of 2-person bargaining
• The Bargaining Problem
• A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING
• Optimal Budget Allocation Across Search Advertising Markets
• Rough set methods in feature selection and recognition
• Approximating the Nash Social Welfare with Indivisible Items
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• Forward-Backward Selection with Early Dropping
• Online Decision Making with High-Dimensional Covariates
• Regularization and Variable Selection Via the Elastic Net
• Feature Selection via Coalitional Game Theory
• A Fast Learning Algorithm for Deep Belief Nets
• Two-Person Cooperative Games
• Gene selection for cancer classification using support vector machines

This page was built for publication: Features Selection as a Nash-Bargaining Solution: Applications in Online Advertising and Information Systems