相关论文: A Complete Characterization of Convexity in Flow G…

We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the net flow at every node and a concave utility function for…

The connected configuration space of a so called cylindric billiard system is a flat torus minus finitely many spherical cylinders. The dynamical system describes the uniform motion of a point particle in this configuration space with…

A common assumption employed in most previous works on evolutionary game dynamics is that every individual player has full knowledge about and full access to the complete set of available strategies. In realistic social, economical, and…

We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…

Deciding that two network flows are essentially the same is an important problem in intrusion detection or in tracing anonymous connections. A stepping stone or an anonymity network may try to prevent flow correlation by delaying the…

In this paper, we consider finite-strategy approximations of infinite-strategy evolutionary games. We prove that such approximations converge to the true dynamics over finite-time intervals, under mild regularity conditions which are…

We consider the asymptotic behavior of solutions to an obstacle problem for the mean curvature flow equation by using a game-theoretic approximation, to which we extend that of Kohn and Serfaty (2006). Kohn and Serfaty (2006) give a…

Understanding the convergence landscape of multi-agent learning is a fundamental problem of great practical relevance in many applications of artificial intelligence and machine learning. While it is known that learning dynamics converge to…

We introduce a new model to study the oscillations of opposite flows sharing a common bottleneck and moving on two Totally Asymmetric Simple Exclusion Process (TASEP) lanes. We provide a theoretical analysis of the phase diagram, valid when…

We consider two-player games played on finite colored graphs where the goal is the construction of an infinite path with one of the following frequency-related properties: (i) all colors occur with the same asymptotic frequency, (ii) there…

The concept of flow is used extensively in HCI, video games, and many other fields, but its prevalent definition is conceptually vague and alternative interpretations have contributed to ambiguity in the literature. To address this, we use…

We investigate a routing game that allows for the creation of coalitions, within the framework of cooperative game theory. Specifically, we describe the cost of each coalition as its maximin value. This represents the performance that the…

In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…

Routing games are used to to understand the impact of individual users' decisions on network efficiency. Most prior work on routing games uses a simplified model of network flow where all flow exists simultaneously, and users care about…

Equilibrium notions for games with unawareness in the literature cannot be interpreted as steady-states of a learning process because players may discover novel actions during play. In this sense, many games with unawareness are…

We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with incomplete information. We extend this theory to "generalized…

The two key characteristics of a normalizing flow is that it is invertible (in particular, dimension preserving) and that it monitors the amount by which it changes the likelihood of data points as samples are propagated along the network.…

In most fluid dynamics problems, the governing equations are nonlinear because of the presence of convective terms. Nevertheless, existence of solutions can be shown by direct sum provided one identifies, in the relevant Banach space of…

To verify the robustness of a program or protocol, it is common in the computer science community to rely on the theoretical framework of game theory. In particular, if one seeks to enforce a desired property, or specification, despite an…

Under general assumptions on the velocity field, it is possible to construct a flow that is forward untangled. Once such a flow has been selected, the associated transport problem is well-posed.