Robin Burke
@robin-burke.bsky.social
Professor, Information Science, CU Boulder.
Recommender systems, FAccT
Recommender systems, FAccT
Reposted by Robin Burke
October 17, 2025 at 11:18 PM
* BEYOND Workshop: What News Recommendation Research Did (But Mostly Didn't) Teach Us About Building A News Recommender. (coming soon on arXiv, Karl Higley presenting)
Looking forward to seeing colleagues and friends in Prague! #RecSys
Looking forward to seeing colleagues and friends in Prague! #RecSys
September 12, 2025 at 8:10 PM
* BEYOND Workshop: What News Recommendation Research Did (But Mostly Didn't) Teach Us About Building A News Recommender. (coming soon on arXiv, Karl Higley presenting)
Looking forward to seeing colleagues and friends in Prague! #RecSys
Looking forward to seeing colleagues and friends in Prague! #RecSys
* FAccTRec Workshop:
* Envy-Free but Still Unfair: Envy-Freeness in Personalized Recommendation. arxiv.org/abs/2509.09037 (Me presenting)
* Fairness for niche users and providers: algorithmic choice and profile portability. (coming soon on arXiv, me presenting)
* Envy-Free but Still Unfair: Envy-Freeness in Personalized Recommendation. arxiv.org/abs/2509.09037 (Me presenting)
* Fairness for niche users and providers: algorithmic choice and profile portability. (coming soon on arXiv, me presenting)
Envy-Free but Still Unfair: Envy-Freeness Up To One Item (EF-1) in Personalized Recommendation
Envy-freeness and the relaxation to Envy-freeness up to one item (EF-1) have been used as fairness concepts in the economics, game theory, and social choice literatures since the 1960s, and have recen...
arxiv.org
September 12, 2025 at 8:10 PM
* FAccTRec Workshop:
* Envy-Free but Still Unfair: Envy-Freeness in Personalized Recommendation. arxiv.org/abs/2509.09037 (Me presenting)
* Fairness for niche users and providers: algorithmic choice and profile portability. (coming soon on arXiv, me presenting)
* Envy-Free but Still Unfair: Envy-Freeness in Personalized Recommendation. arxiv.org/abs/2509.09037 (Me presenting)
* Fairness for niche users and providers: algorithmic choice and profile portability. (coming soon on arXiv, me presenting)
* Women in RecSys Journal Article of the Year 🏆🏆🏆: Dynamic fairness-aware recommendation through multi-agent social choice. dl.acm.org/doi/full/10.... (Amanda Aird presenting, Session 10: Thursday)
(Amanda is also presenting at the Doctoral Symposium. Find her poster on Monday afternoon!)
(Amanda is also presenting at the Doctoral Symposium. Find her poster on Monday afternoon!)
Envy-Free but Still Unfair: Envy-Freeness Up To One Item (EF-1) in Personalized Recommendation
Envy-freeness and the relaxation to Envy-freeness up to one item (EF-1) have been used as fairness concepts in the economics, game theory, and social choice literatures since the 1960s, and have recen...
arxiv.org
September 12, 2025 at 8:10 PM
* Women in RecSys Journal Article of the Year 🏆🏆🏆: Dynamic fairness-aware recommendation through multi-agent social choice. dl.acm.org/doi/full/10.... (Amanda Aird presenting, Session 10: Thursday)
(Amanda is also presenting at the Doctoral Symposium. Find her poster on Monday afternoon!)
(Amanda is also presenting at the Doctoral Symposium. Find her poster on Monday afternoon!)
CU Boulder has the same policy, but they are also saying that they expect the indirect rate cut to be overturned and will go back to allowing grant submissions after that. They don't want to submit a grant with 15% overhead and then end up stuck with that if/when the policy is overturned.
May 7, 2025 at 3:50 PM
CU Boulder has the same policy, but they are also saying that they expect the indirect rate cut to be overturned and will go back to allowing grant submissions after that. They don't want to submit a grant with 15% overhead and then end up stuck with that if/when the policy is overturned.
I must be still such a CS person 'cause when I read "When Theory Leads", my first thought was "Great, another argument for mathematical proofs of program correctness". 😆
December 6, 2024 at 5:22 PM
I must be still such a CS person 'cause when I read "When Theory Leads", my first thought was "Great, another argument for mathematical proofs of program correctness". 😆
Campus requirement is 6 but we try to get more — 8 to 10 is not unusual. It is kind of bonkers.
November 30, 2024 at 11:17 PM
Campus requirement is 6 but we try to get more — 8 to 10 is not unusual. It is kind of bonkers.