NDLI: Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation

Please wait, while we are loading the content...

Fair Algorithms for Machine Learning

Dominant-Strategy versus Bayesian Multi-item Auctions: Maximum Revenue Determination and Comparison

The Double Clinching Auction for Wagering

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm

A "Quantal Regret" Method for Structural Econometrics in Repeated Games

The Scope of Sequential Screening with Ex Post Participation Constraints

Accounting for Strategic Response in an Agent-Based Model of Financial Regulation

Stable Secretaries

Making Right Decisions Based on Wrong Opinions

A Simple and Approximately Optimal Mechanism for a Buyer with Complements: Abstract

Optimal Signaling Mechanisms in Unobservable Queues with Strategic Customers

Combinatorial Cost Sharing

Makespan Minimization via Posted Prices

Convex Program Duality, Fisher Markets, and Nash Social Welfare

Online Auctions and Multi-scale Online Learning

The Tragedy of your Upstairs Neighbors: Is the Negative Externality of Airbnb Internalized?

Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness

Planning with Multiple Biases

Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms

Nash Social Welfare Approximation for Strategic Agents

Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks

Stability, Strategy-Proofness, and Cumulative Offer Mechanisms

Simple Approximate Equilibria in Games with Many Players

Deferred-Acceptance Auctions for Multiple Levels of Service

Forecast Aggregation

Facilitating the Search for Partners on Matching Platforms: Restricting Agent Actions

The Theory is Predictive, but is it Complete?: An Application to Human Perception of Randomness

Dynamic Mechanisms with Martingale Utilities

Empirical Mechanism Design for Optimizing Clearing Interval in Frequent Call Markets

Computing Equilibrium in Matching Markets

Voting in the Limelight

Price Doubling and Item Halving: Robust Revenue Guarantees for Item Pricing

Information Sharing and Privacy in Networks

Truth and Regret in Online Scheduling

Controlled Dynamic Fair Division

Joint Pricing and Inventory Management with Strategic Customers

Interacting User Generated Content Technologies: How Q&As Affect Ratings & Reviews

From Monetary to Non-Monetary Mechanism Design via Artificial Currencies

Multidimensional Binary Search for Contextual Decision-Making

Approximately Efficient Two-Sided Combinatorial Auctions

Fair Public Decision Making

Stable Matching with Proportionality Constraints

Theoretical and Practical Advances on Smoothing for Extensive-Form Games

The Optimal Mechanism for Selling to a Budget Constrained Buyer: The General Case

Machine-Learning Aided Peer Prediction

Matching while Learning

Comparison-based Choices

Repeated Sales with Multiple Strategic Buyers

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation

Communication Requirements and Informative Signaling in Matching Markets

Metric Distortion of Social Choice Rules: Lower Bounds and Fairness Properties

The Competition Complexity of Auctions: A Bulow-Klemperer Result for Multi-Dimensional Bidders

Algorithmic Persuasion with No Externalities

Cost-Sharing Methods for Scheduling Games under Uncertainty

A Lower Bound for Equitable Cake Cutting

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework

Learning in the Repeated Secretary Problem

Gibbard-Satterthwaite Success Stories and Obvious Strategyproofness

Bifurcation Mechanism Design - from Optimal Flat Taxes to Improved Cancer Treatments

Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium

Approximation Algorithms for Maximin Fair Division

Making it Safe to Use Centralized Markets: Epsilon - Dominant Individual Rationality and Applications to Market Design

A Network Game of Dynamic Traffic

Optimal Multi-Unit Mechanisms with Private Demands

Peer Prediction with Heterogeneous Users

Redesigning the Israeli Psychology Master's Match

Combinatorial Auctions Do Need Modest Interaction

Posted Price Mechanisms for a Random Stream of Customers

Surge Pricing Solves the Wild Goose Chase

Complementary Inputs and the Existence of Stable Outcomes in Large Trading Networks

Of the People: Voting Is More Effective with Representative Candidates

Assortment Optimisation under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments

Fairness Incentives for Myopic Agents

Multidimensional Dynamic Pricing for Welfare Maximization

Diffusion in Networks and the Unexpected Virtue of Burstiness

How (Not) to Allocate Affordable Housing

A Polynomial Time Algorithm for Spatio-Temporal Security Games

Potential Function Minimizers of Combinatorial Congestion Games: Efficiency and Computation

Content Provider	ACM Digital Library
Author	Kleer, Pieter Schäfer, Guido
Abstract	We study the inefficiency and computation of pure Nash equilibria in unweighted congestion games, where the strategies of each player i are given implicitly by the binary vectors of a polytope \$P_i\$. Given these polytopes, a strategy profile naturally corresponds to an integral vector in the aggregation polytope $P_{N}$ = $∑_{i}$ $P_{i}.$ We identify two general properties of the aggregation polytope \$P_N\$ that are sufficient for our results to go through, namely the integer decomposition property (IDP) and the box-totally dual integrality property (box-TDI). Intuitively, the IDP is needed to decompose a load profile in $P_{N}$ into a respective strategy profile of the players, and box-TDI ensures that the intersection of a polytope with an arbitrary integer box is an integral polytope. Examples of polytopal congestion games which satisfy IDP and box-TDI include common source network congestion games, symmetric totally unimodular congestion games, non-symmetric matroid congestion games and symmetric matroid intersection congestion games (in particular, r-arborescences and strongly base-orderable matroids). Our main contributions for polytopal congestion games satisfying IDP and box-TDI are as follows: We derive tight bounds on the price of stability for these games. This extends a result of Fotakis (2010) on the price of stability for symmetric network congestion games to the larger class of polytopal congestion games. Our bounds improve upon the ones for general polynomial congestion games obtained by Christodoulou and Gairing (2016). We show that pure Nash equilibria can be computed in strongly polynomial time for these games. To this aim, we generalize a recent aggregation/decomposition framework by Del Pia et al. (2017) for symmetric totally unimodular and non-symmetric matroid congestion games, both being a special case of our polytopal congestion games. Finally, we generalize and extend results on the computation of strong equilibria in bottleneck congestion games studied by Harks, Hoefer, Klimm and Skopalik (2013). In particular, we show that strong equilibria can be computed efficiently for symmetric totally unimodular bottleneck congestion games. In general, our results reveal that the combination of IDP and box-TDI gives rise to an efficient approach to compute a pure Nash equilibrium whose inefficiency is better than in general congestion games.
Starting Page	223
Ending Page	240
Page Count	18
File Format	PDF
ISBN	9781450345279
DOI	10.1145/3033274.3085149
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-06-20
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in