Interactive Regret Minimization

Summary: Interactive regret minimization for multi-criteria DB queries; users pick the best from small displays. Shows exponential regret reduction via interaction; tight bounds and moderate per-question size yield few questions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 4578
Venue: SIGMOD
Year: 2012
Pagerank: 8.5086491e-05
Overall Rank: 2,491 | 82.92%
DOI: 10.1145/2213836.2213850

Incoming Non-self Citations Over Time

Authors

1. Danupon Nanongkai (University of Vienna)
2. Ashwin Lall (Denison University)
3. Atish Das Sarma (Google)
4. Kazuhisa Makino (University of Tokyo)

BibTeX Citation

@inproceedings{nanongkai_sigmod12,
        title = {{Interactive Regret Minimization}},
        author = {Nanongkai, Danupon and Lall, Ashwin and Sarma, Atish Das and Makino, Kazuhisa},
        series = {{SIGMOD} '12},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2213836.2213850},
        url = {https://dl.acm.org/doi/10.1145/2213836.2213850},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,063	Computing k-Regret Minimizing Sets	2014	VLDB	9.2399169e-05
4,939	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD	6.4336325e-05
5,654	k-Regret Queries with Nonlinear Utilities	2015	VLDB	6.1330869e-05
6,592	RRR: Rank-Regret Representative	2019	SIGMOD	5.830041e-05
6,636	Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size	2021	SIGMOD	5.8172769e-05
6,786	A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems	2020	VLDB	5.7740702e-05
7,305	Strongly Truthful Interactive Regret Minimization	2019	SIGMOD	5.6501646e-05
7,512	FindYourFavorite: An Interactive System for Finding the User's Favorite Tuple in the Database	2019	SIGMOD	5.6029996e-05
9,393	Happiness Maximizing Sets under Group Fairness Constraints	2023	VLDB	5.2755515e-05
9,901	Interactive Search for One of the Top-k	2021	SIGMOD	5.1997534e-05
11,250	Robust Best Point Selection under Unreliable User Feedback	2024	VLDB	5.093636e-05
11,576	Interactive Mining with Ordered and Unordered Attributes	2022	VLDB	5.093636e-05
12,276	IPS: An Interactive Package Configuration System for Trip Planning	2013	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
333	The Onion Technique: Indexing for Linear Optimization Queries	2000	SIGMOD	0.0002089582
407	PREFER: A System for the Efficient Execution of Multiparametric Ranked Queries	2001	SIGMOD	0.00019021441
792	Finding k-Dominant Skylines in High Dimensional Space	2006	SIGMOD	0.00013979615
1,072	Regret-Minimizing Representative Databases	2010	VLDB	0.0001230281
1,938	Discovering Relative Importance of Skyline Attributes	2009	VLDB	9.4514785e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,832	The Data Interaction Game	2018	SIGMOD
2	6,786	A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems	2020	VLDB
3	5,654	k-Regret Queries with Nonlinear Utilities	2015	VLDB
4	11,250	Robust Best Point Selection under Unreliable User Feedback	2024	VLDB
5	9,901	Interactive Search for One of the Top-k	2021	SIGMOD
6	4,727	Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative	2017	SIGMOD
7	4,939	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD
8	6,886	Minimizing Average Regret Ratio in Database	2016	SIGMOD
9	1,072	Regret-Minimizing Representative Databases	2010	VLDB
10	7,305	Strongly Truthful Interactive Regret Minimization	2019	SIGMOD