Congestion Games with Mixed Objectives

Alexander Skopalik; Lennart Leder; Matthias Feldotto

REVIEW

Congestion Games with Mixed Objectives

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1607.05143 v2 pith:IWQ626RA submitted 2016-07-18 cs.GT

Congestion Games with Mixed Objectives

Matthias Feldotto , Lennart Leder , Alexander Skopalik This is my paper

classification cs.GT

keywords gamescongestionequilibriamixednashobjectivespurealike

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.

Congestion Games with Mixed Objectives

discussion (0)