The following pages link to Nicola Gatti (Q505974):
Displaying 34 items.
- Alternating-offers bargaining in one-to-many and many-to-many settings (Q505976) (← links)
- Bargaining over multiple issues in finite horizon alternating-offers protocol (Q870811) (← links)
- Truthful learning mechanisms for multi-slot sponsored search auctions with externalities (Q899160) (← links)
- Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis (Q1039591) (← links)
- Improving multi-armed bandit algorithms in online pricing settings (Q1644914) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- (Q1786600) (redirect page) (← links)
- Towards better models of externalities in sponsored search auctions (Q1786603) (← links)
- Strong Nash equilibria and mixed strategies (Q2021821) (← links)
- Online joint bid/daily budget optimization of Internet advertising campaigns (Q2124437) (← links)
- Bayesian agency: linear versus tractable contracts (Q2124461) (← links)
- A characterization of quasi-perfect equilibria (Q2195700) (← links)
- Committing to correlated strategies with multiple leaders (Q2238721) (← links)
- Leadership in singleton congestion games: what is hard and what is easy (Q2289020) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (Q2309467) (← links)
- Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm (Q2389651) (← links)
- Adversarial patrolling with spatially uncertain alarm signals (Q2407886) (← links)
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
- A Localization Game in Wireless Sensor Networks (Q3056862) (← links)
- (Q4413471) (← links)
- Budgeted Multi-Armed Bandit in Continuous Action Space (Q4576192) (← links)
- Towards better models of externalities in sponsored search auctions (Q4576241) (← links)
- Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria. (Q4580191) (← links)
- Strategic monitor placement against malicious flows (Q4999202) (← links)
- Sliding-Window Thompson Sampling for Non-Stationary Settings (Q5114784) (← links)
- Election Manipulation on Social Networks: Seeding, Edge Removal, Edge Addition (Q5154753) (← links)
- Adopting the Cascade Model in Ad Auctions: Efficiency Bounds and Truthful Algorithmic Mechanisms (Q5370987) (← links)
- Public Bayesian persuasion: being almost optimal and almost persuasive (Q6053476) (← links)
- Increasing revenue in Bayesian posted price auctions through signaling (Q6080654) (← links)
- Designing menus of contracts efficiently: the power of randomization (Q6161464) (← links)
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium (Q6551257) (← links)
- The evolutionary dynamics of soft-max policy gradient in multi-agent settings (Q6658313) (← links)
- Online learning in sequential Bayesian persuasion: handling unknown priors (Q6665730) (← links)
