English
Related papers

Related papers: Stochastic Games on a Multiple Access Channel

200 papers

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

We study the problem of resilient strategies in the presence of uncertainty. Resilient strategies enable an agent to make decisions that are robust against disturbances. In particular, we are interested in those disturbances that are able…

Computer Science and Game Theory · Computer Science 2026-03-02 Kush Grover , Markel Zubia , Debraj Chakraborty , Muqsit Azeem , Nils Jansen , Jan Kretinsky

The interference channel is the simplest communication scenario where multiple autonomous users compete for shared resources. We combine game theory and information theory to define a notion of a Nash equilibrium region of the interference…

Information Theory · Computer Science 2010-07-14 Randall A. Berry , David N. C. Tse

We study a two-sided network investment game consisting of two sets of players, called providers and users. The game is set in two stages. In the first stage, providers aim to maximize their profit by investing in bandwidth of cloud…

Computer Science and Game Theory · Computer Science 2019-04-24 Daniel Schmand , Marc Schröder , Alexander Skopalik

This paper considers the minimization of transmit power in Gaussian parallel interference channels, subject to a rate constraint for each user. To derive decentralized solutions that do not require any cooperation among the users, we…

Information Theory · Computer Science 2011-11-09 Jong-Shi Pang , Gesualdo Scutari , Francisco Facchinei , Chaoxiong Wang

Recently coded caching has emerged as a promising means to handle continuously increasing wireless traffic. However, coded caching requires users to cooperate in order to minimize the overall transmission rate. How users with heterogeneous…

Information Theory · Computer Science 2019-12-02 Yawei Lu , Wei Chen , H. Vincent Poor

We consider a utility maximization problem over partially observable Markov ON/OFF channels. In this network instantaneous channel states are never known, and at most one user is selected for service in every slot according to the partial…

Optimization and Control · Mathematics 2010-08-23 Chih-ping Li , Michael J. Neely

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…

Computer Science and Game Theory · Computer Science 2015-03-17 Umang Bhaskar , Lisa Fleischer , Elliot Anshelevich

In a noncooperative dynamic game, multiple agents operating in a changing environment aim to optimize their utilities over an infinite time horizon. Time-varying environments allow to model more realistic scenarios (e.g., mobile devices…

Systems and Control · Computer Science 2015-12-29 Santiago Zazo , Sergio Valcarcel Macua , Matilde Sánchez-Fernández , Javier Zazo

A wireless system with multiple channels is considered, where each channel has several transmission states. A user learns about the instantaneous state of an available channel by transmitting a control packet in it. Since probing all…

Data Structures and Algorithms · Computer Science 2008-04-11 Sudipto Guha , Kamesh Munagala , Saswati Sarkar

Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph…

Logic in Computer Science · Computer Science 2016-04-22 Krishnendu Chatterjee , Laurent Doyen

We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When all users are non-adversarial, we want their messages to be…

Information Theory · Computer Science 2023-09-12 Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

A game-theoretic model is proposed to study the cross-layer problem of joint power and rate control with quality of service (QoS) constraints in multiple-access networks. In the proposed game, each user seeks to choose its transmit power…

Information Theory · Computer Science 2007-07-16 Farhad Meshkati , H. Vincent Poor , Stuart C. Schwartz , Radu V. Balan

This paper investigates the Nash equilibrium seeking problems for networked games with intermittent communication, where each player is capable of communicating with other players intermittently over a strongly connected and directed graph.…

Optimization and Control · Mathematics 2023-10-05 Ying Zhai , Rui Yuan , Huan Su

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

Computer Science and Game Theory · Computer Science 2012-01-04 Krishnendu Chatterjee

We introduce a deterministic analogue of Markov chains that we call the hunger game. Like rotor-routing, the hunger game deterministically mimics the behavior of both recurrent Markov chains and absorbing Markov chains. In the case of…

Probability · Mathematics 2025-07-29 Rupert Li , James Propp

In this paper we study opportunistic spectrum access (OSA) policies in a multiuser multichannel random access cognitive radio network, where users perform channel probing and switching in order to obtain better channel condition or higher…

Systems and Control · Computer Science 2013-09-17 Yang Liu , Mingyan Liu

We focus on the downlink of a cellular system, which corresponds to the bulk of the data transfer in such wireless systems. We address the problem of opportunistic multiuser scheduling under imperfect channel state information, by…

Information Theory · Computer Science 2016-11-15 Sugumar Murugesan , Philip Schniter , Ness B. Shroff

We consider a non-atomic congestion game where each decision maker performs selfish optimization over states of a common MDP. The decision makers optimize for their own expected costs, and influence each other through congestion effects on…

Computer Science and Game Theory · Computer Science 2021-12-14 Sarah H. Q. Li , Daniel Calderone , Lillian Ratliff , Behcet Acikmese

Consider the following multi-phase project management problem. Each project is divided into several phases. All projects enter the next phase at the same point chosen by the decision maker based on observations up to that point. Within each…

Statistics Theory · Mathematics 2007-06-13 Hock Peng Chan , Cheng-Der Fuh , Inchi Hu
‹ Prev 1 8 9 10 Next ›