Competition Law
London (Bar)
13 years ranked
Provided by Brick Court Chambers
Daniel Piccinin KC is a leading specialising in disputes raising complex economic issues, especially in the field of competition law, but also in FRAND litigation in the Patents Court and general commercial disputes. The directories describe him as “a formidable advocate and a future superstar” (Legal 500 2025), “a first-rate intellect” (Chambers & Partners 2025) and “in a league of his own when it comes to complex economic issues” (Legal 500 2024). He has appeared in many of the recent cases in the burgeoning collective action regime, from RoRo (e.g [2024] 2 All ER (Comm) 244) to Apple (e.g. [2024] CAT 23) to Visa (e.g. [2024] CAT 39), and also defended Oppo in a FRAND trial brought by InterDigital in 2024.
Provided by Chambers
Daniel Piccinin KC is highly sought after for his ability to handle varied matters, including defending against individual and collective damages claims following abuse of dominance and cartel decisions. He also acts in appeals against CMA penalty decisions. Piccinin attracts significant attention for his economics background, which enables him to contribute to the economic analysis of complex competition claims.
Provided by Chambers
Daniel is lightning fast and never makes a mistake - it's extraordinary.
He is an absolutely outstanding advocate, I would instruct him on every competition matter if I could. He can cut through massive information and be very strategic.
He is exceptionally bright and hard-working, an excellent cross-examiner and extremely good with clients. I would recommend him without any hesitation at all.
Absolutely outstanding! Daniel is a clever, sharp mind with a great understanding of the pharma industry. He's my first choice barrister for complex cases with competition, IP and regulatory angles.
He's really stellar. He has enormous energy and a depth of understanding of competition economics that not many people have.
Chambers is the leading data and intelligence partner for the legal sector.