57,812 research outputs found

    Designing cost-sharing methods for Bayesian games

    Get PDF
    We study the design of cost-sharing protocols for two fundamental resource allocation problems, the Set Cover and the Steiner Tree Problem, under environments of incomplete information (Bayesian model). Our objective is to design protocols where the worst-case Bayesian Nash equilibria, have low cost, i.e. the Bayesian Price of Anarchy (PoA) is minimized. Although budget balance is a very natural requirement, it puts considerable restrictions on the design space, resulting in high PoA. We propose an alternative, relaxed requirement called budget balance in the equilibrium (BBiE).We show an interesting connection between algorithms for Oblivious Stochastic optimization problems and cost-sharing design with low PoA. We exploit this connection for both problems and we enforce approximate solutions of the stochastic problem, as Bayesian Nash equilibria, with the same guarantees on the PoA. More interestingly, we show how to obtain the same bounds on the PoA, by using anonymous posted prices which are desirable because they are easy to implement and, as we show, induce dominant strategies for the players

    Price of Anarchy in Bernoulli Congestion Games with Affine Costs

    Full text link
    We consider an atomic congestion game in which each player participates in the game with an exogenous and known probability pi∈[0,1]p_{i}\in[0,1], independently of everybody else, or stays out and incurs no cost. We first prove that the resulting game is potential. Then, we compute the parameterized price of anarchy to characterize the impact of demand uncertainty on the efficiency of selfish behavior. It turns out that the price of anarchy as a function of the maximum participation probability p=max⁥ipip=\max_{i} p_{i} is a nondecreasing function. The worst case is attained when players have the same participation probabilities pi≡pp_{i}\equiv p. For the case of affine costs, we provide an analytic expression for the parameterized price of anarchy as a function of pp. This function is continuous on (0,1](0,1], is equal to 4/34/3 for 0<p≀1/40<p\leq 1/4, and increases towards 5/25/2 when p→1p\to 1. Our work can be interpreted as providing a continuous transition between the price of anarchy of nonatomic and atomic games, which are the extremes of the price of anarchy function we characterize. We show that these bounds are tight and are attained on routing games -- as opposed to general congestion games -- with purely linear costs (i.e., with no constant terms).Comment: 29 pages, 6 figure

    Strategic substitutabilities versus strategic complementarities: Towards a general theory of expectational coordination?

    Get PDF
    This paper contrasts the views of expectational coordination in a stylised economic model under two polar assumptions: Strategic Complementarities (StCo) dominate or on the contrary are dominated by Strategic Substitutabilities (StSu). Although in the StCo case, "uniqueness" often "buys" "eductive stability", the two issues are strikingly different in the second case. Furthermore if, in the first case, incomplete information often improves "expectational coordination", it may have the converse effect in the StSu case. It is finally argued that, in macroeconomic contexts, StSu often unambiguously dominate StCo, even in a large class of models with Keynesian features, and even in an aggregate framework that magnifies the StCo effects. The "remains" of StCo in general cases are discussed.Strategic Complementarities (StCo) ; Strategic Substitutabilities (StSu)

    Ex-post regret learning in games with fixed and random matching: The case of private values

    Get PDF
    In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are randomly matched to play the game (random matching). The relevant long run predictions are minimal sets that are closed under “the same or better reply” operations. Under additional assumptions in each case, the prediction boils down to pure Nash equilibria, pure ex-post equilibria or pure minimax regret equilibria. These three paradigms exhibit nice robustness properties in the sense that they are independent of beliefs about the exogenous uncertainty of type spaces. The results are illustrated in second-price auctions, first-price auctions and Bertrand duopolies.fixed and random matching; incomplete information; ex-post regret learning; nash equilibrium; ex-post equilibrium; minimax regret equilibrium; second-price auction;first-price auction;bertrand duopoly

    Ex-Post Regret Learning in Games with Fixed and Random Matching: The Case of Private Values

    Get PDF
    In contexts in which players have no priors, we analyze a learning pro- cess based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are ran- domly matched to play the game (random matching). The relevant long run predictions are minimal sets that are closed under “the same or better reply” operations. Under additional assumptions in each case, the prediction boils down to pure Nash equilibria, pure ex-post equilibria or pure minimax regret equilibria. These three paradigms exhibit nice robustness properties in the sense that they are independent of beliefs about the exogenous uncertainty of type spaces. The results are illustrated in second-price auctions, first-price auctions and Bertrand duopolies.Fixed and Random Matching; Incomplete Information; Ex-Post Regret Learning; Nash Equilibrium; Ex-Post Equilibrium; Minimax Regret

    Core-stable rings in auctions with independent private values.

    Get PDF
    We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative) partition form game. A coalition is core-stable if the core of a suitable characteristic function, derived from the partition form game, is not empty. As an application, we study collusion in auctions in which the bidders' final utility possibly depends on the winner's identity. We show that such direct externalities offer a possible explanation for cartels'structures (not) observed in practice.Core; partition function game; Collusion; Auctions; Bayesian game;

    Core-stable Rings in Auctions with Independent Private Values

    Get PDF
    We propose a semi-cooperative game theoretic approach to check whether a given coalition is stable in a Bayesian game with independent private values. The ex ante expected utilities of coalitions, at an incentive compatible (noncooperative) coalitional equilibrium, describe a (cooperative) partition form game. A coalition is core-stable if the core of a suitable characteristic function, derived from the partition form game, is not empty. As an application, we study collusion in auctions in which the bidders’ final utility possibly depends on the winner’s identity. We show that such direct externalities offer a possible explanation for cartels’ structures (not) observed in practice.auctions, Bayesian game, collusion, core, partition function game

    On the Efficiency of the Walrasian Mechanism

    Full text link
    Central results in economics guarantee the existence of efficient equilibria for various classes of markets. An underlying assumption in early work is that agents are price-takers, i.e., agents honestly report their true demand in response to prices. A line of research in economics, initiated by Hurwicz (1972), is devoted to understanding how such markets perform when agents are strategic about their demands. This is captured by the \emph{Walrasian Mechanism} that proceeds by collecting reported demands, finding clearing prices in the \emph{reported} market via an ascending price t\^{a}tonnement procedure, and returns the resulting allocation. Similar mechanisms are used, for example, in the daily opening of the New York Stock Exchange and the call market for copper and gold in London. In practice, it is commonly observed that agents in such markets reduce their demand leading to behaviors resembling bargaining and to inefficient outcomes. We ask how inefficient the equilibria can be. Our main result is that the welfare of every pure Nash equilibrium of the Walrasian mechanism is at least one quarter of the optimal welfare, when players have gross substitute valuations and do not overbid. Previous analysis of the Walrasian mechanism have resorted to large market assumptions to show convergence to efficiency in the limit. Our result shows that approximate efficiency is guaranteed regardless of the size of the market

    Evolutionary Poisson Games for Controlling Large Population Behaviors

    Full text link
    Emerging applications in engineering such as crowd-sourcing and (mis)information propagation involve a large population of heterogeneous users or agents in a complex network who strategically make dynamic decisions. In this work, we establish an evolutionary Poisson game framework to capture the random, dynamic and heterogeneous interactions of agents in a holistic fashion, and design mechanisms to control their behaviors to achieve a system-wide objective. We use the antivirus protection challenge in cyber security to motivate the framework, where each user in the network can choose whether or not to adopt the software. We introduce the notion of evolutionary Poisson stable equilibrium for the game, and show its existence and uniqueness. Online algorithms are developed using the techniques of stochastic approximation coupled with the population dynamics, and they are shown to converge to the optimal solution of the controller problem. Numerical examples are used to illustrate and corroborate our results
    • 

    corecore