Publication

Welfare-Maximizing Correlated Equilibria with an Application to Wireless Communication

2011
Conference Papers

Abstract

The set of correlated equilibria is convex and contains all Nash equilibria as special cases. Thus, the social welfare-maximizing correlated equilibrium is amenable to convex analysis and offers social welfare that is at least as good as the game s best performing Nash equilibria.We employ robust semidefinite programming (SDP) for computing the social welfare-maximizing correlated equilibria in static polynomial games, giving rise to a dedicated sequential SDP algorithm, the first of this type that can cope with multivariate strategy sets. We apply this algorithm to a wireless communication problem, where two mutually-interfering transmitters and receivers maximize their channel capacities.

Official source

https://infoscience.epfl.ch/entities/publication/e3265efe-9e87-4966-a8bb-c7439a6e7333

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2011
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/e3265efe-9e87-4966-a8bb-c7439a6e7333

About this result

Related concepts (32)

Nash equilibrium

In game theory, the Nash equilibrium, named after the mathematician John Nash, is the most common way to define the solution of a non-cooperative game involving two or more players. In a Nash equilibrium, each player is assumed to know the equilibrium strategies of the other players, and no one has anything to gain by changing only one's own strategy. The principle of Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to competing firms choosing outputs.

Coordination game

A coordination game is a type of simultaneous game found in game theory. It describes the situation where a player will earn a higher payoff when they select the same course of action as another player. The game is not one of pure conflict, which results in multiple pure strategy Nash equilibria in which players choose matching strategies. Figure 1 shows a 2-player example.

Signaling game

In game theory, a signaling game is a simple type of a dynamic Bayesian game. The essence of a signalling game is that one player takes an action, the signal, to convey information to another player, where sending the signal is more costly if they are conveying false information. A manufacturer, for example, might provide a warranty for its product in order to signal to consumers that its product is unlikely to break down. The classic example is of a worker who acquires a college degree not because it increases their skill, but because it conveys their ability to employers.

Related publications (18)

Welfare-Maximizing Correlated Equilibria with an Application to Wireless Communication

Chat with Graph Search

Backscatter communication through disordered media enabled by a programmable leaky cavity

Time-Space Trade-Offs for Sumcheck

Link-Budgets with Body Implanted Nodes: Can we Obtain Simple Analytical Approximate Models That are Useful?