Zobrazeno 1 - 10
of 3 268
pro vyhledávání: '"Sandholm, A"'
We present a novel AI-based ideation assistant and evaluate it in a user study with a group of innovators. The key contribution of our work is twofold: we propose a method of idea exploration in a constrained domain by means of LLM-supported semantic
Externí odkaz:
http://arxiv.org/abs/2411.03575
A celebrated connection in the interface of online learning and game theory establishes that players minimizing swap regret converge to correlated equilibria (CE) -- a seminal game-theoretic solution concept. Despite the long history of this problem
Externí odkaz:
http://arxiv.org/abs/2411.01721
A celebrated result in the interface of online learning and game theory guarantees that the repeated interaction of no-regret players leads to a coarse correlated equilibrium (CCE) -- a natural game-theoretic solution concept. Despite the rich histor
Externí odkaz:
http://arxiv.org/abs/2411.01720
Gradient-based algorithms have shown great promise in solving large (two-player) zero-sum games. However, their success has been mostly confined to the low-precision regime since the number of iterations grows polynomially in $1/\epsilon$, where $\ep
Externí odkaz:
http://arxiv.org/abs/2410.21636
We propose an architecture with accompanying protocol for on-board satellite data infrastructure designed for Low Earth Orbit (LEO) constellations offering communication services, such as direct-to-cell connectivity. Our design leverages the unused o
Externí odkaz:
http://arxiv.org/abs/2410.07586
Autor:
Pieroth, Fabian R., Sandholm, Tuomas
In practice, most auction mechanisms are not strategy-proof, so equilibrium analysis is required to predict bidding behavior. In many auctions, though, an exact equilibrium is not known and one would like to understand whether -- manually or computat
Externí odkaz:
http://arxiv.org/abs/2408.11445
Autor:
Martin, Carlos, Sandholm, Tuomas
We study the problem of computing an approximate Nash equilibrium of a game whose strategy space is continuous without access to gradients of the utility function. Such games arise, for example, when players' strategies are represented by the paramet
Externí odkaz:
http://arxiv.org/abs/2408.09306
We consider a model of learning and evolution in games whose action sets are endowed with a partition-based similarity structure intended to capture exogenous similarities between strategies. In this model, revising agents have a higher probability o
Externí odkaz:
http://arxiv.org/abs/2407.17815
Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search
Coalition formation is a key capability in multi-agent systems. An important problem in coalition formation is coalition structure generation: partitioning agents into coalitions to optimize the social welfare. This is a challenging problem that has
Externí odkaz:
http://arxiv.org/abs/2407.16092
Autor:
Tewolde, Emanuel, Zhang, Brian Hu, Oesterheld, Caspar, Zampetakis, Manolis, Sandholm, Tuomas, Goldberg, Paul W., Conitzer, Vincent
We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. An example is the absentminded driver game, as well as team games in which the members have limited communication capabilit
Externí odkaz:
http://arxiv.org/abs/2406.15970