相关论文: The Stackelberg Kidney Exchange Problem is $\Sigma…
We study a simple exchange market, introduced by Gourv\'{e}s, Lesca and Wilczynski (IJCAI-17), where every agent initially holds a single object. The agents have preferences over the objects, and two agents may swap their objects if they…
The Coin Change problem, also known as the Change-Making problem, is a well-studied combinatorial optimization problem, which involves minimizing the number of coins needed to make a specific change amount using a given set of coin…
We show that a suitable ring with a ``nice'' topology, in which convergent limits of units are units, is an \aleph_0-exchange ring. We generalize the argument to show that a semi-regular ring, R, with a ``nice'' topology, is a full exchange…
We study the problem of finding Stackelberg equilibria in games with a massive number of players. So far, the only known game instances in which the problem is solved in polynomial time are some particular congestion games. However, a…
Despite efforts to increase the supply of organs from living donors, most kidney transplants performed in Australia still come from deceased donors. The age of these donated organs has increased substantially in recent decades as the rate…
This article considers a problem arising from a two-player game based on the classical secretary problem. First, Player 1 selects one object from a sequence as in the secretary problem. All of the other objects are then presented to Player…
Interactions among selfish users sharing a common transmission channel can be modeled as a non-cooperative game using the game theory framework. When selfish users choose their transmission probabilities independently without any…
Stackelberg games are a classic example of bilevel optimization problems, which are often encountered in game theory and economics. These are complex problems with a hierarchical structure, where one optimization task is nested within the…
We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of…
Bilevel programming problems are often found in practice. In this paper, we handle one such bilevel application problem from the domain of environmental economics. The problem is a Stakelberg game with multiple objectives at the upper…
The exchange operator formalism in polar coordinates, previously considered for the Calogero-Marchioro-Wolfes problem, is generalized to a recently introduced, infinite family of exactly solvable and integrable Hamiltonians $H_k$, $k=1$, 2,…
Decentralized control of cooperative systems captures the operation of a group of decision makers that share a single global objective. The difficulty in solving optimally such problems arises when the agents lack full observability of the…
The paper considers the problem of finding a submatrix $X_{\mathcal{S}} \in \mathbb{R}^{m \times k}$ in a matrix $X \in \mathbb{R}^{m \times n}$, such that the spectral or Frobenius norm of $X_{\mathcal{S}}^{\dag} X$ is limited, which…
Cardinality Maximum Flow Network Interdiction Problem (CMFNIP) is known to be strongly NP-hard problem in the literature. A particular case of CMFNIP has been shown to have reduction from clique problem. In the present work,an effort is…
In this paper, we study the Hospitals / Residents problem with Couples (HRC), where a solution is a stable matching or a report that none exists. We present a novel polynomial-time algorithm that can find a near-feasible stable matching…
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph $G$ and an integer $k$, ask whether $G$ has two (maximum/perfect) matchings whose symmetric difference is at least $k$. Diverse Pair of…
We investigate a market without money in which agents can offer certain goods (or multiple copies of an agent-specific good) in exchange for goods of other agents. The exchange must be balanced in the sense that each agent should receive a…
Ichikawa et al. [Phys. Rev. A 78, 052105 (2008)] showed that exchange symmetry gives rise to simple characterization of whether multipartite pure quantum states being either globally entangled or fully separable. In this Brief Report, we…
Consider the following puzzle: a farmland consists of several fields, each occupied by either a farmer, a fox, a chicken, or a caterpillar. Creatures in neighboring fields can swap positions as long as the fox avoids the farmer, the chicken…
We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an algorithm for the Traveling Salesperson Problem that solves $N$-vertex instances using space $S$ and time…