Results 81 to 90 of about 9,788 (160)

Weight‐ranked divide‐and‐conquer contracts

Theoretical Economics, Volume 20, Issue 3, Page 857-882, July 2025.
This paper studies a large class of multi‐agent contracting models with the property that agents' payoffs constitute a weighted potential game. Multiple equilibria arise due to agents' strategic interactions. I fully characterize a contracting scheme that is optimal for the principal for all equilibrium selection criteria that are more pessimistic than
Lester T. Chan
wiley   +1 more source

Unified gross substitutes and inverse isotonicity for equilibrium problems

Theoretical Economics, Volume 20, Issue 3, Page 941-971, July 2025.
We introduce a notion of substitutability for correspondences and establish a monotone comparative static result. More precisely, we introduce the notions of unified gross substitutes and nonreversingness and show that if Q:P⇉Q is a supply correspondence defined on a set of prices P, which is a sublattice of RN, and Q satisfies these two properties ...
Alfred Galichon, Larry Samuelson, Lucas Vernet   +2 more
wiley   +1 more source

An experimental study of decentralized matching

Quantitative Economics, Volume 16, Issue 2, Page 497-533, May 2025.
We present an experimental study of decentralized two‐sided matching markets with no transfers. Experimental participants are informed of everyone's preferences and can make arbitrary nonbinding match offers that get finalized when a period of market inactivity has elapsed. Several insights emerge. First, stable outcomes are prevalent.
Federico Echenique, Alejandro Robinson‐Cortés, Leeat Yariv   +2 more
wiley   +1 more source

Cost-Oriented Mobility-Aware Caching Strategies in D2D Networks With Delay Constraint

IEEE Access, 2019
Pre-caching popular files at mobile users with the aid of device-to-device (D2D) communications can offload the data traffic to low-cost D2D links and reduce the network transmission cost.
Ruijin Sun, Tingting Yang, Ailing Wang, Meng Qin, Zixuan Fei, Ying Wang   +5 more
doaj   +1 more source

Basilica: New canonical decomposition in matching theory

Journal of Graph Theory, Volume 108, Issue 3, Page 508-542, March 2025.
Abstract In matching theory, one of the most fundamental and classical branches of combinatorics, canonical decompositions of graphs are powerful and versatile tools that form the basis of this theory. However, the abilities of the known canonical decompositions, that is, the Dulmage–Mendelsohn, Kotzig–Lovász, and Gallai–Edmonds decompositions, are ...
Nanao Kita
wiley   +1 more source

Dynamic Stepsize Techniques in DR-Submodular Maximization

Mathematics
The Diminishing-Return (DR)-submodular function maximization problem has garnered significant attention across various domains in recent years. Classic methods often employ continuous greedy or Frank–Wolfe approaches to tackle this problem; however, high
Yanfei Li, Min Li, Qian Liu, Yang Zhou
doaj   +1 more source

A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions

, 2000
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular set functions, answering an open question posed in 1981 by Grotschel, Lovasz, and Schrijver.
Fleischer, Lisa, Fujishige, Satoru, Iwata, Satoru   +2 more
core   +1 more source

Community-Aware Two-Stage Diversification for Social Media User Recommendation with Graph Neural Networks

Information
The occurrence of filter bubbles and echo chambers in social media recommendation systems poses a significant threat to information diversity and democratic discourse. Although graph neural networks (GNNs) achieve leading accuracy in user recommendation,
Soh Yoshida
doaj   +1 more source

Procurement Auctions via Approximately Optimal Submodular Optimization

We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs. The quality of services is measured by a submodular function known to the auctioneer. Our goal is to design computationally efficient procurement auctions that (approximately) maximize the difference between the quality of the ...
Deng, Yuan, Karbasi, Amin, Mirrokni, Vahab, Leme, Renato Paes, Velegkas, Grigoris, Zuo, Song   +5 more
openaire   +2 more sources

Categorical Feature Compression via Submodular Optimization

, 2019
In the era of big data, learning from categorical features with very large vocabularies (e.g., 28 million for the Criteo click prediction dataset) has become a practical challenge for machine learning researchers and practitioners. We design a highly-scalable vocabulary compression algorithm that seeks to maximize the mutual information between the ...
Bateni, MohammadHossein, Chen, Lin, Esfandiari, Hossein, Fu, Thomas, Mirrokni, Vahab S., Rostamizadeh, Afshin   +5 more
openaire   +2 more sources