Cover Image

Computing approximate roots of monotone functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hollender, Alexandros, Lawrence, Chester, Segal-Halevi, Erel
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Numerical Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Equilibrium Points of Electrostatic Potentials
by: Ghosh, Abheek, et al.
Published: (2025)

Perpetually Fair Assignments Via Balanced Sequences of Permutations
by: Adams, Terrence, et al.
Published: (2026)

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)

Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)

Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)

What Are People's Actual Utility Functions in Budget Aggregation?
by: Amster, Ayelet, et al.
Published: (2025)

Fair Allocation with Money: What is Your Objective?
by: Elmalem, Noga Klein, et al.
Published: (2025)

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)

The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

Coordinating Charitable Donations with Leontief Preferences
by: Brandt, Felix, et al.
Published: (2023)

Optimal Budget Aggregation with Star-Shaped Preference Domains
by: Brandt, Felix, et al.
Published: (2024)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)

On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023)

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)

Tight Inapproximability of Nash Equilibria in Public Goods Games
by: Dinh, Jérémi Do, et al.
Published: (2024)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
by: Hollender, Alexandros, et al.
Published: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)

Constant Inapproximability for PPA
by: Deligkas, Argyrios, et al.
Published: (2022)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
by: Deligkas, Argyrios, et al.
Published: (2026)

Pure-Circuit: Tight Inapproximability for PPAD
by: Deligkas, Argyrios, et al.
Published: (2022)

Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
by: Elmalem, Noga Klein, et al.
Published: (2025)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)

Parrondo's effects with aperiodic protocols
by: Pires, Marcelo A., et al.
Published: (2024)

V3rified: Revelation vs Non-Revelation Mechanisms for Decentralized Verifiable Computation
by: Gong, Tiantian, et al.
Published: (2024)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

Metric Distortion of Obnoxious Distributed Voting
by: Voudouris, Alexandros A.
Published: (2024)

On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
by: Mehra, Arnav, et al.
Published: (2025)

Fair and Efficient Allocations Without Obvious Manipulations
by: Psomas, Alexandros, et al.
Published: (2022)

Global Convergence to Nash Equilibrium in Nonconvex General-Sum Games under the $n$-Sided PL Condition
by: Chao, Yutong, et al.
Published: (2026)