Akihisa Tamura

Orcid: 0000-0001-9528-7582

According to our database1, Akihisa Tamura authored at least 41 papers between 1989 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints.
Artif. Intell., 2023

2022
Fair and Truthful Mechanism with Limited Subsidy.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2020
Integrality of subgradients and biconjugates of integrally convex functions.
Optim. Lett., 2020

Discrete Midpoint Convexity.
Math. Oper. Res., 2020

2019
Scaling, proximity, and optimization of integrally convex functions.
Math. Program., 2019

2018
Designing matching mechanisms under constraints: An approach from discrete convex analysis.
J. Econ. Theory, 2018

Efficient Allocation Mechanism with Endowments and Distributional Constraints.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2016
Stable Marriage and Discrete Convex Analysis.
Encyclopedia of Algorithms, 2016

Trading networks with bilateral contracts.
EAI Endorsed Trans. Serious Games, 2016

Scaling and Proximity Properties of Integrally Convex Functions.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Designing Matching Mechanisms under General Distributional Constraints.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2012
Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope.
Discret. Appl. Math., 2012

2011
Construction of Hamilton Path Tournament Designs.
Graphs Comb., 2011

2008
Stable Marriage and Discrete Convex Analysis.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the existence of sports schedules with multiple venues.
Discret. Appl. Math., 2008

2007
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis.
Math. Oper. Res., 2007

2006
A general two-sided matching market with discrete concave utility functions.
Discret. Appl. Math., 2006

2005
Coordinatewise domain scaling algorithm for M-convex function minimization.
Math. Program., 2005

A Semidefinite Programming Relaxation for the Generalized Stable Set Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2004
Proximity theorems of discrete convex functions.
Math. Program., 2004

2003
On convolution of <i>L</i>-convex functions.
Optim. Methods Softw., 2003

Polyhedral Proof of a Characterization of Perfect Bidirected Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discret. Appl. Math., 2003

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001
On Circuit Valuation of Matroids.
Adv. Appl. Math., 2001

Application of M-Convex Submodular Flow Problem to Mathematical Economics.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Perfect (0, ±1)-matrices and perfect bidirected graphs.
Theor. Comput. Sci., 2000

1998
EP Theorems and Linear Complementarity Problems.
Discret. Appl. Math., 1998

The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
SIAM J. Comput., 1997

1995
Ideal polytopes and face structures of some combinatorial optimization problems.
Math. Program., 1995

1994
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane.
Oper. Res. Lett., 1994

The Rooted Tree Embedding Problem into Points in the Plane.
Discret. Comput. Geom., 1994

Algorithms for finding a Kth best valued assignment.
Discret. Appl. Math., 1994

1993
Transformation from Arbitrary Matchings to Stable Matchings.
J. Comb. Theory, Ser. A, 1993

Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.
Discret. Appl. Math., 1993

1992
Degree Constrained Tree Embedding Into Points in the Plane.
Inf. Process. Lett., 1992

1991
Bounding the number of k-faces in arrangements of hyperplanes.
Discret. Appl. Math., 1991

Combinatorial face enumeration in arrangements and oriented matroids.
Discret. Appl. Math., 1991

1989
Characterizations of *-families.
J. Comb. Theory, Ser. B, 1989


  Loading...