The following pages link to Tuomas Sandholm (Q192137):
Displaying 48 items.
- (Q236270) (redirect page) (← links)
- Computing optimal outcomes under an expressive representation of settings with externalities (Q414842) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games (Q431003) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- Coalitions among computationally bounded agents (Q1391349) (← links)
- Compressing two-dimensional routing tables (Q1402210) (← links)
- (Q1583468) (redirect page) (← links)
- Leveled commitment contracts with myopic and strategic agents (Q1583469) (← links)
- Coalition structure generation with worst case guarantees (Q1606306) (← links)
- Efficiency and budget balance in general quasi-linear domains (Q1735779) (← links)
- Limited lookahead in imperfect-information games (Q1989388) (← links)
- Strong Nash equilibria and mixed strategies (Q2021821) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- The Gates-Hillman prediction market (Q2375889) (← links)
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents (Q2384141) (← links)
- Complexity of constructing solutions in the core based on synergies among coalitions (Q2457626) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
- (Q2722003) (← links)
- Automated design of revenue-maximizing combinatorial auctions (Q2795862) (← links)
- Efficiency and Budget Balance (Q2959843) (← links)
- (Q3093198) (← links)
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games (Q3169104) (← links)
- Online algorithms for market clearing (Q3455219) (← links)
- When are elections with few candidates hard to manipulate? (Q3546334) (← links)
- Lossless abstraction of imperfect information games (Q3546346) (← links)
- Algorithms for Closed Under Rational Behavior (CURB) Sets (Q3588639) (← links)
- A New Solution Concept for Coalitional Games in Open Anonymous Environments (Q3617024) (← links)
- Better with Byzantine: Manipulation-Optimal Mechanisms (Q3648843) (← links)
- (Q4420996) (← links)
- (Q4420998) (← links)
- (Q4427880) (← links)
- Learning Theory (Q4680872) (← links)
- Anytime coalition structure generation: an average case study (Q4779480) (← links)
- (Q4829037) (← links)
- Coalition formation processes with belief revision among bounded-rational self-interested agents (Q4943499) (← links)
- Superhuman AI for heads-up no-limit poker: Libratus beats top professionals (Q4967518) (← links)
- Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
- Superhuman AI for multiplayer poker (Q5218598) (← links)
- Learning Theory and Kernel Machines (Q5305838) (← links)
- Financial Cryptography and Data Security (Q5712257) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897191) (← links)
- Leveled commitment contracts and strategic breach (Q5938626) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)
- Bargaining with limited computation: Deliberation equilibrium (Q5958637) (← links)
