Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Most algorithmic matches in fielded kidney exchanges do not result in an actual transplant. In this paper, we address the problem of cycles and chains in a proposed match failing after the matching algorithm has committed to them. We show that failure-...
We study the problem of computing a Nash equilibrium in large-scale two-player zero-sum extensive-form games. While this problem can be solved in polynomial time, first-order or regret-based methods are usually preferred for large games. Regret-based ...
The leading approach for computing strong game-theoretic strategies in large imperfect-information games is to first solve an abstracted version of the game offline, then perform a table lookup during game play. We consider a modification to this ...
The leading approach for solving large imperfect-information games is automated abstraction followed by running an equilibrium-finding algorithm. We introduce a distributed version of the most commonly used equilibrium-finding algorithm, counterfactual ...
We consider the problem of playing a repeated two-player zero-sum game safety: that is, guaranteeing at least the value of the game per period in expectation regardless of the strategy used by the opponent. Playing a stage-game equilibrium strategy at ...
The openness of wireless communication and the recent development of software-defined radio technology, respectively, provide a low barrier and a wide range of capabilities for misbehavior, attacks, and defenses against attacks. In this work we present ...
Abstraction has emerged as a key component in solving extensive-form games of incomplete information. However, lossless abstractions are typically too large to solve, so lossy abstraction is needed. All prior lossy abstraction algorithms for extensive-...
A descending (multi-item) clock auction (DCA) is a mechanism for buying items from multiple potential sellers. In the DCA, bidder-specific prices are decremented over the course of the auction. In each round, each bidder might accept or decline his ...
Pareto efficiency is a widely used property in solution concepts for cooperative and non--cooperative game--theoretic settings and, more generally, in multi--objective problems. However, finding or even approximating (when the objective functions are ...
Kidney exchange provides a life-saving alternative to long waiting lists for patients in need of a new kidney. Fielded exchanges typically match under utilitarian or near-utilitarian rules; this approach marginalizes certain classes of patients. In this ...
Most algorithmic matches in fielded kidney exchanges do not result in an actual transplant. In this paper, we address the problem of cycles and chains in a proposed match failing after the matching algorithm has committed to them. We show that failure-...
Computing equilibria of games is a central task in computer science. A large number of results are known for Nash equilibrium (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form coalitions, NE is ...
There has been significant recent interest in computing effective strategies for playing large imperfect-information games. Much prior work involves computing an approximate equilibrium strategy in a smaller abstract game, then playing this strategy in ...
Revenue maximization in multi-item settings is notoriously elusive. This paper studies a class of two-item auctions which we call a mixed-bundling auction with reserve prices (MBARP). It calls VCG on an enlarged set of agents by adding the seller---who ...
Kidney exchange, where needy patients swap incompatible donors with each other, offers a lifesaving alternative to waiting for an organ from the deceased-donor waiting list. Recently, chains---sequences of transplants initiated by an altruistic kidney ...
Abstraction followed by equilibrium finding has emerged as the leading approach to solving games. Lossless abstraction typically yields games that are still too large to solve, so lossy abstraction is needed. Unfortunately, prior lossy game abstraction ...
We consider the problem of playing a finitely-repeated two-player zero-sum game safely---that is, guaranteeing at least the value of the game per period in expectation regardless of the strategy used by the opponent. Playing a stage-game equilibrium ...
There has been significant recent interest in computing good strategies for large games. Most prior work involves computing an approximate equilibrium strategy in a smaller abstract game, then playing this strategy in the full game. In this paper, we ...
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent's action frequencies and building an opponent model by combining information from a precomputed equilibrium strategy ...
Although combinatorial auctions have received a great deal of attention from the computer science community over the past decade, research in this domain has focussed on settings in which a bidder only has preferences over the bundles of goods they ...