Search Results - "Sandholm, Tuomas"

Superhuman AI for heads-up no-limit poker: Libratus beats top professionals by Brown, Noam, Sandholm, Tuomas

“…No-limit Texas hold'em is the most popular form of poker. Despite AI successes in perfect-information games, the private information and massive game tree have…”
Get full text

Superhuman AI for multiplayer poker by Brown, Noam, Sandholm, Tuomas

“…In recent years there have been great strides in artificial intelligence (AI), with games often serving as challenge problems, benchmarks, and milestones for…”
Get full text

Automated Design of Revenue-Maximizing Combinatorial Auctions by Sandholm, Tuomas, Likhodedov, Anton

“…Designing optimal—that is, revenue-maximizing—combinatorial auctions (CAs) is an important elusive problem. It is unsolved even for two bidders and two items…”
Get full text

Algorithm for optimal winner determination in combinatorial auctions by Sandholm, Tuomas

“…Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction…”
Get full text

Faster algorithms for extensive-form game solving via improved smoothing functions by Kroer, Christian, Waugh, Kevin, Kılınç-Karzan, Fatma, Sandholm, Tuomas

“…Sparse iterative methods, in particular first-order methods, are known to be among the most effective in solving large-scale two-player zero-sum extensive-form…”
Get full text

New complexity results about Nash equilibria by Conitzer, Vincent, Sandholm, Tuomas

“…We provide a single reduction that demonstrates that in normal-form games: (1) it is NP -complete to determine whether Nash equilibria with certain natural…”
Get full text

Combination treatment optimization using a pan-cancer pathway model by Schmucker, Robin, Farina, Gabriele, Faeder, James, Fröhlich, Fabian, Saglam, Ali Sinan, Sandholm, Tuomas

“…The design of efficient combination therapies is a difficult key challenge in the treatment of complex diseases such as cancers. The large heterogeneity of…”
Get full text

Complexity of constructing solutions in the core based on synergies among coalitions by Conitzer, Vincent, Sandholm, Tuomas

“…Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can…”
Get full text

CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions by Sandholm, Tuomas, Suri, Subhash, Gilpin, Andrew, Levine, David

“…Combinatorial auctions where bidders can bid on bundles of items can lead to more economically efficient allocations, but determining the winners is -complete…”
Get full text

eMediator: A Next Generation Electronic Commerce Server by Sandholm, Tuomas

“…This paper presents eMediator, an electronic commerce server prototype that demonstrates ways in which algorithmic support and game–theoretic incentive…”
Get full text

Solving imperfect-information games by Sandholm, Tuomas

“…The smallest common poker game, two-player limit Texas Hold'em, is essentially solved [Also see Research Article by Bowling et al. ] Imperfect-information…”
Get full text

Leveled Commitment Contracts and Strategic Breach by Sandholm, Tuomas W., Lesser, Victor R.

“…In (automated) negotiation systems for self-interested agents, contracts have traditionally been binding. They do not accommodate future events. Contingency…”
Get full text

AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents by Conitzer, Vincent, Sandholm, Tuomas

“…Issue Title: Special Issue on Learning & Computational Game Theory Two minimal requirements for a satisfactory multiagent learning algorithm are that it 1…”
Get full text

Solving imperfect-information games: The smallest common poker game, two-player limit Texas Hold'em, is essentially solved by Sandholm, Tuomas

Get full text

Efficiency and budget balance in general quasi-linear domains by Nath, Swaprava, Sandholm, Tuomas

“…We consider efficiency and budget balance in general quasi-linear domains. Green and Laffont (1979) proved that one cannot generically achieve both. We…”
Get full text

Failure-Aware Kidney Exchange by Dickerson, John P, Procaccia, Ariel D, Sandholm, Tuomas

“…Algorithmic matches in fielded kidney exchanges do not typically result in an actual transplant. We address the problem of cycles and chains in proposed…”
Get full text

Perspectives on multiagent learning by Sandholm, Tuomas

“…I lay out a slight refinement of Shoham et al.'s taxonomy of agendas that I consider sensible for multiagent learning (MAL) research. It is not intended to be…”
Get full text

Smoothing Techniques for Computing Nash Equilibria of Sequential Games by Hoda, Samid, Gilpin, Andrew, Peña, Javier, Sandholm, Tuomas

“…We develop first-order smoothing techniques for saddle-point problems that arise in finding a Nash equilibrium of sequential games. The crux of our work is a…”
Get full text

Using machine learning to improve survival prediction after heart transplantation by Ayers, Brian, Sandholm, Tuomas, Gosev, Igor, Prasad, Sunil, Kilic, Arman

“…Background This study investigates the use of modern machine learning (ML) techniques to improve prediction of survival after orthotopic heart transplantation…”
Get full text

First-order algorithm with O ( rm ln ( 1 / epsilon ) ) convergence for epsilon -equilibrium in two-person zero-sum games by Gilpin, Andrew, Pena, Javier, Sandholm, Tuomas

“…We propose an iterated version of Nesterov's first-order smoothing method for the two-person zero-sum game equilibrium problem min x [isin] Q 1 max y [isin] Q…”
Get full text