相关论文: Agency Problems and Adversarial Bilevel Optimizati…

We introduce a method for approximating viscosity solutions of stationary degenerate elliptic Hamilton--Jacobi--Bellman equations on bounded domains arising in stochastic exit-time control. Viscosity enforcement is formulated as a min--max…

In this paper, we take up the analysis of a principal/agent model with moral hazard introduced in [17], with optimal contracting between competitive investors and an impatient bank monitoring a pool of long-term loans subject to Markovian…

Online platforms in the Internet Economy commonly incorporate recommender systems that recommend products (or "arms") to users (or "agents"). A key challenge in this domain arises from myopic agents who are naturally incentivized to exploit…

In this contribution, the properties of sub-stochastic matrix and super-stochastic matrix are applied to analyze the bipartite tracking issues of multi-agent systems (MASs) over signed networks, in which the edges with positive weight and…

This study investigates an optimal investment problem for an insurance company operating under the Cramer-Lundberg risk model, where investments are made in both a risky asset and a risk-free asset. In contrast to other literature that…

This work focuses on the problem of distributed optimization in multi-agent cyberphysical systems, where a legitimate agent's iterates are influenced both by the values it receives from potentially malicious neighboring agents, and by its…

Stochastic bilevel optimization tackles challenges involving nested optimization structures. Its fast-growing scale nowadays necessitates efficient distributed algorithms. In conventional distributed bilevel methods, each worker must…

Stochastic bilevel optimization finds widespread applications in machine learning, including meta-learning, hyperparameter optimization, and neural architecture search. To extend stochastic bilevel optimization to distributed data, several…

Designing hierarchical reinforcement learning algorithms that exhibit safe behaviour is not only vital for practical applications but also, facilitates a better understanding of an agent's decisions. We tackle this problem in the options…

Algorithmic contract design studies scenarios where a principal incentivizes an agent to exert effort on her behalf. In this work, we focus on settings where the agent's type is drawn from an unknown distribution, and formalize an offline…

In a framework close to the one developed by Holmstr\"om and Milgrom [44], we study the optimal contracting scheme between a Principal and several Agents. Each hired Agent is in charge of one project, and can make efforts towards managing…

In this paper we study the fully nonlinear stochastic Hamilton-Jacobi-Bellman (HJB) equation for the optimal stochastic control problem of stochastic differential equations with random coefficients. The notion of viscosity solution is…

The optimal control for mobile agents is an important and challenging issue. Recent work shows that using randomized mechanism in agents' control can make the state unpredictable, and thus improve the security of agents. However, the…

This paper is concerned with the convergence rate of policy iteration for (deterministic) optimal control problems in continuous time. To overcome the problem of ill-posedness due to lack of regularity, we consider a semi-discrete scheme by…

Transmit optimization and resource allocation for wireless cooperative networks with channel state information (CSI) uncertainty are important but challenging problems in terms of both the uncertainty modeling and performance op-…

This paper is concerned with a three-level multi-leader-follower incentive Stackelberg game with $H_\infty$ constraint. Based on $H_2/H_\infty$ control theory, we firstly obtain the worst-case disturbance and the team-optimal strategy by…

We consider a moral hazard problem with multiple principals in a continuous-time model. The agent can only work exclusively for one principal at a given time, so faces an optimal switching problem. Using a randomized formulation, we manage…

This paper studies the unconstrained nonconvex-strongly-convex bilevel optimization problem. A common approach to solving this problem is to alternately update the upper-level and lower-level variables using (biased) stochastic gradients or…

We consider stochastic optimization problems in multi-agent settings, where a network of agents aims to learn parameters which are optimal in terms of a global objective, while giving preference to locally observed streaming information. To…

Many scenarios where agents with restrictions compete for resources can be cast as maximum matching problems on bipartite graphs. Our focus is on resource allocation problems where agents may have restrictions that make them incompatible…