k-Regret Queries with Nonlinear Utilities

Summary: Generalizes k-regret queries beyond linear utilities to convex, concave, and constant-elasticity-of-substitution models, capturing diminishing returns, risk, and substitutability. Derives upper/lower bounds and validates them empirically. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: ha08e84d80963f20e
Venue: VLDB
Year: 2015
Pagerank: 5.9954861e-05
Overall Rank: 5,786 | 61.10%
DOI: 10.14778/2831360.2831364

Incoming Non-self Citations Over Time

Authors

1. Taylor Kessler Faulkner (Denison University)
2. Will Brackenbury (Denison University)
3. Ashwin Lall (Denison University)

BibTeX Citation

@article{faulkner_vldb15,
        title = {{k-Regret Queries with Nonlinear Utilities}},
        author = {Faulkner, Taylor Kessler and Brackenbury, Will and Lall, Ashwin},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {13},
        pages = {2098--2109},
        doi = {10.14778/2831360.2831364},
        url = {https://doi.org/10.14778/2831360.2831364},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,831	Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative	2017	SIGMOD	6.3897334e-05
5,068	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD	6.2893698e-05
6,716	RRR: Rank-Regret Representative	2019	SIGMOD	5.6993087e-05
9,576	Happiness Maximizing Sets under Group Fairness Constraints	2023	VLDB	5.1571823e-05
11,541	Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results	2024	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
342	The Onion Technique: Indexing for Linear Optimization Queries	2000	SIGMOD	0.00020530255
418	PREFER: A System for the Efficient Execution of Multiparametric Ranked Queries	2001	SIGMOD	0.00018617842
817	Finding k-Dominant Skylines in High Dimensional Space	2006	SIGMOD	0.00013672764
1,087	Regret-Minimizing Representative Databases	2010	VLDB	0.00012097722
2,105	Computing k-Regret Minimizing Sets	2014	VLDB	9.0330207e-05
2,545	Interactive Regret Minimization	2012	SIGMOD	8.3178501e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,716	RRR: Rank-Regret Representative	2019	SIGMOD
2	11,582	Robust Best Point Selection under Unreliable User Feedback	2024	VLDB
3	2,105	Computing k-Regret Minimizing Sets	2014	VLDB
4	2,545	Interactive Regret Minimization	2012	SIGMOD
5	7,452	Strongly Truthful Interactive Regret Minimization	2019	SIGMOD
6	4,831	Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative	2017	SIGMOD
7	6,918	A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems	2020	VLDB
8	5,068	Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality	2018	SIGMOD
9	7,032	Minimizing Average Regret Ratio in Database	2016	SIGMOD
10	1,087	Regret-Minimizing Representative Databases	2010	VLDB