| Publication | Date of Publication | Type |
|---|
Online learning in sequential Bayesian persuasion: handling unknown priors
Artificial Intelligence | 2025-01-17 | Paper |
The evolutionary dynamics of soft-max policy gradient in multi-agent settings
Theoretical Computer Science | 2025-01-08 | Paper |
Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
Journal of the ACM | 2024-06-06 | Paper |
Increasing revenue in Bayesian posted price auctions through signaling
Artificial Intelligence | 2023-10-04 | Paper |
Public Bayesian persuasion: being almost optimal and almost persuasive
Algorithmica | 2023-09-27 | Paper |
Designing menus of contracts efficiently: the power of randomization
Artificial Intelligence | 2023-06-27 | Paper |
Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models
Artificial Intelligence | 2023-01-04 | Paper |
Bayesian agency: linear versus tractable contracts
Artificial Intelligence | 2022-04-11 | Paper |
Online joint bid/daily budget optimization of Internet advertising campaigns
Artificial Intelligence | 2022-04-11 | Paper |
Committing to correlated strategies with multiple leaders
Artificial Intelligence | 2021-11-02 | Paper |
Election manipulation on social networks: seeding, edge removal, edge addition
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
| Strategic monitor placement against malicious flows | 2021-07-06 | Paper |
Strong Nash equilibria and mixed strategies
International Journal of Game Theory | 2021-04-27 | Paper |
A characterization of quasi-perfect equilibria
Games and Economic Behavior | 2020-08-27 | Paper |
Sliding-Window Thompson Sampling for Non-Stationary Settings
Journal of Artificial Intelligence Research | 2020-06-26 | Paper |
Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case
Algorithmica | 2020-04-01 | Paper |
Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
EURO Journal on Computational Optimization | 2020-03-25 | Paper |
Leadership in singleton congestion games: what is hard and what is easy
Artificial Intelligence | 2020-01-20 | Paper |
Leadership in singleton congestion games: what is hard and what is easy
Artificial Intelligence | 2020-01-20 | Paper |
Towards better models of externalities in sponsored search auctions
Theoretical Computer Science | 2018-09-24 | Paper |
| Bilevel programming approaches to the computation of optimistic and pessimistic single-leader-multi-follower equilibria | 2018-08-13 | Paper |
Towards better models of externalities in sponsored search auctions
(available as arXiv preprint) | 2018-07-12 | Paper |
| Budgeted multi-armed bandit in continuous action space | 2018-07-12 | Paper |
Improving multi-armed bandit algorithms in online pricing settings
International Journal of Approximate Reasoning | 2018-06-22 | Paper |
Adopting the cascade model in ad auctions: efficiency bounds and truthful algorithmic mechanisms
Journal of Artificial Intelligence Research | 2017-10-24 | Paper |
Adversarial patrolling with spatially uncertain alarm signals
Artificial Intelligence | 2017-10-06 | Paper |
Adversarial patrolling with spatially uncertain alarm signals
Artificial Intelligence | 2017-10-06 | Paper |
Alternating-offers bargaining in one-to-many and many-to-many settings
Annals of Mathematics and Artificial Intelligence | 2017-01-27 | Paper |
Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
Artificial Intelligence | 2015-12-21 | Paper |
Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
Artificial Intelligence | 2012-11-15 | Paper |
A localization game in wireless sensor networks
Lecture Notes in Computer Science | 2010-11-23 | Paper |
Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis
Annals of Mathematics and Artificial Intelligence | 2009-11-23 | Paper |
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
Artificial Intelligence | 2009-07-17 | Paper |
Bargaining over multiple issues in finite horizon alternating-offers protocol
Annals of Mathematics and Artificial Intelligence | 2007-03-15 | Paper |
| scientific article; zbMATH DE number 1950763 (Why is no real title available?) | 2003-07-20 | Paper |
