Zobrazeno 1 - 10
of 600
pro vyhledávání: '"Vazirani P"'
The `quantum gravity in the lab' paradigm suggests that quantum computers might shed light on quantum gravity by simulating the CFT side of the AdS/CFT correspondence and mapping the results to the AdS side. This relies on the assumption that the dua
Externí odkaz:
http://arxiv.org/abs/2411.04978
The equivalence between von Neumann's Minimax Theorem for zero-sum games and the LP Duality Theorem connects cornerstone problems of the two fields of game theory and optimization, respectively, and has been the subject of intense scrutiny for seven
Externí odkaz:
http://arxiv.org/abs/2410.10767
We analyze the $G$-skein theory invariants of the 3-torus $T^3$ and the two-torus $T^2$, for the groups $G = GL_N, SL_N$ and for generic quantum parameter. We obtain formulas for the dimension of the skein module of $T^3$, and we describe the algebra
Externí odkaz:
http://arxiv.org/abs/2409.05613
The stable and fair division of profits/costs is a central concern in economics. The core, which ensures stability, has long been the gold standard for profit/cost sharing in cooperative games. Shapley and Shubik([SS71])'s classic work on the assignm
Externí odkaz:
http://arxiv.org/abs/2403.06037
Autor:
Vazirani, Vijay V.
The classic paper of Shapley and Shubik \cite{Shapley1971assignment} characterized the core of the assignment game. We observe that a sub-coalition consisting of one player (or a set of players from the same side of the bipartition) can make zero pro
Externí odkaz:
http://arxiv.org/abs/2402.11437
Autor:
Tröbst, Thorben, Vazirani, Vijay V.
Unlike ordinal-utility matching markets, which are well-developed from the viewpoint of both theory and practice, recent insights from a computer science perspective have left cardinal-utility matching markets in a state of flux. The celebrated prici
Externí odkaz:
http://arxiv.org/abs/2402.08851
Autor:
Bouland, Adam, Fefferman, Bill, Ghosh, Soumik, Metger, Tony, Vazirani, Umesh, Zhang, Chenyi, Zhou, Zixin
Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is only trying to decide if the ground state is volume-law vs near area-l
Externí odkaz:
http://arxiv.org/abs/2311.12017
Autor:
Tröbst, Thorben, Vazirani, Vijay V
The Hylland-Zeckhauser gave a classic pricing-based mechanism (HZ) for a one-sided matching market; it yields allocations satisfying Pareto optimality and envy-freeness (Hylland and Zeckhauser, 1979), and the mechanism is incentive compatible in the
Externí odkaz:
http://arxiv.org/abs/2310.16807
We develop a $\mathtt{q}$-analogue of the theory of conjugation equivariant $\mathcal D$-modules on a complex reductive group $G$. In particular, we define quantum Hotta-Kashiwara modules and compute their endomorphism algebras. We use the Schur-Weyl
Externí odkaz:
http://arxiv.org/abs/2309.03117
[MV18] introduced a fundamental new algorithmic question on stable matching, namely finding a matching that is stable under two ``nearby'' instances, where ``nearby'' meant that in going from instance $A$ to $B$, only one agent changes its preference
Externí odkaz:
http://arxiv.org/abs/2304.02590