Matches in SemOpenAlex for { <https://semopenalex.org/work/W4298060701> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W4298060701 abstract "We study the optimization problem faced by a perfectly informed principal in a Bayesian game, who reveals information to the players about the state of nature to obtain a desirable equilibrium. This signaling problem is the natural design question motivated by uncertainty in games and has attracted much recent attention. We present new hardness results for signaling problems in (a) Bayesian two-player zero-sum games, and (b) Bayesian network routing games. For Bayesian zero-sum games, when the principal seeks to maximize the equilibrium utility of a player, we show that it is NP-hard to obtain an additive FPTAS. Our hardness proof exploits duality and the equivalence of separation and optimization in a novel way. Further, we rule out an additive PTAS assuming planted clique hardness, which states that no polynomial time algorithm can recover a planted clique from an ErdH{o}s-R'enyi random graph. Complementing these, we obtain a PTAS for a structured class of zero-sum games (where obtaining an FPTAS is still NP-hard) when the payoff matrices obey a Lipschitz condition. Previous results ruled out an FPTAS assuming planted-clique hardness, and a PTAS only for implicit games with quasi-polynomial-size strategy sets. For Bayesian network routing games, wherein the principal seeks to minimize the average latency of the Nash flow, we show that it is NP-hard to obtain a (multiplicative) $(4/3 - epsilon)$-approximation, even for linear latency functions. This is the optimal inapproximability result for linear latencies, since we show that full revelation achieves a $(4/3)$-approximation for linear latencies." @default.
- W4298060701 created "2022-10-01" @default.
- W4298060701 creator A5003054080 @default.
- W4298060701 creator A5011500179 @default.
- W4298060701 creator A5031968426 @default.
- W4298060701 creator A5047101336 @default.
- W4298060701 date "2015-12-11" @default.
- W4298060701 modified "2023-09-29" @default.
- W4298060701 title "Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games" @default.
- W4298060701 doi "https://doi.org/10.48550/arxiv.1512.03543" @default.
- W4298060701 hasPublicationYear "2015" @default.
- W4298060701 type Work @default.
- W4298060701 citedByCount "0" @default.
- W4298060701 crossrefType "posted-content" @default.
- W4298060701 hasAuthorship W4298060701A5003054080 @default.
- W4298060701 hasAuthorship W4298060701A5011500179 @default.
- W4298060701 hasAuthorship W4298060701A5031968426 @default.
- W4298060701 hasAuthorship W4298060701A5047101336 @default.
- W4298060701 hasBestOaLocation W42980607011 @default.
- W4298060701 hasConcept C105795698 @default.
- W4298060701 hasConcept C107673813 @default.
- W4298060701 hasConcept C114614502 @default.
- W4298060701 hasConcept C118615104 @default.
- W4298060701 hasConcept C126255220 @default.
- W4298060701 hasConcept C144237770 @default.
- W4298060701 hasConcept C177142836 @default.
- W4298060701 hasConcept C200594392 @default.
- W4298060701 hasConcept C202556891 @default.
- W4298060701 hasConcept C22171661 @default.
- W4298060701 hasConcept C311688 @default.
- W4298060701 hasConcept C33923547 @default.
- W4298060701 hasConcept C46814582 @default.
- W4298060701 hasConcept C99140742 @default.
- W4298060701 hasConceptScore W4298060701C105795698 @default.
- W4298060701 hasConceptScore W4298060701C107673813 @default.
- W4298060701 hasConceptScore W4298060701C114614502 @default.
- W4298060701 hasConceptScore W4298060701C118615104 @default.
- W4298060701 hasConceptScore W4298060701C126255220 @default.
- W4298060701 hasConceptScore W4298060701C144237770 @default.
- W4298060701 hasConceptScore W4298060701C177142836 @default.
- W4298060701 hasConceptScore W4298060701C200594392 @default.
- W4298060701 hasConceptScore W4298060701C202556891 @default.
- W4298060701 hasConceptScore W4298060701C22171661 @default.
- W4298060701 hasConceptScore W4298060701C311688 @default.
- W4298060701 hasConceptScore W4298060701C33923547 @default.
- W4298060701 hasConceptScore W4298060701C46814582 @default.
- W4298060701 hasConceptScore W4298060701C99140742 @default.
- W4298060701 hasLocation W42980607011 @default.
- W4298060701 hasOpenAccess W4298060701 @default.
- W4298060701 hasPrimaryLocation W42980607011 @default.
- W4298060701 hasRelatedWork W1592072815 @default.
- W4298060701 hasRelatedWork W2011350055 @default.
- W4298060701 hasRelatedWork W2121180068 @default.
- W4298060701 hasRelatedWork W2390503811 @default.
- W4298060701 hasRelatedWork W2762694154 @default.
- W4298060701 hasRelatedWork W289151131 @default.
- W4298060701 hasRelatedWork W3003205110 @default.
- W4298060701 hasRelatedWork W3124227386 @default.
- W4298060701 hasRelatedWork W3151653915 @default.
- W4298060701 hasRelatedWork W4213222909 @default.
- W4298060701 isParatext "false" @default.
- W4298060701 isRetracted "false" @default.
- W4298060701 workType "article" @default.