arXiv subjects

Matan Pinkas

Publications and source records attributed to Matan Pinkas.

2 recordsLinked to original sources

arXiv2026

Bidding Games with Rewards: Taming Infinite Configuration Space

Bidding games are graph games in which a token is placed on a vertex, each player starts with an initial budget, and a simultaneous auction determines which player moves the token; the players' budgets are then updated accordingly. Motivated by scenarios such as resource-allocation systems in which agents receive periodic rewards (e.g., credits, energy) while competing for control, we introduce and study bidding games with rewards, in which, at each vertex, players may receive additional budget, incentivizing desired behaviors. We focus on reachability discrete poorman bidding games with rewards (DPBGr). The main challenge when compared to discrete bidding games without rewards is that the configuration graph is infinite. To this end we introduce a novel technique to eliminate plays with suboptimal infixes. This enables focusing on a finite part of the infinite configuration graph in order to solve the game via approximation to continuous bidding games with overall complexity in EXP. Finally, we discuss a new type of strategy, usable on a subclass of DPBGr, which guarantee a winning strategy for the reachability player. Membership in this subclass is shown to be in NP.

cs.GT↗

arXiv2023

Weight Diagrams of $gl(m|n)$ Modules

Many properties of simple finite dimensional gl(m|n)-modules may be better understood by assigning weight diagrams to the highest weights with respect to a given base of simple roots. In this paper we consider bases that are compatible with the standard Borel subalgebra in $gl(m|n)_0 = gl(m) \times gl(n)$; namely, the bases that differ from the distinguished base $\Sigma^{dist}$ of simple roots by a sequence of odd reflections. We examine the weight diagrams that arise from the highest weights of a simple module $L(\lambda)$ with respect to such bases. Further, we provide combinatorial tools to describe all the weight diagrams of highest weights of $L(\lambda)$ provided only with the the weight diagram of $L(\lambda)$ with respect to distinguished highest weight $\lambda$. Finally, we study the maximal cardinality of incomparable sets of positive odd roots with respect to $\Sigma^{dist}$ which are orthogonal to some highest weight of $L(\lambda)$ with respect to a base as above. We provide explicit formulas for this value, connecting it to the combinatorics of the weight diagrams. Based on this study, we respond to the work of M. Gorelik and Th. Heidersdorf, providing a counterexample to their Tail Conjecture.

math.RT↗