Martino Bernasconi

Orcid: 0000-0002-8594-2528

According to our database1, Martino Bernasconi authored at least 18 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Agent-Designed Contracts: How to Sell Hidden Actions.
CoRR, 2024

Multi-Agent Contract Design beyond Binary Actions.
CoRR, 2024

Regret-Minimizing Contracts: Agency Under Uncertainty.
CoRR, 2024

2023
A framework for safe decision making: A convex duality approach.
Intelligenza Artificiale, 2023

No-Regret Learning in Bilateral Trade via Global Budget Balance.
CoRR, 2023

Bandits with Replenishable Knapsacks: the Best of both Worlds.
CoRR, 2023

Advancing Fraud Detection Systems Through Online Learning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases: Applied Data Science and Demo Track, 2023

Persuading Farsighted Receivers in MDPs: the Power of Honesty.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Constrained Phi-Equilibria.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion.
Proceedings of the International Conference on Machine Learning, 2023

2022
Last-iterate Convergence to Trembling-hand Perfect Equilibria.
CoRR, 2022

Sequential Information Design: Learning to Persuade in the Dark.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints.
Proceedings of the International Conference on Machine Learning, 2022

Dark-Pool Smart Order Routing: a Combinatorial Multi-armed Bandit Approach.
Proceedings of the 3rd ACM International Conference on AI in Finance, 2022

The Evolutionary Dynamics of Soft-Max Policy Gradient in Multi-Agent Settings.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Conservative Online Convex Optimization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021

Exploiting Opponents Under Utility Constraints in Sequential Games.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Dealing with transaction costs in portfolio optimization: online gradient descent with momentum.
Proceedings of the ICAIF '20: The First ACM International Conference on AI in Finance, 2020


  Loading...