Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming

Caragiannis, Ioannis; Jiang, Zhile

doi:10.1145/3564246.3585236

Proceedings of the 55th Annual ACM Symposium on Theory of Computing 2023

DOI: 10.1145/3564246.3585236

|View full text |Cite

Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming

Ioannis Caragiannis

Zhile Jiang

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Optimizing Over Serial Dictatorships

Caragiannis,

Rathi

2024

Theory Comput Syst

View full text Add to dashboard Cite

Motivated by the success of the serial dictatorship mechanism in social choice settings, we explore its usefulness in tackling various combinatorial optimization problems. We do so by considering an abstract model, in which a set of agents are asked to act in a particular ordering, called the action sequence. Each agent acts in a way that gives her the maximum possible value, given the actions of the agents who preceded her in the action sequence. Our goal is to compute action sequences that yield approximately optimal total value to the agents (a.k.a., social welfare). We assume query access to the value $$v_i(S)$$ v i ( S ) that the agent i gets when she acts after the agents in the ordered set S. We establish tight bounds on the social welfare that can be achieved using polynomially many queries. Even though these bounds show a marginally sublinear approximation of optimal social welfare in general, excellent approximations can be obtained when the valuations stem from an underlying combinatorial domain. Indicatively, when the valuations are defined using bipartite matchings, arborescences in directed graphs, and satisfiability of Boolean expressions, simple query-efficient algorithms yield 2-approximations. We discuss issues related to truthfulness and show how some of our algorithms can be implemented truthfully using VCG-like payments. Finally, we introduce and study the price of serial dictatorship, a notion that provides an optimistic measure of the quality of combinatorial optimization solutions generated by action sequences.

show abstract

Optimizing Over Serial Dictatorships

Caragiannis,

Rathi

2024

Theory Comput Syst

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Computing Better Approximate Pure Nash Equilibria in Cut Games via Semidefinite Programming

Cited by 1 publication

References 33 publications

Optimizing Over Serial Dictatorships

Optimizing Over Serial Dictatorships

Contact Info

Product

Resources

About